scientific article; zbMATH DE number 3939411

MaRDI QIDQ3712366zbMATH OpenFDO

Authors Ben Johnsen

Publication date 1986

zbMATH Keywords

algorithmscomputational number theoryefficiencyprimality testingpublic key cryptosystemsRiemann hypothesisRSA-systemsurvey

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Primality (11Y11) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 4214160
• On using primes for public key encryption systems
• scientific article; zbMATH DE number 707175
• scientific article; zbMATH DE number 4174830
• A public key cryptosystem as hard as factorisation

Cited in

(4)

• scientific article; zbMATH DE number 4006326 (Why is no real title available?)
• Large primes in stream cipher cryptography
• scientific article; zbMATH DE number 67086 (Why is no real title available?)
• Implications of the arithmetic ratio of prime numbers for RSA security

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3712366)