Combinatorics in Algebraic and Logical Cryptanalysis

Autor: Trimoska, Monika

Publikováno v: Cryptography and Security [cs.CR]. Université de Picardie-Jules Verne, 2021. English

In this thesis, we explore the use of combinatorial techniques, such as graph-based algorithms and constraint satisfaction, in cryptanalysis. Our main focus is on the elliptic curve discrete logarithm problem. First, we tackle this problem in the cas

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::529fd1b7a023e50c61db7c64bb23fea5
https://hal.archives-ouvertes.fr/tel-03168389

Conception et analyse cryptographique des cryptosystèmes post-quantiques

Autor: Chakraborty, Olive

Publikováno v: Cryptography and Security [cs.CR]. Sorbonne Université, 2020. English. ⟨NNT : 2020SORUS283⟩

Polynomial system solving is one of the oldest and most important problems incomputational mathematics and has many applications in computer science. Itis intrinsically a hard problem with complexity at least single exponential in the number of varia

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3c55b308df24f598c9a179d1100b5c23
https://tel.archives-ouvertes.fr/tel-03460923v2/document

Cryptanalysis of Public Key Cryptosystems

Autor: Nitaj, Abderrahmane

Publikováno v: Cryptography and Security [cs.CR]. Université de Caen Normandie, 2016

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::fad26358097a275cca1146a6979fbb75
https://hal-normandie-univ.archives-ouvertes.fr/tel-02321087

The point decomposition problem in Jacobian varieties

Autor: Wallet, Alexandre

Publikováno v: Data Structures and Algorithms [cs.DS]. Université Pierre et Marie Curie-Paris VI, 2016. English. ⟨NNT : 2016PA066438⟩

The discrete logarithm problem is a fundamental brick for several protocols for secured communications. Its instantiation over elliptic curves allows the deployment of efficient asymmetric primitives in embedded systems, because of the small size of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4b43471de5e2a11d8708f650e0d07cb0
https://theses.hal.science/tel-01407675

Algebraic and Physical Security in Code-Based Cryptography

Autor: Urvoy de Portzamparc, Frédéric

Publikováno v: Other [cs.OH]. Université Pierre et Marie Curie-Paris VI, 2015. English. ⟨NNT : 2015PA066106⟩
Cryptography and Security [cs.CR]. Université Pierre et Marie Curie-Paris VI, 2015. English. ⟨NNT : 2015PA066106⟩

Code-based cryptography, introduced by Robert McEliece in 1978, is a potential candidate to replace the asymetric primitives which are threatened by quantum computers. More generral, it has been considered secure for more than thirty years, and allow

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c48c20fe41d14ca610fae4d5b0ac6433
https://theses.hal.science/tel-01187916