Efficient probabilistic public-key cryptosystem based on the diffie-hellman problem
type: Item
instance of: scholarly article
title: Efficient probabilistic public-key cryptosystem based on the diffie-hellman problem
zbMATH Open document ID: 0718.94008
published in: Electronics Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 4185540
zbMATH Keywords: discrete logarithm problem
zbMATH Keywords: probabilistic public-key cryptosystem
zbMATH Keywords: Diffie-Hellman problem
zbMATH Keywords: Elgamal public-key cryptosystem
zbMATH Keywords: transmission efficiency
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: el:19900214
OpenAlex ID: W2057308748
Wikidata QID: Q126270026
DOI: 10.1049/EL:19900214
Recommended article: Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Recommended article: Q5489062
Recommended article: An efficient probabilistic encryption scheme
Recommended article: New probabilistic public-key encryption based on the RSA cryptosystem
Recommended article: Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
Recommended article: An efficient probabilistic public-key cryptosystem over quadratic fields quotients
Recommended article: Q3403661
Recommended article: Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
Recommended article: Q4502496
Recommended article: Q4037856
description: scientific article; zbMATH DE number 4185540