{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:51:27Z","timestamp":1743126687294,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642145179"},{"type":"electronic","value":"9783642145186"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14518-6_7","type":"book-chapter","created":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T06:45:55Z","timestamp":1278571555000},"page":"32-49","source":"Crossref","is-referenced-by-count":0,"title":["Smallest Reduction Matrix of Binary Quadratic Forms"],"prefix":"10.1007","author":[{"given":"Aurore","family":"Bernard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Gama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Biehl, I., Buchmann, J.: An analysis of the reduction algorithms for binary quadratic forms. In: Voronoi\u2019s Impact on Modern Science, pp. 71\u201398 (1999)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-48405-1_21","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.A.: Factoring n\u2009=\u2009p\n                           \n                    r\n                  \n                           q for large r. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, p. 326. Springer, Heidelberg (1999)"},{"key":"7_CR3","first-page":"159","volume":"325","author":"J. Buchmann","year":"1995","unstructured":"Buchmann, J., Thiel, C., Williams, H.: Short representation of quadratic integers. Proc. of CANT 1992, Math. Appl.\u00a0325, 159\u2013185 (1995)","journal-title":"Proc. of CANT 1992, Math. Appl."},{"key":"7_CR4","volume-title":"Binary Quadratic Forms An Algorithmic Approach","author":"J. Buchmann","year":"2007","unstructured":"Buchmann, J., Vollmer, U.: Binary Quadratic Forms An Algorithmic Approach. Springer, Heidelberg (2007)"},{"key":"7_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4542-1","volume-title":"Binary Quadratic Forms Classical Theory and Modern Computations","author":"D.A. Buell","year":"1989","unstructured":"Buell, D.A.: Binary Quadratic Forms Classical Theory and Modern Computations. Springer, Heidelberg (1989)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Castagnos, G., Joux, A., Laguillaumie, F., Nguyen, P.Q.: Factoring pq\n                           2 with quadratic forms: Nice cryptanalyses. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 469\u2013486. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-10366-7_28"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-01001-9_15","volume-title":"Eurocrypt 2009","author":"G. Castagnos","year":"2010","unstructured":"Castagnos, G., Laguillaumie, F.: On the security of cryptosystems with quadratic decryption: The nicest cryptanalysis. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 260\u2013277. Springer, Heidelberg (2010)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.4064\/aa117-3-3","volume":"117","author":"K.H.F. Cheng","year":"2005","unstructured":"Cheng, K.H.F., Williams, H.C.: Some results concerning certain periodic continued fractions. Acta Arith.\u00a0117, 247\u2013264 (2005)","journal-title":"Acta Arith."},{"key":"7_CR9","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"1995","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory, 2nd edn. Springer, Heidelberg (1995)","edition":"2"},{"key":"#cr-split#-7_CR10.1","doi-asserted-by":"crossref","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. of Cryptology\u00a010(4), 233-260 (1997)","DOI":"10.1007\/s001459900030"},{"key":"#cr-split#-7_CR10.2","unstructured":"Revised version of two articles from Eurocrypt 1996 (1996)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Gauss, C.F.: Disquisitiones Arithrneticae. PhD thesis (1801)","DOI":"10.5479\/sil.324926.39088000932822"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-48059-5_28","volume-title":"Cryptographic Hardware and Embedded Systems","author":"M. Hartmann","year":"1999","unstructured":"Hartmann, M., Paulus, S., Takagi, T.: NICE - New Ideal Coset Encryption. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol.\u00a01717, pp. 328\u2013339. Springer, Heidelberg (1999)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-68164-9_13","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"M.J. Jacobson","year":"2008","unstructured":"Jacobson, M.J., Scheidler, R., Weimer, D.: An adaptation of the NICE cryptosystem to real quadratic orders. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 191\u2013208. Springer, Heidelberg (2008)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0196-6774(80)90021-8","volume":"1","author":"J.C. Lagarias","year":"1980","unstructured":"Lagarias, J.C.: Worst-case complexity bounds for algorithms in the theory of integral quadratic forms. Journal of Algorithm\u00a01, 142\u2013186 (1980)","journal-title":"Journal of Algorithm"},{"key":"7_CR15","unstructured":"Lagrange, J.L.: Recherches d\u2019arithm\u00e9tique. Nouveaux M\u00e9moires de l\u2019Acad\u00e9mie de Berlin (1773)"},{"key":"7_CR16","first-page":"513","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Ann.\u00a0261, 513\u2013534 (1982)","journal-title":"Mathematische Ann."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"May, A.: Using LLL-reduction for solving RSA and factorization problems: A survey. In: Nguyen, P., Vallee, B. (eds.) The LLL algorithm, survey and Applications, Information Security and Cryptography, pp. 315\u2013348 (2010)","DOI":"10.1007\/978-3-642-02295-1_10"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of ANTS VI","author":"P.Q. Nguyen","year":"2004","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: Low-dimensional lattice basis reduction revisited (extended abstract). In: Proceedings of ANTS VI. LNCS, Springer, Heidelberg (2004)"},{"key":"7_CR19","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4064\/aa-6-4-393-413","volume":"6","author":"A. Schinzel","year":"1961","unstructured":"Schinzel, A.: On some problems of the arithmetical theory of continued fractions. Acta Arithmetica\u00a06, 393\u2013413 (1961)","journal-title":"Acta Arithmetica"},{"key":"7_CR20","unstructured":"Shanks, D.: The infrastructure of a real quadratic field and its applications. In: Proc. NTC 1992, pp. 217\u2013224 (1972)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Vallee, B., Vera, A.: Lattice reduction in two dimensions: Analyses under realistic probalistic models. In: Proc. of AofA 2007, DMTCS AH, pp. 181\u2013216 (2007)","DOI":"10.46298\/dmtcs.3549"},{"key":"7_CR22","unstructured":"Weimer, D.: An Adaptation of the NICE Cryptosystem to Real Quadratic Orders, Master\u2019s thesis. PhD thesis, Technische Universitat Darmstadt (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Number Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14518-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T23:48:41Z","timestamp":1675900121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14518-6_7"}},"subtitle":["And Cryptographic Applications"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145179","9783642145186"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14518-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}