A key distribution system equivalent to factoring
type: Item
instance of: scholarly article
title: A key distribution system equivalent to factoring
zbMATH Open document ID: 0659.94003
DOI: 10.1007/BF02351718
author: Kevin S. McCurley
published in: Journal of Cryptology
publication date: 1988-01-01T00:00:00Z
review text: We propose a variation of the Diffie and Hellman key distribution scheme for which we can prove that decryption of a single key requires the ability to factor a number that is the product of two large primes. The practical advantage of such a scheme is that it will still be secure if the cryptanalyst knows a very fast algorithm for either factoring or computing discrete logarithms, but not for both. Using these keys in the ElGamal public-key cryptosystem provides a scheme for which the decryption of a message requires the ability to factor the modulus and break the original Diffie and Hellman scheme.
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 4079315
zbMATH Keywords: integer factoring
zbMATH Keywords: discrete logarithms
zbMATH Keywords: ElGamal public-key cryptosystem
MaRDI profile type: Publication
cites work: A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
cites work: Fast evaluation of logarithms in fields of characteristic two
cites work: An application of factoring
cites work: Discrete logarithms in \(\mathrm{GF}(p)\)
cites work: New directions in cryptography
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Q4198056
cites work: Q4057549
cites work: Elliptic Curve Cryptosystems
cites work: Q3728067
cites work: Riemann's hypothesis and tests for primality
cites work: Q3718617
cites work: Q3726006
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Monte Carlo Methods for Index Computation (mod p)
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: A modification of the RSA public-key encryption procedure (Corresp.)
full work available at URL: https://doi.org/10.1007/bf02351718
OpenAlex ID: W2033535959
description: scientific article; zbMATH DE number 4079315