Finding smooth integers in short intervals using CRT decoding

DOI10.1006/jcss.2002.1827zbMath1052.68036OpenAlexW2999357134MaRDI QIDQ5894822

Dan Boneh

Publication date: 12 September 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/82eeb4644394484a31278a2c4d98ead3a4745412

zbMATH Keywords

CRT list decodingReed-Solomon list decoding

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35)

Related Items

List decoding of maximal order codes over number fields, List Decoding for Binary Goppa Codes, List decoding of number field codes, On RSA moduli with prescribed bit patterns, Simplified High-Speed High-Distance List Decoding for Alternant Codes, Noisy Chinese remaindering in the Lee norm, Formally verified certificate checkers for hardest-to-round computation

Cites Work

• The development of the number field sieve
• Factoring polynomials with rational coefficients
• Decoding of Reed Solomon codes beyond the error-correction bound
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Chinese remaindering with errors
• Oblivious transfer and polynomial evaluation
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Finding smooth integers in short intervals using CRT decoding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item