Security of cipher systems with public keys based on the discrete logarithm problem

MaRDI QIDQ2998506zbMATH OpenFDO

Authors Robert Rolland

Publication date 18 May 2011

zbMATH Keywords

Cramer-Shoup encryptionDiffie-Hellman problemdiscrete logarithm problemElGamal encryptionFujisaki-Okamoto methodinformation securitymain problems of cryptographyOracle modelspublic-key cryptographysemantic security

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Security analysis of discrete logarithm based cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Discrete logarithms: The past and the future
• A public key cryptosystem and a signature scheme based on discrete logarithms
• scientific article; zbMATH DE number 4214161

Cited in

(2)

• Security analysis of discrete logarithm based cryptosystems
• Public-key cryptosystem design based on factoring and discrete logarithms

This page was built for publication: Security of cipher systems with public keys based on the discrete logarithm problem

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