A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order

DOI10.1007/3-540-36178-2_2zbMath1065.94555OpenAlexW1506470410MaRDI QIDQ4412787

Stefan Lucks

Publication date: 16 July 2003

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36178-2_2

zbMATH Keywords

Cramer-Shoup cryptosystemquadratic residues groups

Mathematics Subject Classification ID

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

Related Items (5)

Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model ⋮ Punctured syndrome decoding problem. Efficient side-channel attacks against \textit{Classic McEliece} ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Practical fully secure unrestricted inner product functional encryption modulo \(p\) ⋮ Practical Chosen Ciphertext Secure Encryption from Factoring

Uses Software

• Magma

This page was built for publication: A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order