scientific article; zbMATH DE number 4179277

MaRDI QIDQ3202941zbMATH OpenFDO

Authors Marc Girault, Philippe Toffin, Brigitte Vallée

Publication date 1990

zbMATH Keywords

RSAcryptographycomputation of approximate L-th roots modulo nnumbers arising in crypto schemes

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Publication:3033821
• Some applications of lattice based root finding techniques
• scientific article; zbMATH DE number 826069
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• scientific article; zbMATH DE number 167875

Cited in

(8)

• scientific article; zbMATH DE number 826069 (Why is no real title available?)
• scientific article; zbMATH DE number 7014242 (Why is no real title available?)
• Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
• Using LLL-reduction for solving RSA and factorization problems
• scientific article; zbMATH DE number 1839433 (Why is no real title available?)
• A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
• Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents

This page was built for publication:

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