Factoring pq ^2 with quadratic forms: Nice cryptanalyses

DOI10.1007/978-3-642-10366-7_28MaRDI QIDQ3650709zbMATH OpenOpenAlexFDO

Authors Guilhem Castagnos, Antoine Joux, Fabien Laguillaumie, Phong Q. Nguyen

Publication date 15 December 2009

Published in Advances in Cryptology – ASIACRYPT 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10366-7_28

zbMATH Keywords

binary quadratic formsfactorisationhomogeneous Coppersmith's root findinglatticespublic-key cryptanalysis

Mathematics Subject Classification ID

Factorization (11Y05) Cryptography (94A60)

Recommendations

• On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
• Smallest Reduction Matrix of Binary Quadratic Forms
• A NICE cryptanalysis
• An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
• scientific article; zbMATH DE number 1440887

Cited in

(10)

• Linearly homomorphic encryption from \(\mathsf {DDH}\)
• List Decoding for Binary Goppa Codes
• Simplified High-Speed High-Distance List Decoding for Alternant Codes
• A NICE cryptanalysis
• On the Security of Cryptosystems with Quadratic Decryption: The Nicest Cryptanalysis
• Smallest Reduction Matrix of Binary Quadratic Forms
• I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
• An algebraic framework for silent preprocessing with trustless setup and active security
• Fast square-free decomposition of integers using class groups
• New results on the -hiding assumption and factoring related RSA moduli

This page was built for publication: Factoring \(pq ^{2}\) with quadratic forms: Nice cryptanalyses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3650709)