Finding smooth integers in short intervals using CRT decoding

DOI10.1145/335305.335337zbMath1296.94165OpenAlexW2066180457MaRDI QIDQ5895201

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

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (11)

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

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