ON DISTINGUISHING PRIME-NUMBERS FROM COMPOSITE NUMBERS

被引：120

作者：

ADLEMAN, LM

POMERANCE, C

RUMELY, RS

机构：

[1] UNIV SO CALIF,LOS ANGELES,CA 90007

[2] UNIV GEORGIA,ATHENS,GA 30602

来源：

ANNALS OF MATHEMATICS | 1983年 / 117卷 / 01期

关键词：

D O I：

10.2307/2006975

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：173 / 206

页数：34

共 41 条

[1] AN O(N1-10.89) PRIMALITY TESTING ALGORITHM [J].

ADLEMAN, L ;

LEIGHTON, FT .

MATHEMATICS OF COMPUTATION, 1981, 36 (153) :261-266

[2]

ADLEMAN LM, 1980, 21ST FOCS

[3]

ADLEMAN LM, 1976, THESIS UC BERKELEY

[4]

Artin E., 1967, CLASS FIELD THEORY

[5] FACTORING POLYNOMIALS OVER LARGE FINITE FIELDS [J].

BERLEKAMP, ER .

MATHEMATICS OF COMPUTATION, 1970, 24 (111) :713-+

[6]

Bombieri E., 1974, ASTERIQUE, V18, P1

[7] NEW PRIMALITY CRITERIA AND FACTORIZATIONS OF 2M+/-1 [J].

BRILLHART, J ;

LEHMER, DH ;

SELFRIDGE, JL .

MATHEMATICS OF COMPUTATION, 1975, 29 (130) :620-647

[8]

CASSELS JWS, 1967, ALGEBRAIC NUMBER THE

[9]

COHEN H, 1981, TESTS PRIMALITE APRE

[10]

Davenport H., 1980, MULTIPLICATIVE NUMBE

← 1 2 3 4 5 →