Titlebook: Cryptology and Network Security; 7th International Co Matthew K. Franklin,Lucas Chi Kwong Hui,Duncan S. Conference proceedings 2008 Spring

Blasphemy

gangrene

Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits of short exponent LSBS-RSA. They claimed that short exponent LSBS-RSA is much more vulnerable to the lattice attack than the standard RSA. In this paper, we further raise the security boundary of the Zhao-Qi attack by considering another polynomial. Our improvemet supports the result of analogue Fe

诱拐

Efficient and Short Certificateless Signature in both communication and computation, and therefore turns out to be more efficient than other CLS schemes proposed so far. We provide a rigorous security proof of our scheme in the random oracle model. The security of our scheme is based on the .-CAA hard problem and a new discovered hard problem,