Zobrazeno 1 - 10
of 81
pro vyhledávání: '"Mouha, Nicky"'
Publikováno v:
IACR Transactions on Symmetric Cryptology; Volume 2022, Issue 2; 161-200
At EUROCRYPT ’93, Matsui introduced linear cryptanalysis. Both Matsui’s Algorithm 1 and 2 use a linear approximation involving certain state bits. Algorithm 2 requires partial encryptions or decryptions to obtain these state bits after guessing e
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
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
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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
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
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mouha, Nicky
Publikováno v:
[Research Report] Inria Paris Rocquencourt. 2015
The Chaskey MAC algorithm was presented by Mouha et al. at SAC 2014. It is designed for real-world applications where 128-bit keys are required, but standard cryptographic algorithms cannot be implemented because of stringent requirements on speed, e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8f6994ad425e635ef0de9ab2a5d6d3d9
https://inria.hal.science/hal-01242648/document
https://inria.hal.science/hal-01242648/document
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
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
https://hal.inria.fr/hal-01241081
Autor:
Mouha, Nicky
Publikováno v:
NIST Lightweight Cryptography Workshop 2015
NIST Lightweight Cryptography Workshop 2015, Jul 2015, Gaithersburg, United States
NIST Lightweight Cryptography Workshop 2015, Jul 2015, Gaithersburg, United States
International audience; For constrained devices, standard cryptographic algorithms can be too big, too slow or too energy-consuming. The area of lightweight cryptography studies new algorithms to overcome these problems. In this paper, we will focus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e05d8871beadf38ff996755c1be8d383
https://hal.inria.fr/hal-01241013
https://hal.inria.fr/hal-01241013