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

DOI10.1007/3-540-36178-2_2MaRDI QIDQ4412787zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A new public key cryptosystem over \(\mathbb Z_{n^2}^\ast\)
• Cryptographic primitives based on groups on hidden order
• Theory of Cryptography
• The Group of Signed Quadratic Residues and Applications
• Using hash functions as a hedge against chosen ciphertext attack

Cited in

(9)

• Practical fully secure unrestricted inner product functional encryption modulo \(p\)
• Practical chosen ciphertext secure encryption from factoring
• A cryptographic primitive based on hidden-order groups
• Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
• Cryptographic primitives based on groups on hidden order
• Practical Chosen Ciphertext Secure Encryption from Factoring
• A new public key cryptosystem over \(\mathbb Z_{n^2}^\ast\)
• Cryptanalysis of Cramer-Shoup like cryptosystems based on index exchangeable family
• Punctured syndrome decoding problem. Efficient side-channel attacks against \textit{Classic McEliece}

Describes a project that uses

Uses Software

• Magma

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

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