{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:27:09Z","timestamp":1742380029247},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226666"},{"type":"electronic","value":"9783540286325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28632-5_28","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T16:45:31Z","timestamp":1285001131000},"page":"386-399","source":"Crossref","is-referenced-by-count":8,"title":["XTR Implementation on Reconfigurable Hardware"],"prefix":"10.1007","author":[{"given":"Eric","family":"Peeters","sequence":"first","affiliation":[]},{"given":"Michael","family":"Neve","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Ciet","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"IEEE Std 1363-2000. IEEE Standard Specifications for Public-Key Cryptography. IEEE Computer Society, August 29 (2000)"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","first-page":"311","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"P. Barrett","year":"1987","unstructured":"Barrett, P.: Implementing the rivest shamir and adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 311\u2013323. Springer, Heidelberg (1987)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1145\/322261.322269","volume":"28","author":"R.P. Brent","year":"1981","unstructured":"Brent, R.P., Kung, H.T.: The Area-Time Complexity of Binary Multiplication. J. ACM\u00a028, 521\u2013534 (1981)","journal-title":"J. ACM"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Brickell, E.F.: A fast modular multiplication algorithm with application to two key cryptography. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in cryptology Proc. of CRYPTO 1982, pp. 51\u201360. Plenum Press (1983)","DOI":"10.1007\/978-1-4757-0602-4_5"},{"issue":"7","key":"28_CR5","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1109\/12.936241","volume":"50","author":"T. Blum","year":"2001","unstructured":"Blum, T., Paar, C.: High-Radix montgomery modular exponentiation on reconfigurable hardware. IEEE Trans. on Computers\u00a050(7), 759\u2013764 (2001)","journal-title":"IEEE Trans. on Computers"},{"key":"28_CR6","unstructured":"Gong, G., Harn, L.: Public key cryptosystems based on cubic finite field extensions. IEEE Trans. on Inf. Theory (November 1999)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-24847-7_17","volume-title":"Algorithmic Number Theory","author":"R. Granger","year":"2004","unstructured":"Granger, R., Page, D., Stam, M.: A Comparison of CEILIDH and XTR. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol.\u00a03076, pp. 235\u2013249. Springer, Heidelberg (2004)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-36400-5_22","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"M. Joye","year":"2003","unstructured":"Joye, M., Yen, S.-M.: The Montgomery powering ladder. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 291\u2013302. Springer, Heidelberg (2003)"},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1049\/ip-cdt:19982091","volume":"145","author":"\u00c7.K. Ko\u00e7","year":"1998","unstructured":"Ko\u00e7, \u00c7.K., Hung, C.Y.: A Fast Algorithm for Modular Reduction. IEE Proceedings - Computers and Digital Techniques\u00a0145(4), 265\u2013271 (1998)","journal-title":"IEE Proceedings - Computers and Digital Techniques"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-45537-X_23","volume-title":"Selected Areas in Cryptography","author":"S. Lim","year":"2001","unstructured":"Lim, S., Kim, S., Yie, I., Kim, J.M., Lee, H.: XTR Extended to GF(p6m). In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol.\u00a02259, p. 301. Springer, Heidelberg (2001)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0027920","volume-title":"Information Security and Privacy","author":"A.K. Lenstra","year":"1997","unstructured":"Lenstra, A.K.: Using Cyclotomic Polynomials to Construct Efficient Discrete Logarithm Cryptosystems Over Finite Fields. In: Mu, Y., Pieprzyk, J.P., Varadharajan, V. (eds.) ACISP 1997. LNCS, vol.\u00a01270, pp. 127\u2013138. Springer, Heidelberg (1997)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44598-6_1","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A.K. Lenstra","year":"2000","unstructured":"Lenstra, A.K., Verheul, E.R.: The XTR public key system. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 1\u201319. Springer, Heidelberg (2000)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Verheul, E.R.: An overview of the XTR public key system. In: Public Key Cryptography and Computational Number Theory Conference (2000)","DOI":"10.1007\/3-540-44598-6_1"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-44448-3_17","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"A.K. Lenstra","year":"2000","unstructured":"Lenstra, A.K., Verheul, E.R.: Key improvements to XTR. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 220\u2013233. Springer, Heidelberg (2000)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-44586-2_6","volume-title":"Public Key Cryptography","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra, A.K., Verheul, E.R.: Fast irreductibility and subgroup membership testing in XTR. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 73\u201386. Springer, Heidelberg (2001)"},{"key":"28_CR16","unstructured":"McIvor, C., McLoone, M., McCanny, J., Daly, A., Marnane, W.: Fast Montgomery Modular Multiplication and RSA Cryptographic Processor Architectures. In: 37th Asilomar Conference on Signals, Systems, and Computers (November 2003)"},{"issue":"170","key":"28_CR17","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comp.\u00a044(170), 519\u2013521 (1985)","journal-title":"Math. Comp."},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-44499-8_3","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","author":"G. Orlando","year":"2000","unstructured":"Orlando, G., Paar, C.: A High Performance Reconfigurable Elliptic Curve Processor for GF(2m). In: Paar, C., Ko\u00e7, \u00c7.K. (eds.) CHES 2000. LNCS, vol.\u00a01965, pp. 41\u201356. Springer, Heidelberg (2000)"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-44709-1_29","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"G. Orlando","year":"2001","unstructured":"Orlando, G., Paar, C.: A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 348\u2013363. Springer, Heidelberg (2001)"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Parhami, B.: RNS representation with redundant residues. In: Proc. of the 35th Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA, November 4-7, pp. 1651\u20131655 (2001)","DOI":"10.1109\/ACSSC.2001.987765"},{"key":"28_CR21","unstructured":"Quisquater, J.-J.: Fast modular exponentiation without division. In: At Rump session of EUROCRYPT 1990 (May 1990)"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-540-45146-4_21","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"K. Rubin","year":"2003","unstructured":"Rubin, K., Silverberg, A.: Torus-based cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 349\u2013365. Springer, Heidelberg (2003)"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-39118-5_10","volume-title":"Advances in Cryptology - EUROCRYPT \u201987","author":"H. Sedlak","year":"1988","unstructured":"Sedlak, H.: The RSA cryptography processor. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol.\u00a0304, pp. 95\u2013105. Springer, Heidelberg (1988)"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0000447","volume-title":"Advances in Cryptology - ASIACRYPT \u201994","author":"P. Smith","year":"1995","unstructured":"Smith, P., Skinner, C.: A public-key cryptosystem and a digital signature system based on the Lucas function analogue to discret logarithms. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol.\u00a0917, pp. 357\u2013364. Springer, Heidelberg (1995)"},{"key":"28_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-45238-6_27","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"F.-X. Standaert","year":"2003","unstructured":"Standaert, F.-X., Rouvroy, G., Quisquater, J.-J., Legat, J.-D.: Efficient Implementation of Rijndael Encryption in Reconfigurable Hardware: Improvements and Design Tradeoffs. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 334\u2013350. Springer, Heidelberg (2003)"},{"key":"28_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-45682-1_8","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"M. Stam","year":"2001","unstructured":"Stam, M., Lenstra, A.K.: Speeding up XTR. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 125\u2013143. Springer, Heidelberg (2001)"},{"key":"28_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-44987-6_13","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"E.R. Verheul","year":"2001","unstructured":"Verheul, E.R.: Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 195\u2013210. Springer, Heidelberg (2001)"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/3-540-36400-5_36","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"J. Wolkerstorfer","year":"2003","unstructured":"Wolkerstorfer, J.: Dual-field arithmetic unit for GF(p) and GF(2 m ). In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 500\u2013514. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28632-5_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T03:22:46Z","timestamp":1636514566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28632-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226666","9783540286325"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28632-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}