LLL-algorithm相关论文
In this paper, the integer N = pkq is called a -integer, if p and q are odd primes with almost the same size and k is a......
记N=pq为n比特RSA模数,e和d分别为加解密指数,ν为p和q低位相同的比特数,即p≡qmod2ν且p≠qmod2v+1.1998年,Boneh、Durfee和Frank......
In this paper,the integer N = pkq is called a <k,1>-integer,if p and q are odd primes with almost the same size and k is......