Efficient probabilistic public-key cryptosystem based on the diffie-hellman problem

DOI10.1049/EL:19900214MaRDI QIDQ5750816zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1990

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19900214

zbMATH Keywords

computational complexityDiffie-Hellman problemdiscrete logarithm problemElgamal public-key cryptosystemprobabilistic public-key cryptosystemtransmission efficiency

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
• scientific article; zbMATH DE number 5056807
• An efficient probabilistic encryption scheme
• New probabilistic public-key encryption based on the RSA cryptosystem
• Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
• An efficient probabilistic public-key cryptosystem over quadratic fields quotients
• scientific article; zbMATH DE number 5670521
• Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
• scientific article; zbMATH DE number 1504547
• scientific article; zbMATH DE number 169207

Cited in

(6)

• scientific article; zbMATH DE number 5670521 (Why is no real title available?)
• Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
• scientific article; zbMATH DE number 1759645 (Why is no real title available?)
• An Efficient Public Key Cryptosystem with a Privacy Enhanced Double Decryption Mechanism
• Generalized ElGamal Public Key Cryptosystem Based on a New Diffie-Hellman Problem
• New probabilistic public-key encryption based on the RSA cryptosystem

This page was built for publication: Efficient probabilistic public-key cryptosystem based on the diffie-hellman problem

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