Challenging the increased resistance of regular hash functions against birthday attacks

Autor: Mouha Nicky, Sekar Gautham, Preneel Bart

Publikováno v: Journal of Mathematical Cryptology, Vol 6, Iss 3-4, Pp 229-248 (2012)

At Eurocrypt 2004, Bellare and Kohno presented the concept of a regular hash function. For a hash function to be regular, every hash value must have the same number of preimages in the domain. The findings of their paper remained unchallenged for ove

Externí odkaz: https://doaj.org/article/c6ac4ad694904801b47445271a20f4d0

T₅: Hashing Five Inputs with Three Compression Calls

Autor: Dodis, Yevgeniy, Khovratovich, Dmitry, Mouha, Nicky, Nandi, Mridul

Given 2n-to-n compression functions h₁,h₂,h₃, we build a new 5n-to-n compression function T₅, using only 3 compression calls: T₅(m₁, m₂, m₃, m₄, m₅) : = h₃(h₁(m₁, m₂)⊕ m₅ , h₂(m₃, m₄)⊕ m₅) ⊕ m₅ We prove t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c546e465ca7d68d6b78e4a0ee35b220c

APE: Authenticated Permutation-Based Encryption for Lightweight Cryptography

Autor: Andreeva, Elena, Bilgin, Begül, Bogdanov, Andrey, Luykx, Atul, Mennink, Bart, Mouha, Nicky, Yasuda, Kan, Cid, Carlos, Rechberger, Christian

Publikováno v: Fast Software Encryption ISBN: 9783662467053
FSE
Fast Software Encryption: 21st International Workshop, FSE 2014, London, UK, March 3-5, 2014. Revised Selected Papers, 168-186
STARTPAGE=168;ENDPAGE=186;TITLE=Fast Software Encryption

The domain of lightweight cryptography focuses on cryptographic algorithms for extremely constrained devices. It is very costly to avoid nonce reuse in such environments, because this requires either a hardware source of randomness, or non-volatile m

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::314f53bbfff4d337061f0996d0401a12
https://doi.org/10.1007/978-3-662-46706-0_9

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

PRIMATEs v2.0

Autor: Andreeva, Elena, Bilgin, Begül, Bogdanov, Andrey, Luykx, Atul, Mendel, Florian, Mennink, Bart, Mouha, Nicky, Wang, Qingju, Yasuda, Kan

Publikováno v: DIAC 2015-Directions in Authenticated Ciphers
DIAC 2015-Directions in Authenticated Ciphers, Sep 2015, Singapore, Singapore

International audience; PRIMATEs are a family of permutation-based authenticated encryption algorithms for lightweight applications. They are currently under submission to the CAESAR competition. There are three PRIMATEs: the basic SpongeWrap-variant

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______212::5f7a755e28660f3a6bf1228abd76c14f
https://hal.inria.fr/hal-01241081