Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Paul Kirchner"'
Publikováno v:
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2022, Iss 2 (2022)
We present BAT – an IND-CCA secure key encapsulation mechanism (KEM) that is based on NTRU but follows an encryption/decryption paradigm distinct from classical NTRU KEMs. It demonstrates a new approach of decrypting NTRU ciphertext since its intro
Externí odkaz:
https://doaj.org/article/f73080291c2849b1a8a7f84fe92a6936
Autor:
Paul Kirchner, Thomas Espitau
Publikováno v:
Open Book Series. 4:251-266
Publikováno v:
Advances in Cryptology – CRYPTO 2021 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings
CRYPTO 2021
CRYPTO 2021, Aug 2021, Santa Barbara / Virtual, United States. ⟨10.1007/978-3-030-84245-1_26⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2021
CRYPTO 2021, Aug 2021, Santa Barbara / Virtual, United States
Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842444
CRYPTO (2)
CRYPTO 2021
CRYPTO 2021, Aug 2021, Santa Barbara / Virtual, United States. ⟨10.1007/978-3-030-84245-1_26⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2021
CRYPTO 2021, Aug 2021, Santa Barbara / Virtual, United States
Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842444
CRYPTO (2)
The lll algorithm is a polynomial-time algorithm for reducing d-dimensional lattice with exponential approximation factor. Currently, the most efficient variant of lll, by Neumaier and Stehle, has a theoretical running time in \(d^4\cdot B^{1+o\left(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8342909a6fced134e4c5946f1c2947c4
https://hal.science/hal-03558739
https://hal.science/hal-03558739
Publikováno v:
Advances in Cryptology – EUROCRYPT 2020
Advances in Cryptology – EUROCRYPT 2020, May 2020, Zagreb, Croatia. pp.34-63, ⟨10.1007/978-3-030-45727-3_2⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2020
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457266
EUROCRYPT (3)
Advances in Cryptology – EUROCRYPT 2020-39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part III
Advances in Cryptology – EUROCRYPT 2020, May 2020, Zagreb, Croatia. pp.34-63, ⟨10.1007/978-3-030-45727-3_2⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2020
Advances in Cryptology – EUROCRYPT 2020 ISBN: 9783030457266
EUROCRYPT (3)
Advances in Cryptology – EUROCRYPT 2020-39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020, Proceedings, Part III
International audience; In this paper, we initiate the study of side-channel leakage in hash-and-sign lattice-based signatures, with particular emphasis on the two efficient implementations of the original GPV lattice-trapdoor paradigm for signatures
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fda5ca4745d8c30067d4ce82820a3b5d
https://inria.hal.science/hal-03854922
https://inria.hal.science/hal-03854922
Publikováno v:
Advances in Cryptology – CRYPTO 2020 ISBN: 9783030568795
CRYPTO (2)
Advances in Cryptology – CRYPTO 2020-40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2020
CRYPTO (2)
Advances in Cryptology – CRYPTO 2020-40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2020
We describe two very efficient polynomial-time algorithms for reducing module lattices defined over arbitrary cyclotomic fields that solve the \(\gamma \)-Hermite Module-SVP problem. They both exploit the structure of tower fields and the second one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e2176a15c3b93e0d01196273127e73d
https://doi.org/10.1007/978-3-030-56880-1_6
https://doi.org/10.1007/978-3-030-56880-1_6
Faster Enumeration-Based Lattice Reduction: Root Hermite Factor $$k^{1/(2k)}$$ Time $$k^{k/8+o(k)}$$
Publikováno v:
Advances in Cryptology – CRYPTO 2020-40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part II
Advances in Cryptology-{CRYPTO} 2020
Crypto
Crypto, 2020, Santa Barbara, United States. pp.186-212, ⟨10.1007/978-3-030-56880-1_7⟩
Advances in Cryptology – CRYPTO 2020 ISBN: 9783030568795
CRYPTO (2)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2020
Advances in Cryptology-{CRYPTO} 2020
Crypto
Crypto, 2020, Santa Barbara, United States. pp.186-212, ⟨10.1007/978-3-030-56880-1_7⟩
Advances in Cryptology – CRYPTO 2020 ISBN: 9783030568795
CRYPTO (2)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – CRYPTO 2020
We give a lattice reduction algorithm that achieves root Hermite factor \(k^{1/(2k)}\) in time \(k^{k/8+o(k)}\) and polynomial memory. This improves on the previously best known enumeration-based algorithms which achieve the same quality, but in time
Publikováno v:
Post-Quantum Cryptography ISBN: 9783319598789
PQCrypto
International Workshop on Post-Quantum Cryptography
International Workshop on Post-Quantum Cryptography, Jun 2017, Utrecht, Netherlands
PQCrypto
International Workshop on Post-Quantum Cryptography
International Workshop on Post-Quantum Cryptography, Jun 2017, Utrecht, Netherlands
International audience; The SPRING pseudo-random function (PRF) has been described by Banerjee, Brenner, Leurent, Peikert and Rosen at FSE 2014. It is quite fast, only 4.5 times slower than the AES (without hardware acceleration) when used in counter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9624bc27379cf736b5c8db292fe5bb5f
https://doi.org/10.1007/978-3-319-59879-6_8
https://doi.org/10.1007/978-3-319-59879-6_8
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319566191
The Principal Ideal Problem (resp. Short Principal Ideal Problem), shorten as PIP (resp. SPIP), consists in finding a generator (resp. short generator) of a principal ideal in the ring of integers of a number field. Several lattice-based cryptosystem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2fbad48dda8703630a8b034dc57741d
https://doi.org/10.1007/978-3-319-56620-7_3
https://doi.org/10.1007/978-3-319-56620-7_3
Publikováno v:
Proceedings of the Human Factors and Ergonomics Society Annual Meeting. 58:11-15
Dieser Beitrag ist mit Zustimmung des Rechteinhabers aufgrund einer (DFG geförderten) Allianz- bzw. Nationallizenz frei zugänglich. This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national