Blasphemy 发表于 2025-4-1 02:18:34
http://reply.papertrans.cn/25/2407/240611/240611_61.pnggangrene 发表于 2025-4-1 08:49:45
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诱拐 发表于 2025-4-1 10:18:50
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,