scientific article; zbMATH DE number 5532109

MaRDI QIDQ3615929zbMATH OpenFDO

Authors Daniel J. Bernstein

Publication date 24 March 2009

zbMATH Keywords

cryptographylatticesnumber-theoretic divisor problemsunivariate polynomials

Mathematics Subject Classification ID

Relations with coding theory (11H71) Number-theoretic algorithms; complexity (11Y16) Decoding (94B35)

Recommendations

• scientific article; zbMATH DE number 799775
• Reduction of lattice bases for arbitrary norms
• On lattice reduction for polynomial matrices
• An application of lattice basis reduction to polynomial identities for algebraic structures
• A hierarchy of polynomial time lattice basis reduction algorithms
• scientific article; zbMATH DE number 1186973
• On irreducible polynomials of small height over finite fields
• On the reduced height of a polynomial
• Bounding univariate and multivariate reducible polynomials with restricted height
• scientific article; zbMATH DE number 3972987

Cited in

(8)

• A deterministic algorithm for finding \(r\)-power divisors
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
• List Decoding for Binary Goppa Codes
• Simplified High-Speed High-Distance List Decoding for Alternant Codes
• An exponent one-fifth algorithm for deterministic integer factorisation
• Divisors in residue classes, constructively
• Understanding binary-Goppa decoding
• Polynomial lattices for the BIKE cryptosystem

This page was built for publication:

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