1993 | OriginalPaper | Buchkapitel
Pseudoprimes: A Survey of Recent Results
verfasst von : F. Morain
Erschienen in: Eurocode ’92
Verlag: Springer Vienna
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Public key cryptosystems require the use of large prime numbers, numbers with at least 256 bits (80 decimal digits), see for example [12]. One needs to generate these numbers as fast as possible. One way of dealing with this problem is the use of special primes built up using the converse of Fermat’s theorem [35, 14, 17, 29]. Another is to use sophisticated primality proving algorithms, that are fast but need a. careful implementation [13, 9].