Nonce-based symmetric encryption
Symmetric encryption schemes are usually formalized so as to make the encryption operation a probabilistic or state-dependent function ε of the message M and the key K: the user supplies M and K and the encryption process does the rest, flipping coins or modifying internal state in order to produce...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2014
|
| Online Access: | http://www.scopus.com/inward/record.url?eid=2-s2.0-35048855085&partnerID=40&md5=d9b69f01eae5ec1952ddf48893216edf http://cmuir.cmu.ac.th/handle/6653943832/6426 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| Language: | English |
| Summary: | Symmetric encryption schemes are usually formalized so as to make the encryption operation a probabilistic or state-dependent function ε of the message M and the key K: the user supplies M and K and the encryption process does the rest, flipping coins or modifying internal state in order to produce a ciphertext C. Here we investigate an alternative syntax for an encryption scheme, where the encryption process ε is a deterministic function that surfaces an initialization vector (IV). The user supplies a message M, key K, and initialization vector N, getting back the (one and only) associated ciphertext C = εKN(M). We concentrate on the case where the IV is guaranteed to be a nonce - something that takes on a new value with every message one encrypts. We explore definitions, constructions, and properties for nonce-based encryption. Symmetric encryption with a surfaced IV more directly captures real-word constructions like CBC mode, and encryption schemes constructed to be secure under nonce-based security notions may be less prone to misuse. © International Association for Cryptologic Research 2004. |
|---|