Using the inhomogeneous simultaneous approximation problem for cryptographic design
From MaRDI portal
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
- Approximating good simultaneous diophantine approximations is almost NP-hard
- 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 good simultaneous diophantine approximations is almost NP-hard
- 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 a public-key cryptosystem based on approximations by rational numbers
- 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 3737757 (Why is no real title available?)
- scientific article; zbMATH DE number 3758416 (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
- Using fewer qubits in Shor's factorization algorithm via simultaneous Diophantine approximation
- What do continued fractions accomplish?
- Zur Geometrie des Jacobi-Perron Algorithmus
Cited in
(1)
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)