A SIMPLE AND FAST PROBABILISTIC ALGORITHM FOR COMPUTING SQUARE ROOTS MODULO A PRIME NUMBER

被引:42
作者
PERALTA, RC [1 ]
机构
[1] UNIV CALIF BERKELEY,DEPT COMP SCI,BERKELEY,CA 94720
关键词
D O I
10.1109/TIT.1986.1057236
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:846 / 847
页数:2
相关论文
共 6 条
[1]  
ADLEMAN L, 1977, 18TH IEEE ANN S F CO
[2]  
BACH E, 1984, THESIS U CALIFORNIA
[3]   FACTORING POLYNOMIALS OVER LARGE FINITE FIELDS [J].
BERLEKAMP, ER .
MATHEMATICS OF COMPUTATION, 1970, 24 (111) :713-+
[4]  
Lehmer D. H, 1969, STUDIES NUMBER THEOR, P117
[5]   PROBABILISTIC ALGORITHMS IN FINITE-FIELDS [J].
RABIN, MO .
SIAM JOURNAL ON COMPUTING, 1980, 9 (02) :273-280
[6]  
SHANKS D, 1972, 2ND P MAN C NUM MATH