Live briefing
Everything about Deterministic encryption
Process of non-randomly producing the same ciphertext for a given same plaintext and key
A deterministic encryption scheme is a cryptosystem which always produces the same ciphertext for a given plaintext and key, even over separate executions of the encryption algorithm. Examples of deterministic encryption algorithms include RSA cryptosystem, and many block ciphers when used in ECB mode or with a constant initialization vector. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Deterministic encryptionA 5-minute orientation
- Skim a recent paper: A new approach based on artificial neural networks and chaos for designing deterministic random number generator and its application in image encryptionInfluential work since 2022
- Pick up a classic book: Ad Hoc NetworksThe most-reprinted book on the subject
- Read the landmark paper: Watermarking image encryption using deterministic phase mask and singular value decomposition in fractional Mellin transform domainCited 41 times
- Go sideways: Chosen-ciphertext attackA closely related topic
- Go sideways: Authenticated encryptionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Watermarking image encryption using deterministic phase mask and singular value decomposition in fractional Mellin transform domain
Optical image encryption technique based on deterministic phase masks
Deterministic quantum-public-key encryption: Forward search attack and randomization
A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Incremental Deterministic Public-Key Encryption
SUNDAE: Small Universal Deterministic Authenticated Encryption for the Internet of Things
Multi-use Deterministic Public Key Proxy Re-Encryption from Lattices in the Auxiliary-Input Setting
🆕 Influential since 2022
A new approach based on artificial neural networks and chaos for designing deterministic random number generator and its application in image encryption
A Novel Deterministic Threshold Proxy Re-Encryption Scheme From Lattices
An image compression-then-encryption algorithm using piecewise asymptotic deterministic random measurement matrix
Non-deterministic symmetric encryption communication system based on generative adversarial networks
SCALABLE AND JPEG-COMPATIBLE DCT-DOMAIN SECRET SHARING WITH DETERMINISTIC PARTITIONING AND LIGHTWEIGHT XOR ENCRYPTION
📚 Books worth reading
Ad Hoc NetworksJun Zheng · 2010
Cryptology Transmitted Message ProtectionIgor Izmailov, Boris Poizner · 2016
Advanced Machine Learning Technologies and ApplicationsAboul Ella Hassanien · 2012
Principles & Tools for Supply Chain ManagementScott Webster · 2008
Advances in Cryptology – EUROCRYPT 2013Thomas Johansson · 2013
Broadband quantum cryptographyDaniel J. Rogers · 2010
Information and Communicatiaon TechnologyKhabib Mustofa · 2013
Computer Networks & Communications (NetCom)Nabendu Chaki · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Chosen-ciphertext attack A chosen-ciphertext attack (CCA) is an attack model for cryptanalysis in which the cryptanalyst can gather information by obtaining the decryptions of…
- Authenticated encryption Authenticated encryption (AE) is any encryption scheme which simultaneously assures the data confidentiality (also known as privacy: the encrypted message…
- Plaintext-aware encryption Plaintext-awareness is a notion of security for public-key encryption. A cryptosystem is plaintext-aware if it is difficult for any efficient algorithm…
- Mihir Bellare Mihir Bellare is a cryptographer and professor at the University of California San Diego. He holds a Bachelor of Science degree from the California Institute…
- ElGamal encryption In cryptography, the ElGamal encryption system is a public-key encryption algorithm based on the Diffie–Hellman key exchange. It was described by Taher…
- Fujisaki–Okamoto transformation In cryptography, the Fujisaki–Okamoto transformation (FO transformation or FO transform) is a generic method for strengthening a public-key encryption…
- Ciphertext indistinguishability Ciphertext indistinguishability is a property of many encryption schemes. Intuitively, if a cryptosystem possesses the property of indistinguishability…
- Rabin cryptosystem The Rabin cryptosystem is a family of public-key encryption schemes based on a trapdoor function whose security, like that of RSA, is related to the difficulty…