AN EFFICIENT SOLUTION OF THE CONGRUENCE X2+KY2=M(MOD N)

被引：40

作者：

POLLARD, JM ^{[1
]}

SCHNORR, CP ^{[1
]}

机构：

[1] UNIV FRANKFURT,FACHBEREICH MATH,FACHBEREICH INFORMAT,D-6000 FRANKFURT,FED REP GER

来源：

关键词：

D O I：

10.1109/TIT.1987.1057350

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

CRYPTOGRAPHY

引用

页码：702 / 709

页数：8

共 17 条

[1]

Adleman L., 1977, 18th Annual Symposium on Foundations of Computer Science, P175, DOI 10.1109/SFCS.1977.18

[2]

ADLEMAN LM, 1987, MATH COMPUTATION, V48

[3]

Cassels JWS., 1971, INTRO GEOMETRY NUMBE

[4]

DAVENPORT H, 1982, HIGHER ARITHMETIC

[5] NEW DIRECTIONS IN CRYPTOGRAPHY [J].

DIFFIE, W ;

HELLMAN, ME .

[6]

ESTES D, 1986, LECT NOTES COMPUT SC, V218, P3

[7]

Lagarias J, 1980, J ALGORITHMS, V1, P142

[8]

Lagarias J.C., 1977, ALGEBRAIC NUMBER FIE, P409

[9]

Lehmer D. H, 1969, STUDIES NUMBER THEOR, P117

[10] FACTORING POLYNOMIALS WITH RATIONAL COEFFICIENTS [J].

LENSTRA, AK ;

LENSTRA, HW ;

LOVASZ, L .