scientific article; zbMATH DE number 3939411

zbMATH Open0586.10001MaRDI QIDQ3712366FDOQ3712366

Authors: Ben Johnsen 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

algorithmssurveyefficiencyRiemann hypothesiscomputational number theoryprimality testingpublic key cryptosystemsRSA-system

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) 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) Primality (11Y11)

Cited In (4)

• Title not available (Why is that?)
• Large primes in stream cipher cryptography
• Implications of the arithmetic ratio of prime numbers for RSA security
• Title not available (Why is that?)

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)