Finding smooth integers in short intervals using CRT decoding

DOI10.1145/335305.335337zbMATH Open1296.94165OpenAlexW2066180457MaRDI QIDQ5895201FDOQ5895201

Authors: Dan Boneh 

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335337

Recommendations

• Finding smooth integers in short intervals using CRT decoding
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
• scientific article; zbMATH DE number 475434
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Chinese remaindering with errors

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (11)

• On the optimality of lattices for the Coppersmith technique
• Efficient non-malleable commitment schemes
• Lattice-based treshold-changeability for standard CRT secret-sharing schemes
• Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
• List decoding of maximal order codes over number fields
• Simplified High-Speed High-Distance List Decoding for Alternant Codes
• Using LLL-reduction for solving RSA and factorization problems
• List Decoding for Binary Goppa Codes
• Finding smooth integers in short intervals using CRT decoding
• Fast LLL-type lattice reduction
• Efficient non-malleable commitment schemes

This page was built for publication: Finding smooth integers in short intervals using CRT decoding

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