{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:10:38Z","timestamp":1776841838166,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642010002","type":"print"},{"value":"9783642010019","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01001-9_15","type":"book-chapter","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T12:38:25Z","timestamp":1239799105000},"page":"260-277","source":"Crossref","is-referenced-by-count":12,"title":["On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis"],"prefix":"10.1007","author":[{"given":"Guilhem","family":"Castagnos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabien","family":"Laguillaumie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/B:DESI.0000012439.20075.16","volume":"31","author":"I. Biehl","year":"2004","unstructured":"Biehl, I., Paulus, S., Takagi, T.: Efficient Undeniable Signature Schemes based on Ideal Arithmetic in Quadratic Orders. Des. Codes Cryptography\u00a031(2), 99\u2013123 (2004)","journal-title":"Des. Codes Cryptography"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.: Factoring N\u2009=\u2009p r q for large r. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 326\u2013337. Springer, Heidelberg (1999)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-45861-1_6","volume-title":"Information Security and Cryptology - ICISC 2001","author":"J. Buchmann","year":"2002","unstructured":"Buchmann, J., Sakurai, K., Takagi, T.: An IND-CCA2 Public-Key Cryptosystem with Fast Decryption. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol.\u00a02288, pp. 51\u201371. Springer, Heidelberg (2002)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02351719","volume":"1","author":"J. Buchmann","year":"1988","unstructured":"Buchmann, J., Williams, H.C.: A Key-Exchange System based on Imaginary Quadratic Fields. J. Cryptology\u00a01, 107\u2013118 (1988)","journal-title":"J. Cryptology"},{"key":"15_CR5","first-page":"159","volume-title":"Proc. of CANT 1992, Math. Appl.","author":"J. Buchmann","year":"1995","unstructured":"Buchmann, J., Thiel, C., Williams, H.C.: Short Representation of Quadratic Integers. In: Proc. of CANT 1992, Math. Appl., vol.\u00a0325, pp. 159\u2013185. Kluwer Academic Press, Dordrecht (1995)"},{"issue":"4","key":"15_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1049\/el:19990229","volume":"35","author":"J.-S. Coron","year":"1999","unstructured":"Coron, J.-S., Naccache, D., Paillier, P.: Accelerating Okamoto-Uchiyama public-key cryptosystem. Electronics Letters\u00a035(4), 291\u2013292 (1999)","journal-title":"Electronics Letters"},{"key":"15_CR7","volume-title":"A Course in Computational Algebraic Number Theory","author":"H. Cohen","year":"2000","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, Heidelberg (2000)"},{"key":"15_CR8","volume-title":"Primes of the form x 2\u2009+\u2009ny 2","author":"D.A. Cox","year":"1999","unstructured":"Cox, D.A.: Primes of the form x 2\u2009+\u2009ny 2. John Wiley & Sons, Chichester (1999)"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1090\/S0894-0347-1989-1002631-0","volume":"2","author":"J.L. Hafner","year":"1989","unstructured":"Hafner, J.L., McCurley, K.S.: A Rigorous Subexponential Algorithm for Computation of Class Group. J. Amer. Math. Soc.\u00a02(4), 837\u2013850 (1989)","journal-title":"J. Amer. Math. Soc."},{"key":"15_CR10","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":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-46513-8_11","volume-title":"Selected Areas in Cryptography","author":"D. H\u00fchnlein","year":"2000","unstructured":"H\u00fchnlein, D.: Efficient Implementation of Cryptosystems Based on Non-maximal Imaginary Quadratic Orders. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol.\u00a01758, pp. 147\u2013167. Springer, Heidelberg (2000)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45353-9_1","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"D. H\u00fchnlein","year":"2001","unstructured":"H\u00fchnlein, D.: Faster Generation of NICE-Schnorr-Type Signatures. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 1\u201312. Springer, Heidelberg (2001)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/BFb0054134","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D. H\u00fchnlein","year":"1998","unstructured":"H\u00fchnlein, D., Jacobson Jr., M.J., Paulus, S., Takagi, T.: A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 294\u2013307. Springer, Heidelberg (1998)"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1025746127771","volume":"30","author":"D. H\u00fchnlein","year":"2003","unstructured":"H\u00fchnlein, D., Jacobson Jr., M., Weber, D.: Towards Practical Non Interactive Public-Key Cryptosystems Using Non-Maximal Imaginary Quadratic Orders. Des. Codes Cryptography\u00a030(3), 281\u2013299 (2003)","journal-title":"Des. Codes Cryptography"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-46588-1_2","volume-title":"Public Key Cryptography","author":"D. H\u00fchnlein","year":"2000","unstructured":"H\u00fchnlein, D., Merkle, J.: An Efficient NICE-Schnorr-Type Signature Scheme. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 14\u201327. Springer, Heidelberg (2000)"},{"key":"15_CR16","unstructured":"H\u00fchnlein, D., Meyer, A., Takagi, T.: Rabin and RSA Analogues Based on Non-maximal Imaginary Quadratic Orders. In: Proc. of ICISC 1998, pp. 221\u2013240 (1999)"},{"key":"15_CR17","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 Jr.","year":"2008","unstructured":"Jacobson Jr., 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":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/3-540-45539-6_26","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"\u00c9. Jaulmes","year":"2000","unstructured":"Jaulmes, \u00c9., Joux, A.: A NICE cryptanalysis. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 382\u2013391. Springer, Heidelberg (2000)"},{"key":"15_CR19","series-title":"LNM","first-page":"131","volume-title":"The Development of the Number Field Sieve","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr., H.W. (eds.): AMCP 1998. LNM, vol.\u00a01554, p. 131. Springer, Heidelberg (1993)"},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra Jr.","year":"1987","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Annals of Mathematics\u00a0126(2), 649\u2013673 (1987)","journal-title":"Annals of Mathematics"},{"key":"15_CR21","first-page":"459","volume-title":"Proc. of NATO ASI on Number Theory and Applications","author":"K.S. McCurley","year":"1989","unstructured":"McCurley, K.S.: Cryptographic Key Distribution and Computation in Class Groups. In: Proc. of NATO ASI on Number Theory and Applications, pp. 459\u2013479. Kluwer Academic Press, Dordrecht (1989)"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45353-9_13","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"T. Okamoto","year":"2001","unstructured":"Okamoto, T., Pointcheval, D.: REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 159\u2013175. Springer, Heidelberg (2001)"},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-46588-1_10","volume-title":"Public Key Cryptography","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D.: Chosen-Ciphertext Security for Any One-Way Cryptosystem. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 129\u2013146. Springer, Heidelberg (2000)"},{"key":"15_CR25","first-page":"133","volume-title":"Advanced Courses CRM Barcelona, Advanced Course on Contemporary Cryptology","author":"D. Pointcheval","year":"2005","unstructured":"Pointcheval, D.: Provable Security for Public Key Schemes. In: Advanced Courses CRM Barcelona, Advanced Course on Contemporary Cryptology, pp. 133\u2013189. Birkh\u00e4user Publishers, Basel (2005)"},{"key":"15_CR26","unstructured":"Paulus, S., Takagi, T.: A generalization of the Diffie-Hellman problem and related cryptosystems allowing fast decryption. In: Proc. of ICISC 1998, pp. 211\u2013220 (1999)"},{"issue":"2","key":"15_CR27","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s001459910010","volume":"13","author":"S. Paulus","year":"2000","unstructured":"Paulus, S., Takagi, T.: A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time. J. Cryptology\u00a013(2), 263\u2013272 (2000)","journal-title":"J. Cryptology"},{"key":"15_CR28","unstructured":"Schoof, R.: Quadratic fields and factorization. Computational Methods in Number Theory, MC-Tracts 154\/155, 235\u2013286 (1982)"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.-P. Schnorr","year":"1990","unstructured":"Schnorr, C.-P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1990)"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Vall\u00e9e, B., Vera, A.: Lattice Reduction in Two Dimensions: Analyses under Realistic Probabilistic Models. In: Proc. of AofA 2007, DMTCS. AH, pp. 181\u2013216 (2007)","DOI":"10.46298\/dmtcs.3549"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01001-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T04:55:23Z","timestamp":1633323323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01001-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010002","9783642010019"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01001-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}