Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Pierrick Méaux"'
Publikováno v:
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2022, Iss 4 (2022)
Hard physical learning problems have been introduced as an alternative option to implement cryptosystems based on hard learning problems. Their high-level idea is to use inexact computing to generate erroneous computations directly, rather than to fi
Externí odkaz:
https://doaj.org/article/b93475ccc0114e3381b7b64b8a29aefb
Autor:
Davide Bellizia, Clément Hoffmann, Dina Kamel, Hanlin Liu, Pierrick Méaux, François-Xavier Standaert, Yu Yu
Publikováno v:
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2021, Iss 3 (2021)
Hard learning problems are important building blocks for the design of various cryptographic functionalities such as authentication protocols and post-quantum public key encryption. The standard implementations of such schemes add some controlled err
Externí odkaz:
https://doaj.org/article/9f5b2c12ef5642fa8ffc519bda795862
Publikováno v:
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2021, Iss 1 (2020)
State-of-the-art re-keying schemes can be viewed as a tradeoff between efficient but heuristic solutions based on binary field multiplications, that are only secure if implemented with a sufficient amount of noise, and formal but more expensive solut
Externí odkaz:
https://doaj.org/article/23deca94ac064d77b1824d6e03153c48
Publikováno v:
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2020, Iss 2 (2020)
Code-based masking is a very general type of masking scheme that covers Boolean masking, inner product masking, direct sum masking, and so on. The merits of the generalization are twofold. Firstly, the higher algebraic complexity of the sharing funct
Externí odkaz:
https://doaj.org/article/8c173100c1b64cd09ae6d8c951f484b5
Publikováno v:
IACR Transactions on Symmetric Cryptology, Pp 192-227 (2017)
We study the main cryptographic features of Boolean functions (balancedness, nonlinearity, algebraic immunity) when, for a given number n of variables, the input to these functions is restricted to some subset E of
Externí odkaz:
https://doaj.org/article/f45cf18e3ea242e7ad0ad367477d5d0d
Publikováno v:
Designs, Codes and Cryptography.
Publikováno v:
Advances in Cryptology – EUROCRYPT 2023 ISBN: 9783031306334
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2023
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – EUROCRYPT 2023
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71595c3d21cb3d2dd8d1e8e57ffb43ef
https://doi.org/10.1007/978-3-031-30634-1_20
https://doi.org/10.1007/978-3-031-30634-1_20
Autor:
Agnese Gini, Pierrick Méaux
Publikováno v:
Codes, Cryptology and Information Security ISBN: 9783031330162
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46393244ef66844eaf9012a518649706
https://doi.org/10.1007/978-3-031-33017-9_21
https://doi.org/10.1007/978-3-031-33017-9_21
Autor:
Dina Kamel, Clément Hoffmann, Hanlin Liu, Yu Yu, Davide Bellizia, François-Xavier Standaert, Pierrick Méaux
Publikováno v:
IACR Transactions on Cryptographic Hardware and Embedded Systems, Vol. 2021, no.3, p. 390-417 (2021)
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2021, Iss 3 (2021)
Transactions on Cryptographic Hardware and Embedded Systems, Vol 2021, Iss 3 (2021)
Hard learning problems are important building blocks for the design of various cryptographic functionalities such as authentication protocols and post-quantum public key encryption. The standard implementations of such schemes add some controlled err
Autor:
Pierrick Méaux
Publikováno v:
Cryptography and Communications. 13:741-762
Motivated by the impact of fast algebraic attacks on stream ciphers, and recent constructions using a threshold function as main part of the filtering function, we study the fast algebraic immunity of threshold functions. As a first result, we determ