Algorithmic Number Theory
From MaRDI portal
Publication:5899254
DOI10.1007/11792086zbMath1143.11357OpenAlexW2977481208WikidataQ29400612 ScholiaQ29400612MaRDI QIDQ5899254
Phong Q. Nguyen, Damien Stehlé
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11792086
Related Items
Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients ⋮ Bounding basis reduction properties ⋮ Towards faster polynomial-time lattice reduction ⋮ A Tale of Three Signatures: Practical Attack of ECDSA with wNAF ⋮ Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Predicting truncated multiple recursive generators with unknown parameters ⋮ Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem ⋮ PotLLL: a polynomial time version of LLL with deep insertions ⋮ Practical attacks on small private exponent RSA: new records and new insights ⋮ The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications ⋮ Fast practical lattice reduction through iterated compression ⋮ Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices ⋮ An improved method for predicting truncated multiple recursive generators with unknown parameters ⋮ Explicit Hard Instances of the Shortest Vector Problem ⋮ Thrackles: An Improved Upper Bound ⋮ Storage efficient algorithm for Hermite normal form using LLL ⋮ Algorithms for the Shortest and Closest Lattice Vector Problems ⋮ LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme ⋮ Second order statistical behavior of LLL and BKZ ⋮ The polynomial approximate common divisor problem and its application to the fully homomorphic encryption ⋮ Random Sampling Revisited: Lattice Enumeration with Discrete Pruning ⋮ Hermite’s Constant and Lattice Algorithms ⋮ LLL: A Tool for Effective Diophantine Approximation ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ Cryptanalysis of General Lu-Lee Type Systems ⋮ A Digital Signature Scheme Based on CVP ∞ ⋮ Predicting Lattice Reduction ⋮ Analysis of Gauss-Sieve for Solving the Shortest Vector Problem in Lattices ⋮ A stochastic variant of the abelian sandpile model ⋮ A new parallel lattice reduction algorithm for BKZ reduced bases ⋮ A physical study of the LLL algorithm
This page was built for publication: Algorithmic Number Theory
