Qameleon v. 1.0

Roberto Avanzi; Subhadeep Banik; Andrej Bogdanov; ORR DUNKELMAN; Senyang Huang; Francesco Regazzoni

Qameleon v. 1.0

Roberto Avanzi, Subhadeep Banik, Andrej Bogdanov, ORR DUNKELMAN, Senyang Huang, Francesco Regazzoni

Department of Computer Science

Research output: Book/Report › Report › peer-review

Abstract

The present document proposes Qameleon, a new Authenࢼcated Encrypࢼon with Associated Data (AEAD) design based on well-understood technologies. Parameters sets and variants are suggested that can use different key and tweak sizes, and for each of them specific security levels are claimed. Qameleon targets low-latency scenarios, such as memory encrypঞon. This suggests that the scheme is
“perfectly” parallelisable, i.e., as parallelisable as possible on a single task. In particular, we support decrypঞon of any block (while authenঞcaঞon is sঞll taking place). Moreover, as our main focus is memory nencrypঞon, we mostly target scenarios in which the nonce are not repeated.

Original language	English
Number of pages	56
State	Published - 2019

Bibliographical note

Lightweight Cryptography Standardiza-tion Process candidate NIST

Access to Document

https://csrc.nist.gov/csrc/media/Projects/Lightweight-Cryptography/documents/round-1/spec-doc/qameleon-spec.pdf

Cite this

@book{90547b17217542e9904ab73427733a79,

title = "Qameleon v. 1.0",

abstract = "The present document proposes Qameleon, a new Authenࢼcated Encrypࢼon with Associated Data (AEAD) design based on well-understood technologies. Parameters sets and variants are suggested that can use different key and tweak sizes, and for each of them specific security levels are claimed. Qameleon targets low-latency scenarios, such as memory encrypঞon. This suggests that the scheme is“perfectly” parallelisable, i.e., as parallelisable as possible on a single task. In particular, we support decrypঞon of any block (while authenঞcaঞon is sঞll taking place). Moreover, as our main focus is memory nencrypঞon, we mostly target scenarios in which the nonce are not repeated.",

author = "Roberto Avanzi and Subhadeep Banik and Andrej Bogdanov and ORR DUNKELMAN and Senyang Huang and Francesco Regazzoni",

note = "Lightweight Cryptography Standardiza-tion Process candidate NIST",

year = "2019",

language = "אנגלית",

}

TY - BOOK

T1 - Qameleon v. 1.0

AU - Avanzi, Roberto

AU - Banik, Subhadeep

AU - Bogdanov, Andrej

AU - DUNKELMAN, ORR

AU - Huang, Senyang

AU - Regazzoni, Francesco

N1 - Lightweight Cryptography Standardiza-tion Process candidate NIST

PY - 2019

Y1 - 2019

N2 - The present document proposes Qameleon, a new Authenࢼcated Encrypࢼon with Associated Data (AEAD) design based on well-understood technologies. Parameters sets and variants are suggested that can use different key and tweak sizes, and for each of them specific security levels are claimed. Qameleon targets low-latency scenarios, such as memory encrypঞon. This suggests that the scheme is“perfectly” parallelisable, i.e., as parallelisable as possible on a single task. In particular, we support decrypঞon of any block (while authenঞcaঞon is sঞll taking place). Moreover, as our main focus is memory nencrypঞon, we mostly target scenarios in which the nonce are not repeated.

AB - The present document proposes Qameleon, a new Authenࢼcated Encrypࢼon with Associated Data (AEAD) design based on well-understood technologies. Parameters sets and variants are suggested that can use different key and tweak sizes, and for each of them specific security levels are claimed. Qameleon targets low-latency scenarios, such as memory encrypঞon. This suggests that the scheme is“perfectly” parallelisable, i.e., as parallelisable as possible on a single task. In particular, we support decrypঞon of any block (while authenঞcaঞon is sঞll taking place). Moreover, as our main focus is memory nencrypঞon, we mostly target scenarios in which the nonce are not repeated.

M3 - דוח

BT - Qameleon v. 1.0

ER -

Qameleon v. 1.0

Abstract

Bibliographical note

Access to Document

Fingerprint

Cite this