Primality tests and use of primes in public key systems

被引：1

作者：

Landrock, P ^{[1
]}

机构：

[1] Aarhus Univ, Inst Math, DK-8000 Aarhus, Denmark

来源：

LECTURES ON DATA SECURITY | 1999年 / 1561卷

关键词：

D O I：

10.1007/3-540-48969-X_6

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In the first part of this discussion, we first briefly discuss various prime generation methods, starting with the Rabin-Miller test, and then moving on to a very simple new deterministic test. After that we discuss various ways of constructing so-called strong primes, and why this better be avoided.

引用

页码：127 / 133

页数：7

共 50 条

[41] A NOTE ON PRIMALITY TESTS FOR N=H.2N-1
RODSETH, OJ
BIT, 1994, 34 (03): : 451 - 454
[42] SOME PRIMALITY TESTS CONSTRUCTED FROM A CUBIC EXTENSION OF THE LUCAS FUNCTIONS
Roettger, E. L.
Williams, H. C.
FIBONACCI QUARTERLY, 2021, 59 (03): : 194 - 213
[43] Even and odd primality of dynamical systems with invariant measure
Ryzhikov, VV
MATHEMATICAL NOTES, 1996, 60 (3-4) : 353 - 356
[44] NOTE ON MONTE-CARLO PRIMALITY TESTS AND ALGORITHMIC INFORMATION-THEORY
CHAITIN, GJ
SCHWARTZ, JT
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 1978, 31 (04) : 521 - 527
[45] A CLASS OF PRIMALITY TESTS FOR TRINOMIALS WHICH INCLUDES THE LUCAS-LEHMER TEST
WILLIAMS, HC
PACIFIC JOURNAL OF MATHEMATICS, 1982, 98 (02) : 477 - 494
[46] SECRET DISTRIBUTION OF KEYS FOR PUBLIC-KEY SYSTEMS
QUISQUATER, JJ
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 293 : 203 - 208
[47] On using Carmichael numbers for public key encryption systems
Pinch, RGE
CRYPTOGRAPHY AND CODING, PROCEEDINGS, 1997, 1355 : 265 - 269
[48] ID-BASED PUBLIC KEY CRYPTOGRAPHIC SYSTEMS
Cheremushkin, A. V.
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2023, (61): : 44 - 85
[49] Intelligent public transport systems the key to better mobility
Van Ieperen, Johan
Public Transport International, 2006, 55 (05): : 6 - 11
[50] PUBLIC-KEY CRYPTOGRAPHY AND OPEN SYSTEMS INTERCONNECTION
FORD, W
OHIGGINS, B
IEEE COMMUNICATIONS MAGAZINE, 1992, 30 (07) : 30 - 35

← 1 2 3 4 5 →