Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design

DOI10.1007/978-3-642-21969-6_15zbMath1280.94037MaRDI QIDQ3011916

Carsten Elsner, Martin Schmidt, Frederik Armknecht

Publication date: 29 June 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-21969-6_15

Mathematics Subject Classification ID

94A60: Cryptography

Uses Software

• MPFR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zur Geometrie des Jacobi-Perron Algorithmus
• Factoring polynomials with rational coefficients
• A convergence exponent for multidimensional continued-fraction algorithms
• Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
• The metrical theory of Jacobi-Perron algorithm
• What do continued fractions accomplish?
• The Jacobi-Perron algorithm its theory and application
• Integer Programming with a Fixed Number of Variables
• Cryptanalysis of short RSA secret exponents
• MPFR
• Fully Homomorphic Encryption over the Integers
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
• Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions
• Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
• New lattice-based cryptographic constructions