Secure ElGamal-type cryptosystems without message encoding
From MaRDI portal
Publication:2803659
DOI10.1007/978-3-662-49301-4_29zbMATH Open1405.94071OpenAlexW2463335431MaRDI QIDQ2803659FDOQ2803659
Authors: Marc Joye
Publication date: 2 May 2016
Published in: The New Codebreakers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49301-4_29
Recommendations
Cites Work
- Probabilistic encryption
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- The random oracle methodology, revisited.
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stronger security proofs for RSA and Rabin bits.
- Public Key Cryptography - PKC 2006
- The Group of Signed Quadratic Residues and Applications
- Title not available (Why is that?)
Cited In (8)
- Message transmission for GH-public key cryptosystem
- Title not available (Why is that?)
- An efficient and secure cryptosystem for encrypting long messages
- Title not available (Why is that?)
- Encoding-free ElGamal-type encryption schemes on elliptic curves
- Public Key Cryptography - PKC 2006
- An ElGamal-like cryptosystem for enciphering large messages
- Towards a DL-Based Additively Homomorphic Encryption Scheme
This page was built for publication: Secure ElGamal-type cryptosystems without message encoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2803659)