Finding smooth integers in short intervals using CRT decoding

@inproceedings{Boneh2000FindingSI,
title={Finding smooth integers in short intervals using CRT decoding},
author={Dan Boneh},
booktitle={STOC},
year={2000}
}

We present a new algori thm for CRT list decoding. Given B , ( p l , . . . ,p~) and ( r l , . . . ,r,~), where the pi 's are relat ively prime, the CRT list decoding problem asks for all positive integers x < B such tha t x = ri m o d p i for all bu t e values of i E {1 , . . . ,n} . Suppose B = I-[~=,p~ for some integer k. Goldreich, Ron, and Sudan recently gave several applications for this problem and presented an efficient algori thm whenever e (approximately) satisfies e < n ~ / 2 k n… CONTINUE READING