{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:21:13Z","timestamp":1738387273462,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699712"},{"type":"electronic","value":"9783540705000"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70500-0_34","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"463-477","source":"Crossref","is-referenced-by-count":15,"title":["Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Negre","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Plantard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"FIPS PUB 197: Advanced Encryption Standard (AES). FIPS PUB. NIST (2001)"},{"key":"34_CR2","unstructured":"The GNU Multiple Precision arithmetic librairy (May 2006)"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/12.709376","volume":"47","author":"J.-C. Bajard","year":"1998","unstructured":"Bajard, J.-C., Didier, L.-S., Kornerup, P.: An RNS Montgomery modular multiplication algorithm. IEEE Transactions on Computers\u00a047, 766\u2013776 (1998)","journal-title":"IEEE Transactions on Computers"},{"issue":"9","key":"34_CR4","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1109\/TC.2006.136","volume":"55","author":"J.-C. Bajard","year":"2006","unstructured":"Bajard, J.-C., Imbert, L., N\u00e8gre, C.: Arithmetic operations in finite fields of medium prime characteristic using the lagrange representation. IEEE Trans. Computers\u00a055(9), 1167\u20131177 (2006)","journal-title":"IEEE Trans. Computers"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Bajard, J.-C., Imbert, L., Negre, C., Plantard, T.: Efficient multiplication in gf(p k ) for elliptic curve cryptography. In: ARITH\u201916: IEEE Symposium on Computer Arithmetic, June 2003, pp. 181\u2013187 (2003)","DOI":"10.1109\/ARITH.2003.1207677"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-3-540-30564-4_11","volume-title":"Selected Areas in Cryptography","author":"J.-C. Bajard","year":"2004","unstructured":"Bajard, J.-C., Imbert, L., Plantard, T.: Modular Number Systems: Beyond the Mersenne Family. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 159\u2013169. Springer, Heidelberg (2004)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Bajard, J.-C., Imbert, L., Plantard, T.: Arithmetic operations in the polynomial modular number system. In: ARITH\u201917: IEEE Symposium on Computer Arithmetic (June 2005)","DOI":"10.1109\/ARITH.2005.11"},{"issue":"1","key":"34_CR8","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/18.651011","volume":"44","author":"A.H. Banihashemi","year":"1998","unstructured":"Banihashemi, A.H., Khandani, A.K.: On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis. IEEE Transactions on Information Theory\u00a044(1), 162\u2013171 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"34_CR9","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)"},{"issue":"2","key":"34_CR10","first-page":"89","volume":"5","author":"G. Brassard","year":"1986","unstructured":"Brassard, G., Monet, S., Zuffellato, D.: Algorithms for very large integer arithmetic. Tech. Sci. Inf.\u00a05(2), 89\u2013102 (1986)","journal-title":"Tech. Sci. Inf."},{"key":"34_CR11","volume-title":"Grad. Texts Math","author":"H. Cohen","year":"1993","unstructured":"Cohen, H.: A course in computational algebraic number theory. In: Grad. Texts Math, vol.\u00a0138, Springer, Heidelberg (1993)"},{"issue":"6","key":"34_CR12","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. on Inf. Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. on Inf. Theory"},{"issue":"3","key":"34_CR13","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R. Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res.\u00a012(3), 415\u2013440 (1987)","journal-title":"Math. Oper. Res."},{"issue":"177","key":"34_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2307\/2007884","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation\u00a048(177), 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"key":"34_CR15","first-page":"513","volume-title":"Mathematische Annalen","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. In: Mathematische Annalen, vol.\u00a0261, pp. 513\u2013534. Springer, Heidelberg (1982)"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V. Miller","year":"1986","unstructured":"Miller, V.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"34_CR17","unstructured":"Minkowski, H.: Geometrie der Zahlen. In: Teubner, B.G. (ed.) Leipzig (1896)"},{"issue":"170","key":"34_CR18","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation\u00a044(170), 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"issue":"2","key":"34_CR19","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Com. of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Com. of the ACM"},{"key":"34_CR20","unstructured":"Schnorr, C.-P.: Block Korkin-Zolotarev bases and successive minima (1996)"},{"issue":"1","key":"34_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2005.04.004","volume":"204","author":"C.-P. Schnorr","year":"2006","unstructured":"Schnorr, C.-P.: Fast LLL-type lattice reduction. Information and Computation\u00a0204(1), 1\u201325 (2006)","journal-title":"Information and Computation"},{"key":"34_CR22","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Schonhage","year":"1971","unstructured":"Schonhage, A., Strassen, V.: Schnelle multiplikation grosser zahlen. Computing\u00a07, 281\u2013292 (1971)","journal-title":"Computing"},{"key":"34_CR23","unstructured":"Solinas, J.: Generalized Mersenne numbers. Research Report CORR-99-39, Center for Applied Cryptographic Research, University of Waterloo, Canada (1999)"},{"key":"34_CR24","volume-title":"Modern Computer Algebra","author":"J. Gathen von zur","year":"2003","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70500-0_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T12:11:35Z","timestamp":1738325495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70500-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699712","9783540705000"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70500-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}