Zobrazeno 1 - 10
of 164
pro vyhledávání: '"Courbes Elliptiques"'
Autor:
Russon, Andy
Publikováno v:
Géométrie algébrique [math.AG]. Université Rennes 1, 2022. Français. ⟨NNT : 2022REN1S005⟩
The use of elliptic curves in cryptography has become widespread to ensure the security of communications or financial transactions. This is mainly due to the fact that its security relies on the difficulty of the discrete logarithm problem which all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::cbd5504fc8a8cc7e923f8bfab148d599
https://theses.hal.science/tel-03663532
https://theses.hal.science/tel-03663532
Autor:
El Housni, Youssef
Publikováno v:
Other [cs.OH]. Institut Polytechnique de Paris, 2022. English. ⟨NNT : 2022IPPAX104⟩
A proof system is a protocol where one party (called the prover) tries to convince another party (called the verifier) that a given state ment is true. In the class of non-interactive proof systems, a particularly interesting concept for proving the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7d17c654fce9f9b7b0d6ca585bc02c87
https://hal.science/tel-03922488
https://hal.science/tel-03922488
Autor:
Eid, Elie
Publikováno v:
Algebraic Geometry [math.AG]. Université Rennes 1, 2021. English. ⟨NNT : 2021REN1S012⟩
In this thesis, we propose efficient algorithms for computing isogenies between elliptic curves and Jacobians of hyperelliptic curves via p-adic differential equations with a sharp analysis of the losses of precision. More precisely, in one hand, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::750f409db19a28171230cf96d2a26723
https://theses.hal.science/tel-03337021
https://theses.hal.science/tel-03337021
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
https://hal.archives-ouvertes.fr/tel-03168389
Publikováno v:
Cryptography and Security [cs.CR]. Ecole Polytechnique, 2021. English. ⟨NNT : ⟩
Cryptography and Security [cs.CR]. Ecole Polytechnique, 2021. English
Cryptography and Security [cs.CR]. Ecole Polytechnique, 2021. English
Public-key cryptography, discovered 50 years ago by Whitfield Diffie and Martin Hellman,uses pairs of keys (one private, one public) to build secure protocols.Public-key cryptography has become an essential part of everyday securesystems, particularl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::201b3de504b16a2f1d0baf1b7e941494
https://hal.inria.fr/tel-03508143
https://hal.inria.fr/tel-03508143
Autor:
Mokrani, Youcef
Un nombre naturel n est dit congruent si il est l’aire d’un triangle rectangle dont tous les cotés sont de longueur rationnelle. Le problème des nombres congruents consiste à déterminer quels nombres sont congruents. Cette question, connue de
Externí odkaz:
http://hdl.handle.net/1866/24347
Autor:
Simon Masson
Publikováno v:
Cryptography and Security [cs.CR]. Université de Lorraine, 2020. English. ⟨NNT : 2020LORR0151⟩
HAL
HAL
This thesis studies the algorithmic of several cryptographic applications related to elliptic curves and isogenies of elliptic curves. On the one hand, we study the tradeoff between efficiency and security in pairing-based cryptography at the 128-bit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6751efadd87a9f27ab9fe73455045267
https://theses.hal.science/tel-03052499/file/ThesisSimonMasson7.pdf
https://theses.hal.science/tel-03052499/file/ThesisSimonMasson7.pdf
Autor:
Masson, Simon
Publikováno v:
Cryptography and Security [cs.CR]. Université de Lorraine, 2020. English. ⟨NNT : 2020LORR0151⟩
This thesis studies the algorithmic of several cryptographic applications related to elliptic curves and isogenies of elliptic curves. On the one hand, we study the tradeoff between efficiency and security in pairing-based cryptography at the 128-bit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::f40c3f45fcdf33e117526b7d7c76b8b0
https://tel.archives-ouvertes.fr/tel-03052499/document
https://tel.archives-ouvertes.fr/tel-03052499/document
Autor:
Roy, Subham
Le présent mémoire traite une variation de la mesure de Mahler où l'intégrale de définition est réalisée sur un tore plus général. Notre travail est basé sur une famille de polynômes tempérée originellement étudiée par Boyd, P_k (x, y)
Externí odkaz:
http://hdl.handle.net/1866/23797
Autor:
Lucas, Audrey
Publikováno v:
Cryptographie et sécurité [cs.CR]. Université Rennes 1, 2019. Français
Cryptographie et sécurité [cs.CR]. Université Rennes 1, 2019. Français. ⟨NNT : ⟩
Cryptographie et sécurité [cs.CR]. Université Rennes 1, 2019. Français. ⟨NNT : ⟩
This thesis deals with protection development and evaluation against fault attacks (FA) and side channel attacks (SCA) simultaneously. These protections have been developed for elliptic curves cryptography (ECC) and its main operation, the scalar mul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3b73e437d58a6a73828cc5e81f2065aa
https://hal.archives-ouvertes.fr/tel-02425706
https://hal.archives-ouvertes.fr/tel-02425706