Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation

DOI10.1007/3-540-46416-6_24zbMath0772.11045OpenAlexW1496417058MaRDI QIDQ4037472

Claus Peter Schnorr

Publication date: 18 May 1993

Published in: Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-46416-6_24

zbMATH Keywords

algorithmdiscrete logarithmsfactoring integers via diophantine approximation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Factorization (11Y05)

Related Items

Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem, Thrackles: An Improved Upper Bound, Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design, Using LLL-Reduction for Solving RSA and Factorization Problems, Unnamed Item, Simultaneous reduction of a lattice basis and its reciprocal basis