Fast digital signature scheme based on the quadratic residue problem

被引:9
作者
Nyang, D
Song, J
机构
[1] Department of Computer Science, Yonsei University, Seoul
关键词
digital arithmetic; residue arithmetic; cryptography;
D O I
10.1049/el:19970124
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The authors propose a new, fast digital signature scheme which is based on the quadratic residue problem. Only a few computations are needed to obtain and verify a legal signature in the scheme. Moreover, a signature generated in the proposed scheme is very short.
引用
收藏
页码:205 / 206
页数:2
相关论文
共 6 条
[1]  
FAN, 1996, ELECTRON LETT, V32, P1569
[2]   IMPROVED RABINS SCHEME WITH HIGH-EFFICIENCY [J].
HARN, L ;
KIESLER, T .
ELECTRONICS LETTERS, 1989, 25 (11) :726-728
[3]   A SIMPLE AND FAST PROBABILISTIC ALGORITHM FOR COMPUTING SQUARE ROOTS MODULO A PRIME NUMBER [J].
PERALTA, RC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (06) :846-847
[4]  
Rabin M.O., 1979, DIGITALIZED SIGNATUR
[5]  
SHAMIR A, 1984, INFORM PROCESS LETT, P113
[6]   ANOTHER PRACTICAL PUBLIC-KEY CRYPTOSYSTEM [J].
SHIMADA, M .
ELECTRONICS LETTERS, 1992, 28 (23) :2146-2147