Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors

DOI10.1007/978-3-642-39059-3_9zbMath1316.94090OpenAlexW26461435MaRDI QIDQ5300940

Noboru Kunihiro, Atsushi Takayasu

Publication date: 28 June 2013

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39059-3_9

zbMATH Keywords

RSAlatticesdigital signaturessmall rootsCoppersmith's methodfault attacksimplicit factorizationmulti-prime \(\Phi \)-hiding assumption

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Authentication, digital signatures and secret sharing (94A62)

Related Items

Cryptanalysis of Prime Power RSA with two private exponents, Partial Key Exposure Attack on CRT-RSA, Improving bounds on elliptic curve hidden number problem for ECDH key exchange, A Tool Kit for Partial Key Exposure Attacks on RSA, Improved Results on Cryptanalysis of Prime Power RSA, Small CRT-Exponent RSA Revisited, A method for obtaining digital signatures and public-key cryptosystems, Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs, Revisiting orthogonal lattice attacks on approximate common divisor problems