Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Alexandre Gélin"'
Publikováno v:
Thirteenth Algorithmic Number Theory Symposium
Thirteenth Algorithmic Number Theory Symposium, Jul 2018, Madison, United States. pp.257-274, ⟨10.2140/obs.2019.2.257⟩
Thirteenth Algorithmic Number Theory Symposium, Jul 2018, Madison, United States
Thirteenth Algorithmic Number Theory Symposium, Jul 2018, Madison, United States. pp.257-274, ⟨10.2140/obs.2019.2.257⟩
Thirteenth Algorithmic Number Theory Symposium, Jul 2018, Madison, United States
Accepted for the Proceedings of ANTS-13; International audience; We give equations for 13 genus-2 curves over $\overline{\mathbb{Q}}$, with models over $\mathbb{Q}$, whose unpolarized Jacobians are isomorphic to the square of an elliptic curve with c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49bc26207519a8a92169f45c8aacc786
https://hal.science/hal-01856434
https://hal.science/hal-01856434
Autor:
Alexandre Gélin, Benjamin Wesolowski
Publikováno v:
Post-Quantum Cryptography-8th International Workshop, PQCrypto 2017, Utrecht, The Netherlands, June 26-28, 2017, Proceedings
8th International Conference on Post-Quantum Cryptography (PQCrypto 2017)
8th International Conference on Post-Quantum Cryptography (PQCrypto 2017), Jun 2017, Utrecht, Netherlands. pp.93-106, ⟨10.1007/978-3-319-59879-6_6⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Post-Quantum Cryptography
Post-Quantum Cryptography ISBN: 9783319598789
PQCrypto
8th International Conference on Post-Quantum Cryptography (PQCrypto 2017)
8th International Conference on Post-Quantum Cryptography (PQCrypto 2017), Jun 2017, Utrecht, Netherlands. pp.93-106, ⟨10.1007/978-3-319-59879-6_6⟩
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Post-Quantum Cryptography
Post-Quantum Cryptography ISBN: 9783319598789
PQCrypto
International audience; Cryptographic schemes based on supersingular isogenies have become an active area of research in the field of post-quantum cryptography. We investigate the resistance of these cryptosystems to fault injection attacks. It appea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e673640cc9caab50a901efcddeb24154
https://hal.archives-ouvertes.fr/hal-01568331/file/374.pdf
https://hal.archives-ouvertes.fr/hal-01568331/file/374.pdf
Publikováno v:
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation-ISSAC 17
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation -ISSAC '17
ISSAC
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017
ISSAC 2017 The 42nd International Symposium on Symbolic and Algebraic Computation
ISSAC 2017 The 42nd International Symposium on Symbolic and Algebraic Computation, Jul 2017, Kaiserslautern, Germany. pp.165--171, ⟨10.1145/3087604.3087606⟩
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation -ISSAC '17
ISSAC
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017
ISSAC 2017 The 42nd International Symposium on Symbolic and Algebraic Computation
ISSAC 2017 The 42nd International Symposium on Symbolic and Algebraic Computation, Jul 2017, Kaiserslautern, Germany. pp.165--171, ⟨10.1145/3087604.3087606⟩
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation
International audience; We provide a new family of elliptic curves that results in a one to two percent performance improvement of the elliptic curve integer factoriza-tion method. The speedup is confirmed by extensive tests for factors ranging from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3965750149de2c8d4fb1c6854f64b8c7
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
Autor:
CRAMER, RONALD1 Ronald.Cramer@cwi.nl, DUCAS, LÉO2 Leo.Ducas@cwi.nl, WESOLOWSKI, BENJAMIN3 benjamin.wesolowski@math.u-bordeaux.fr
Publikováno v:
Journal of the ACM. Mar2021, Vol. 68 Issue 2, p1-26. 26p.
Publikováno v:
ACM Transactions on Embedded Computing Systems; Mar2024, Vol. 23 Issue 2, p1-25, 25p
Autor:
Wesolowski, Benjamin
Publikováno v:
Journal of Cryptology; Oct2020, Vol. 33 Issue 4, p2113-2147, 35p
This book constitutes the refereed proceedings of the 7th International Symposium on Cyber Security, Cryptology, and Machine Learning, CSCML 2023, held in Be'er Sheva, Israel, in June 2023.The 21 full and 15 short papers were carefully reviewed and s