Fast digital signature scheme based on the quadratic residue problem
暂无分享,去创建一个
[1] M. Shimada,et al. Another practical public-key cryptosystem , 1992 .
[2] M. Rabin. DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION , 1979 .
[3] Adi Shamir,et al. Cryptanalysis of Certain Variants of Rabin's Signature Scheme , 1984, Inf. Process. Lett..
[4] René C. Peralta,et al. A simple and fast probabilistic algorithm for computing square roots modulo a prime number , 1986, IEEE Trans. Inf. Theory.
[5] Chin-Laung Lei,et al. Low-computation blind signature schemes based on quadratic residues , 1996 .
[6] Lein Harn,et al. Improved Rabin's scheme with high efficiency , 1989 .