scientific article; zbMATH DE number 4179277

zbMATH Open0715.94004MaRDI QIDQ3202941FDOQ3202941

Authors: Marc Girault, Philippe Toffin, Brigitte Vallée 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (8)

• Title not available (Why is that?)
• Using LLL-reduction for solving RSA and factorization problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
• Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
• 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

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)