Suchergebnisse - acm: c.: computer system organizacion/c.1: processor architectural

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12

    Autoren: 蘇持平 Chih-Pin Su 吳誠文 et al.

    Weitere Verfasser: 蘇持平 Chih-Pin Su 吳誠文 et al.

    Time: 45

    Dateibeschreibung: 155 bytes; text/html

    Relation: [1] W. Stallings, Cryptography and Network Security: Principles and Practices. Upper Saddle River, NJ, 07458: Prentice-Hall Inc., 2003. [2] SafeNet, Inc., “SaftNet SafeXcel-1842 Product Brief,” 2003. [3] Hifn, Inc., “HIPP III FlowThrough Security Processor Product Brief,” 2003. [4] Intel, Inc., “Intel IXP2850 Network Processor Product Brief,” 2003. [5] National Institute of Standards and Technology (NIST), Advanced Encryption Standard (AES). Springfield, VA 22161: National Technical Information Service, Nov. 2001. [6] P. Fergguson and G. Huston, “What is a VPN?—Part I,” The Internet Protocol Journal, vol. 1, pp. 2–19, June 1998. http://www.cisco.com/warp/public/759/. [7] S. Kent and R. Atkinson, Security Architecture for the Internet Protocol. IETF Network Working Group, 1998. RFC 2401. [8] R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, pp. 120–126, Feb. 1978. [9] N. Koblitz, “Elliptic curve cryptosystems,” in Mathmatics of Computation, pp. 203–209, 1987. [10] W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Trans. Information Theory, vol. 22, pp. 644–654, Nov. 1976. [11] National Institute of Standards and Technology (NIST), Data Encryption Standard (DES). Springfield, VA 22161: National Technical Information Service, Oct. 1999. [12] National Institute of Standards and Technology (NIST), Secure Hash Standard (SHS). Spring- field, VA 22161: National Technical Information Service, Aug. 2002. [13] R. L. Rivest, “The MD5 message-digest algorithm.” RFC 1321, the Internet Society, Apr. 1992. [14] P. L. Montgomery, “Modular multiplication without trial division,” Math. Computation, vol. 44, no. 7, pp. 519–521, 1985. [15] P.-S. Chen, S.-A. Hwang, and C.-W.Wu, “A systolic RSA public key cryptosystem,” in Proc. IEEE Int. Symp. Circuits and Systems (ISCAS), vol. 4, (Atlanta), pp. 408–411, May 1996. [16] C.-C. Yang, T.-S. Chang, and C.-W. Jen, “A new RSA cryptosystem hardware design based on Montgomery’s algorithm,” IEEE Trans. Circuits and Systems II: Analog and Digital Signal Processing, vol. 45, pp. 908–913, July 1998. [17] C.-Y. Su, S.-A. Hwang, P.-S. Chen, and C.-W. Wu, “An improved Montgomery algorithm for high-speed RSA public-key cryptosystem,” IEEE Trans. VLSI Systems, vol. 7, pp. 280–284, June 1999. [18] J.-H. Hong and C.-W. Wu, “A radix-4 cellular array modular multiplier based on Montgomery’s algorithm and Booth’s algorithm,” in Proc. 10th VLSI Design/CAD Symp., (Nantou), pp. 165–168, Aug. 1999. [19] C.-H. Wu, J.-H. Hong, and C.-W. Wu, “VLSI design of RSA cryptosystem based on the Chinese Remainder Theorem,” J. Inform. Science and Engineering, vol. 17, pp. 967–979, Nov. 2001. [20] Y.-C. Lin, “A word-based RSA public-key crypto-processor core for IC smart card,” master thesis, Dept. Electrical Engineering, National Tsing Hua University, Hsinchu, Taiwan, June 2001. [21] A. F. Tenca, G. Todorov, and C¸ .K.Koc¸, “High-radix design of a scalable modular multiplier,” in Cryptographic Hardware and Embedded Systems (CHES) 2001 (C¸ . K. Koc¸, D. Naccache, and C. Paar, eds.), vol. 2162 of LNCS, pp. 189–205, Springer-Verlag, 2001. [22] M.-C. Sun, C.-P. Su, C.-T. Huang, and C.-W. Wu, “Design of a scalable RSA and ECC crypto-processor,” in Proc. Asia and South Pacific Design Automation Conf. (ASP-DAC), (Kitakyushu), pp. 495–498, Jan. 2003. (Best Paper Award). [23] E. Savas¸, A. F. Tenca, and C¸ .K. Koc¸, “A scalable and unified multiplier architecture for finite fields GF(p) and GF(2m),” in Cryptographic Hardware and Embedded Systems (CHES) 2000, LNCS, pp. 281–296, Springer-Verlag, 2000. [24] J. Burke, J. McDonald, and T. Austin, “Architectural support for fast symmetric-key cryptography,” ACM SIGPLN Notices, vol. 35, pp. 178–189, Nov. 2000. [25] L. Wu, C. Weaver, and T. Austin, “CryptoManiac: A fast flexible architecture for secure communication,” in Proc. 28th Ann. Int. Symp. Computer Architecture, pp. 110–119, 2001. [26] C.-H. Wang, C.-P. Su, C.-T. Huang, and C.-W. Wu, “A word-based rsa crypto-processor with enhanced pipeline performance,” in Proc. 4th IEEE Asia-Pacific Conf. ASIC, (Fukuoka, Japan), Aug. 2004 (to appear). [27] M.-Y. Wang, C.-P. Su, C.-T. Huang, and C.-W. Wu, “An HMAC processor with integrated SHA-1 and MD5 algorithms,” in Proc. Asia and South Pacific Design Automation Conf. (ASP-DAC), (Yokohama), pp. 456–458, Jan. 2004. [28] C.-W. Wang, J.-R. Huang, K.-L. Cheng, H.-S. Hsu, C.-T. Huang, C.-W. Wu, and Y.-L. Lin, “A test access control and test integration system for system-on-chip,” in Sixth IEEE Int. Workshop on Testing Embedded Core-Based System-Chips (TECS), (Monterey, California), pp. P2.1–P2.8, May 2002. [29] A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Applied Cryptography. Boca Raton, FL: CRC Press, Oct. 1996. [30] N. I. of Standards and T. (NIST), The Keyed-Hash Message Authentication Code (HMAC). Springfield, VA 22161: National Technical Information Service, Mar. 2002. [31] N. Cravotta, “Accelerating high-speed encryption: one bottleneck after another,” 2001. [32] W. Feghali, B. Burres, G. Wolrich, and D. Carrigan, “Security: Adding protection to the network via the network processor,” Intel Technology Journal, vol. 6, no. 3, pp. 40–49, 2002. [33] P. C. Lekkas, Network Processors: Architectures, Protocols, and Platforms. McGraw-Hill, 2003. [34] E. Khan, M. W. El-Kharashi, A. N. M. E. Rafiq, F. Gebali, and M. Abd-El-Barr, “Network processors for communication security: A review,” in Proc. IEEE Pacific Rim Conf. Communications, Computers and Signal Processing, pp. 173–176, 2003. [35] V. R. J.Daemen, “The Block Cipher Rijndael,” in Smart Card Research and Application, vol. 1820 of LNCS, pp. 288–296, Springer-Verlag, 2000. [36] A. Dandalis, V. K. Prasanna, and J. D. P. Rolim, “A comparative study of performance of AES final candidates using FPGAs,” in Cryptographic Hardware and Embedded Systems (CHES) 2000, vol. 1965 of LNCS, pp. 125–140, Springer-Verlag, Aug. 2000. [37] K. Gaj and P. Chodowiec, “Fast implementation and fair comparison of the final candidates for advanced encryption standard using field programmable gate arrays,” in Proc. RSA Security Conf., Cryptographer’s Track, vol. 2020 of LNCS, pp. 84–99, Springer-Verlag, Apr. 2001. [38] S. McMillan and C. Patterson, “JBits implementations of the advanced encryption standard (Rijndael),” in Proc. 11th Int. Conf. Field-Programmable Logic and Applications (FPL), vol. 2147 of LNCS, pp. 162–171, Springer-Verlag, Aug. 2001. [39] P. Chodowiec, K. Gaj, P. Bellows, and B. Schott, “Experimental testing of the Gigabit IPSeccompliant implementations of Rijndael and triple DES using SLAAC-1V FPGA accelerator board,” in Proc. Information Security Conf. (ISC), vol. 2200 of LNCS, pp. 220–234, Springer- Verlag, Oct. 2001. [40] K. U. Jarvinen, M. T. Tommiska, and J. O. Skytta, “A fully pipelined memoryless 17.8 Gbps AES-128 encryptor,” in Proc. Int. Symp. Field-Programmable Gate Arrays (FPGA), (Monterey), pp. 207–215, ACM Press, 2003. [41] I. Verbauwhede, P. Schaumont, and H. Kuo, “Design and performance testing of a 2.29-GB/s Rijndael processor,” IEEE Journal of Solid-State Circuits, vol. 38, pp. 569–572, Mar. 2003. [42] V. Fischer and M. Drutarovsky, “Two methods of Rijndael implementation in reconfigurable hardware,” in Cryptographic Hardware and Embedded Systems (CHES) 2001, vol. 2162 of LNCS, pp. 77–92, Springer-Verlag, May 2001. [43] S. Morioka and A. Satoh, “A 10Gbps full-AES crypto design with a twisted-BDD S-Box architecture,” in Proc. IEEE Int. Conf. Computer Design (ICCD), (Freiburg, Germany), pp. 98– 103, Sept. 2002. [44] U. Mayer, C. Oelsner, and T. Kohler, “Evaluation of different Rijndael implementations for high end servers,” in Proc. IEEE Int. Symp. Circuits and Systems (ISCAS), vol. 2, pp. 348– 351, May 2002. [45] V. Rijmen, “Efficient implementation of the Rijndael S-box.” http://www.esat.kuleuven.ac.be/˜rijmen/rijndael/sbox.pdf. [46] A. Satoh, S. Morioka, K. Takano, and S. Munetoh, “A compact Rijndael hardware architecture with S-box optimization,” in ASIACRYPT 2001, vol. 2248 of LNCS, pp. 239–254, Springer-Verlag, 2001. [47] J. Wolkerstorfer, E. Oswald, and M. Lamberger, “An ASIC implementation of the AES SBoxes,” in CT-RSA 2002, vol. 2271 of LNCS, pp. 67–78, Springer-Verlag, 2002. [48] T.-F. Lin, C.-P. Su, C.-T. Huang, and C.-W. Wu, “A high-throughput low-cost AES cipher chip,” in Proc. 3rd IEEE Asia-Pacific Conf. ASIC, (Taipei), pp. 85–88, Aug. 2002. [49] S. Mangard, M. Aigner, and S. Dominikus, “A highly regular and scalable AES hardware architecture,” IEEE Trans. Computers, vol. 52, pp. 483–491, Apr. 2003. [50] S. Morioka and A. Satoh, “An optimized S-box circuit architecture for low power AES design,” in Cryptographic Hardware and Embedded Systems (CHES) 2002, vol. 2523 of LNCS, pp. 172–186, Springer-Verlag, 2002. [51] A. Satoh, S. Morioka, K. Takano, and S. Munetoh, “Unified hardware architecture for 128- bit block ciphers AES and Camellia,” in Cryptographic Hardware and Embedded Systems (CHES) 2003, Springer-Verlag, Aug. 2003. [52] H. Kuo and I. Verbauwhede, “Architectural optimization for a 1.82 Gbits/sec VLSI implementation of the AES Rijndael algorithm,” in Cryptographic Hardware and Embedded Systems (CHES) 2001 (C¸ . K. Koc¸, D. Naccache, and C. Paar, eds.), vol. 2162 of LNCS, Springer- Verlag, May 2001. [53] J. H. Shim, D.W. Kim, Y. K. Kang, T.W. Kwon, and J. R. Choi, “A Rijndael cryptoprocessor using shared on-the-fly key scheduler,” in Proc. 3rd IEEE Asia-Pacific Conf. ASIC, (Taipei), pp. 89–92, Aug. 2002. [54] C.-P. Su, T.-F. Lin, C.-T. Huang, and C.-W.Wu, “A high-throughput low-cost AES processor,” IEEE Communications Magazine, vol. 41, pp. 86–91, Dec. 2003. [55] C.-L. Horng and C.-W.Wu, “An aes cipher chip design using on-the-fly key scheduler,” Master’s thesis, National Tsing-Hua University, Electrical Engineering Department, June 2004. [56] W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes. Cambridge, MA: MIT Press, 2 ed., 1972. [57] C. Paar, “A new architecture for a parallel finite field multiplier with low complexity based on composite fields,” IEEE Trans. Computers, vol. 45, pp. 856–861, July 1996. [58] I. ARM Components, AMBA Specification Rev2.0, May 1999. [59] T. Ichikawa, T. Kasuya, and M. Matsui, “Hardware evaluation of the AES finalists,” in Proc. 3rd AES Candidate Conference, 2000. [60] ARM components, Inc., “Multi-Layer AHB,” 2001. [61] IEEE, “IEEE P1500 standard for embedded core test (SECT).” http://grouper.ieee.org/groups/1500/, 2002. [62] IEEE, IEEE Standard Test Interface Language (STIL) for Digital Test Vector Data. Piscataway: IEEE Standards Department, Sept. 1999. [63] Y. Zorian, E. J. Marinissen, and S. Dey, “Testing embedded-core based system chips,” in Proc. Int. Test Conf. (ITC), pp. 130–143, Oct. 1998. [64] J. Aerts and E. J. Marinissen, “Scan chain design for test time reduction in core-based ICs,” in Proc. Int. Test Conf. (ITC), pp. 448–457, 1998. [65] V. Iyengar and K. Chakrabarty, “Precedence-based, preemptive, and power-constrained test scheduling for system-on-a-chip,” in Proc. IEEE VLSI Test Symp. (VTS), pp. 368–374, 2001. [66] R. M. Chou, K. K. Saluja, and V. D. Agrawal, “Scheduling tests for VLSI systems under power constraints,” IEEE Trans. VLSI Systems, vol. 5, pp. 175–185, June 1997. [67] K. Chakrabarty, “Test scheduling for core-based systems using mixed-integer linear programming,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 19, pp. 1163–1174, Oct. 2000. [68] K. Chakrabarty, “Design of system-on-a-chip test access architecture using integer linear programming,” in Proc. IEEE VLSI Test Symp. (VTS), pp. 127–134, 2000. [69] K. Chakrabarty, “Design of system-on-a-chip test access architecture under place-and-route and power constraints,” in Proc. IEEE/ACM Design Automation Conf. (DAC), pp. 432–437, 2000. [70] V. Muresan, X. Wang, V. Muresan, and M. Vladutiu, “A comparison of classical scheduling approaches in power-constrained block-test scheduling,” in Proc. Int. Test Conf. (ITC), pp. 882–891, 2000. [71] V. Iyengar, K. Chakrabarty, and E. J. Marinissen, “Test wrapper and test access mechanism co-optimzation for system-on-chip,” in Proc. Int. Test Conf. (ITC), (Baltimore), pp. 1023– 1032, Oct. 2001. [72] E. Larsson and Z. Peng, “An integrated system-on-chip test framework,” in Proc. Design, Automation and Test in Europe (DATE), (Munich), pp. 138–144, Mar. 2001. [73] V. Iyengar, K. Chakrabary, and E. J.Marinissen, “Efficient wrapper/TAMco-optimization for large SOCs,” in Proc. Design, Automation and Test in Europe (DATE), (Paris), pp. 491–498, Mar. 2002. [74] V. Iyengar, K. Chakrabarty, and E. J.Marinissen, “On using rectangle packing for SOC wrapper/ TAM co-optimization,” in Proc. IEEE VLSI Test Symp. (VTS), (Monterey), pp. 253–258, Apr. 2002. [75] S. K. Goel and E. J. Marinissen, “Cluster-based test architecture design for system-on-chip,” in Proc. IEEE VLSI Test Symp. (VTS), (Monterey), pp. 259–264, Apr. 2002. [76] S. K. Goel and E. J. Marinissen, “Effective and efficient test architecture design for SOCs,” in Proc. Int. Test Conf. (ITC), (Baltimore), pp. 529–538, Oct. 2002. [77] Y. Huang, W.-T. Cheng, C.-C. Tsai, N. Mukherjee, O. Samman, Y. Zaidan, and S. M. Reddy, “Resource allocation and test scheduling for concurrent test of core-based SOC design,” in Proc. Tenth IEEE Asian Test Symp. (ATS), (Kyoto), pp. 265–270, Nov. 2001. [78] Y. Huang, S. M. Reddy, W.-T. Cheng, and P. Reuter, “Optimal core wrapper width selection and SOC test scheduling based on 3-D bin packing algorithm,” in Proc. Int. Test Conf. (ITC), (Baltimore), pp. 74–82, Oct. 2002. [79] G. L. Craig, C. R. Kime, and K. K. Saluja, “Test scheduling and control for VLSI built-in self-test,” IEEE Trans. Computers, vol. 37, pp. 1099–1109, Sept. 1988. [80] V. Iyengar, K. Chakrabarty, and E. J. Marinissen, “Integrated wrapper/TAM co-optimization, constraint-driven test scheduling, and tester data volumne reduction for SOCs,” in Proc. IEEE/ACM Design Automation Conf. (DAC), (New Orleans), pp. 685–690, June 2002. [81] C.-P. Su and C.-W. Wu, “Graph-based power-constrained test scheduling for SOC,” in Proc. IEEE Int. Workshop on Design and Diagnostics of Electronic Circuits and Systems (DDECS), (Brno, Czech Republic), pp. 61–68, Apr. 2002. (Best Paper Award). [82] E. Marinissen, R. Kapur, and Y. Zorian, “On using IEEE P1500 SECT for test plug-n-play,” in Proc. Int. Test Conf. (ITC), pp. 770–777, 2000. [83] E. J. Marinissen, S. Goel, and M. Lousberg, “Wrapper design for embedded core test,” in Proc. Int. Test Conf. (ITC), pp. 911–920, 2000. [84] E. J. Marinissen and S. K. Goel, “Analysis of test bandwidth utilization in test bus and TestRail architectures for SOCs,” in Proc. IEEE Int. Workshop on Design and Diagnostics of Electronic Circuits and Systems (DDECS), pp. 52–60, Apr. 2002. [85] V. Iyengar and K. Chakrabarty, “Test bus sizing for system-on-a-chip,” IEEE Trans. Computers, vol. 51, pp. 449–459, May 2002. [86] M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. New York: Academic Press, 1980. [87] W.-L. Hsu and T.-H. Ma, “Fast and simple algorithm for recognizing chordal comparability graphs and interval graphs,” SIAM J. Computing, vol. 28, no. 3, pp. 1004–1020, 1999. [88] E. T. F. Glover and D. de Werra, “A user’s guide to Tabu Search,” Annals of Operations Research, vol. 41, pp. 3–28, 1993. [89] E. J. Marinissen, V. Iyengar, and K. Chakrabarty, “A set of benchmarks for modular testing of SOCs,” in Proc. Int. Test Conf. (ITC), (Baltimore), pp. 519–528, Oct. 2002. [90] C.-P. Su and C.-W.Wu, “A graph-based approach to power-constrained SOC test scheduling,” J. Electronic Testing: Theory and Applications, vol. 20, pp. 45–60, Feb. 2003.; http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/36018

  13. 13
  14. 14
  15. 15
  16. 16

    Quelle: Bringing Theory to Practice: Predictability and Performance in Embedded Systems ; https://inria.hal.science/inria-00585320 ; Bringing Theory to Practice: Predictability and Performance in Embedded Systems, Philipp Lucas, Lothar Thiele, Benoit Triquet, Theo Ungerer, and Reinhard Wilhelm, Mar 2011, Grenoble, France. pp.11-21, ⟨10.4230/OASIcs.PPES.2011.11⟩ ; http://drops.dagstuhl.de/opus/volltexte/2011/3077/pdf/2.pdf

    Geographisches Schlagwort: Grenoble, France

  17. 17

    Quelle: ACM symposium on Principles of distributed computing (PODC'13) ; https://hal.science/hal-01151136 ; ACM symposium on Principles of distributed computing (PODC'13), Jul 2013, New-York, United States. pp.84-91, ⟨10.1145/2484239.2484271⟩

    Geographisches Schlagwort: New-York, United States

  18. 18
  19. 19
  20. 20