A complete and explicit security reduction algorithm for RSA-based cryptosystems

DOI10.1007/B94617MaRDI QIDQ5902400zbMATH OpenOpenAlexFDO

Authors Kaoru Kurosawa, Katja Schmidt-Samoa, Tsuyoshi Takagi

Publication date 5 January 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b94617

zbMATH Keywords

Euclidean algorithmLattice reductionProvable securityRSA cryptosystem

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Cryptography (94A60)

Recommendations

• Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
• Cryptanalysis of RSA with a small parameter
• An application of Euclidean algorithm in cryptanalysis of RSA
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• The geometry of provable security: some proofs of security in which lattices make a surprise appearance

Cited in

(3)

• An efficient and secure RSA-like cryptosystem exploiting Rédei rational functions over conics
• scientific article; zbMATH DE number 2169072 (Why is no real title available?)
• Progress in Cryptology - INDOCRYPT 2004

This page was built for publication: A complete and explicit security reduction algorithm for RSA-based cryptosystems

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