scientific article
From MaRDI portal
Publication:3933739
zbMath0477.68043MaRDI QIDQ3933739
Hendrik W. jun. Lenstra, László Lovász, Arjen K. Lenstra
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in number theory (11C08) Polynomials (irreducibility, etc.) (11R09)
Related Items
The Liouville Function and the Riemann Hypothesis, Practical cryptanalysis of ISO 9796-2 and EMV signatures, Attacking ECDSA leaking discrete bits with a more efficient lattice, Lattice basis reduction for indefinite forms and an application, A non-commutative cryptosystem based on quaternion algebras, Digital collections of examples in mathematical sciences, On computing high-dimensional Riemann theta functions, Improved cryptanalysis of the multi-power RSA cryptosystem variant, An appraisal of computational complexity for operations researchers, \(abc\) triples, The numerical factorization of polynomials, Kronecker's and Newton's approaches to solving: a first comparison, Exact asymptotics of the characteristic polynomial of the symmetric Pascal matrix, Signatures Through Approximate Representations by Quadratic Forms
