Using the inhomogeneous simultaneous approximation problem for cryptographic design

DOI10.1007/978-3-642-21969-6_15MaRDI QIDQ3011916zbMATH OpenOpenAlexFDO

Authors Frederik Armknecht, Carsten Elsner, Martin Schmidt

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

Cryptography (94A60)

Recommendations

• Simultaneous approximation problems and knapsack cryptosystems with commitment schemes in \(p\)-adic numberlands
• scientific article; zbMATH DE number 7014242
• Simultaneous approximation problems of p-adic numbers and p-adic knapsack cryptosystems -- Alice in p-adic numberland
• scientific article; zbMATH DE number 1114048
• Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem

Cites work

• A convergence exponent for multidimensional continued-fraction algorithms
• Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
• Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields
• Cryptanalysis of short RSA secret exponents
• Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation
• Factoring polynomials with rational coefficients
• Fully homomorphic encryption over the integers
• Generalizing the Continued Fraction Algorithm to Arbitrary Dimensions
• scientific article; zbMATH DE number 1617936 (Why is no real title available?)
• scientific article; zbMATH DE number 3737757 (Why is no real title available?)
• scientific article; zbMATH DE number 3758416 (Why is no real title available?)
• scientific article; zbMATH DE number 177043 (Why is no real title available?)
• scientific article; zbMATH DE number 1114048 (Why is no real title available?)
• scientific article; zbMATH DE number 1503600 (Why is no real title available?)
• scientific article; zbMATH DE number 4195888 (Why is no real title available?)
• scientific article; zbMATH DE number 3340365 (Why is no real title available?)
• scientific article; zbMATH DE number 3092634 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• MPFR
• New lattice-based cryptographic constructions
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• The Jacobi-Perron algorithm its theory and application
• The metrical theory of Jacobi-Perron algorithm
• What do continued fractions accomplish?
• Zur Geometrie des Jacobi-Perron Algorithmus

Cited in

(1)

• Simultaneous approximation problems and knapsack cryptosystems with commitment schemes in \(p\)-adic numberlands

Describes a project that uses

Uses Software

• MPFR

This page was built for publication: Using the inhomogeneous simultaneous approximation problem for cryptographic design

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