Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Sylvain Duquesne"'
Autor:
Sylvain Duquesne
Publikováno v:
WAIFI
WAIFI, 2022, Chengdu, China. pp.79-106, ⟨10.1007/978-3-031-22944-2_5⟩
Arithmetic of Finite Fields ISBN: 9783031229435
WAIFI, 2022, Chengdu, China. pp.79-106, ⟨10.1007/978-3-031-22944-2_5⟩
Arithmetic of Finite Fields ISBN: 9783031229435
International audience; Both classical and post-quantum cryptography massively use large characteristic nite elds or rings. Consequently, basic arithmetic on these elds or rings (integer or polynomial multiplication, modular reduction) may signicantl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06eedc04b8a6403520ba0a26687ee234
https://hal.science/hal-03933761
https://hal.science/hal-03933761
Autor:
Jean-Claude Bajard, Sylvain Duquesne
Publikováno v:
Journal of Cryptographic Engineering
Journal of Cryptographic Engineering, Springer, 2021, 11 (4), p. 399-415. ⟨10.1007/s13389-021-00260-z⟩
Journal of Cryptographic Engineering, 2021, 11 (4), p. 399-415. ⟨10.1007/s13389-021-00260-z⟩
Journal of Cryptographic Engineering, Springer, 2021, 11 (4), p. 399-415. ⟨10.1007/s13389-021-00260-z⟩
Journal of Cryptographic Engineering, 2021, 11 (4), p. 399-415. ⟨10.1007/s13389-021-00260-z⟩
International audience; This paper deals with Montgomery-friendly primes designed for the modular reduction algorithm of Montgomery. These numbers are scattered in the literature and their properties are partially exploited. We exhibit a large family
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f822e086ed0dbfd3e34769be4cb34cbf
https://hal.sorbonne-universite.fr/hal-02883333/file/BaDueprintversion.pdf
https://hal.sorbonne-universite.fr/hal-02883333/file/BaDueprintversion.pdf
Publikováno v:
19th International Conference, CANS 2020, Vienna, Austria, December 14–16, 2020, Proceedings
19th International Conference, CANS 2020, Vienna, Austria, December 14–16, 2020, Proceedings, Dec 2020, Vienna, Austria
Cryptology and Network Security ISBN: 9783030654108
CANS
19th International Conference, CANS 2020, Vienna, Austria, December 14–16, 2020, Proceedings, Dec 2020, Vienna, Austria
Cryptology and Network Security ISBN: 9783030654108
CANS
International audience; Pairings are a powerful tool to build advanced cryptographic schemes. The most efficient way to instantiate a pairing scheme is through Pairing-Friendly Elliptic Curves. Because a randomly picked elliptic curve will not suppor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d13e28cc513686897c1f26c209d3e9e
https://hal.science/hal-02944143/document
https://hal.science/hal-02944143/document
This volume contains the papers accepted for presentation at Africacrypt 2023, the 14th International Conference on the Theory and Application of Cryptographic Techniques in Africa. The 21 full papers included in this book were carefully reviewed
Publikováno v:
Mathematica Slovaca
Mathematica Slovaca, 2020, 70 (2), pp.273-288. ⟨10.1515/ms-2017-0350⟩
Mathematica Slovaca, 2020, 70 (2), pp.273-288. ⟨10.1515/ms-2017-0350⟩
We associate to some simplest quartic fields a family of elliptic curves that has rank at least three over ℚ(m). It is given by the equation E m : y 2 = x 3 − 36 36 m 4 + 48 m 2 + 25 36 m 4 − 48 m 2 + 25 x . $$\begin{array}{} \displaystyle E_m:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a71ec6e15df0d658124c1edff1b9a78
https://hal.science/hal-02018434/document
https://hal.science/hal-02018434/document
Publikováno v:
Applicable Algebra in Engineering, Communication and Computing
Applicable Algebra in Engineering, Communication and Computing, 2018, 29 (2), pp.113-147. ⟨10.1007/s00200-017-0334-y⟩
Applicable Algebra in Engineering, Communication and Computing, Springer Verlag, 2018, 29 (2), pp.113-147. ⟨10.1007/s00200-017-0334-y⟩
Applicable Algebra in Engineering, Communication and Computing, Springer Verlag, 2018, 29 (2), pp.113-147
Applicable Algebra in Engineering, Communication and Computing, 2018, 29 (2), pp.113-147. ⟨10.1007/s00200-017-0334-y⟩
Applicable Algebra in Engineering, Communication and Computing, Springer Verlag, 2018, 29 (2), pp.113-147. ⟨10.1007/s00200-017-0334-y⟩
Applicable Algebra in Engineering, Communication and Computing, Springer Verlag, 2018, 29 (2), pp.113-147
Because pairings have many applications, many hardware and software pairing implementations can be found in the literature. However, the parameters generally used have been invalidated by the recent results on the discrete logarithm problem over pair
Autor:
Razvan Barbulescu, Sylvain Duquesne
Publikováno v:
Journal of Cryptology
Journal of Cryptology, 2019, 32 (4), pp.1298--1336. ⟨10.1007/s00145-018-9280-5⟩
Journal of Cryptology, Springer Verlag, 2019, 32 (4), pp.1298--1336. ⟨10.1007/s00145-018-9280-5⟩
2017-61. 2017
Journal of Cryptology, 2019, 32 (4), pp.1298--1336. ⟨10.1007/s00145-018-9280-5⟩
Journal of Cryptology, Springer Verlag, 2019, 32 (4), pp.1298--1336. ⟨10.1007/s00145-018-9280-5⟩
2017-61. 2017
Recent progress on NFS imposed a new estimation of the security of pairings. In this work we study the best attacks against some of the most popular pairings and propose new key sizes using an analysis which is more precise than the analysis in a rec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0a432d9cfcac6e5027d3533ea723977
https://hal.science/hal-01534101v2/file/main.pdf
https://hal.science/hal-01534101v2/file/main.pdf
Autor:
Medien Zeghid, Hassan Yousif Ahmed, Loubna Ghammam, Sylvain Duquesne, Anissa Sghaier, Mohsen Machhout
Publikováno v:
Microprocessors and Microsystems: Embedded Hardware Design (MICPRO)
Microprocessors and Microsystems: Embedded Hardware Design (MICPRO), Elsevier, 2018, 61, pp.227-241. ⟨10.1016/j.micpro.2018.06.001⟩
Microprocessors and Microsystems: Embedded Hardware Design
Microprocessors and Microsystems: Embedded Hardware Design, 2018, 61, pp.227-241. ⟨10.1016/j.micpro.2018.06.001⟩
Microprocessors and Microsystems: Embedded Hardware Design (MICPRO), Elsevier, 2018, 61, pp.227-241. ⟨10.1016/j.micpro.2018.06.001⟩
Microprocessors and Microsystems: Embedded Hardware Design
Microprocessors and Microsystems: Embedded Hardware Design, 2018, 61, pp.227-241. ⟨10.1016/j.micpro.2018.06.001⟩
In this paper, a novel high speed and efficient area optimal Ate pairing processor implementation over Barreto-Naehrig (BN) and Barreto-Lynn-Scott (BLS12) curves on field-programmable gate array (FPGA) is proposed. The optimal Ate pairing proposed de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2d37d6ff10f02e4799862c6041634678
https://hal.archives-ouvertes.fr/hal-01968174
https://hal.archives-ouvertes.fr/hal-01968174
Autor:
Sylvain Duquesne, Takuya Kusaka, Yoshinori Uetake, Yasuyuki Nogami, Akihiro Sanada, Leo Weissbart
Publikováno v:
PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018)
PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018), 2018, Singapour, Singapore. pp.618-622
ISITA
PROCEEDINGS OF 2018 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA2018), 2018, Singapour, Singapore. pp.618-622
ISITA
With the matter of secure communication between devices, and especially for IoT devices, more and more applications need trustful protocols to communicate using public key cryptography. Elliptic curve cryptography is nowadays a very secure and effici
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68d8830d1827c96845e9e84a782ced64
https://hal.archives-ouvertes.fr/hal-01968191
https://hal.archives-ouvertes.fr/hal-01968191
Autor:
Sylvain Duquesne, Al Amin Khandaker, Yuki Nanjo, Yasuyuki Nogami, Loubna Ghammam, Yuta Kodera
Publikováno v:
LNCS
IndoCrypt 2017-18th International Conference on Cryptology
IndoCrypt 2017-18th International Conference on Cryptology, Dec 2017, Chennai, India. LNCS, 10698, pp.186-205
IndoCrypt 2017-18th International Conference on Cryptology, Dec 2017, Chennai, India. pp.186-205
Lecture notes in computer science
Lecture notes in computer science, springer, 2017
Lecture Notes in Computer Science ISBN: 9783319716664
INDOCRYPT
IndoCrypt 2017-18th International Conference on Cryptology
IndoCrypt 2017-18th International Conference on Cryptology, Dec 2017, Chennai, India. LNCS, 10698, pp.186-205
IndoCrypt 2017-18th International Conference on Cryptology, Dec 2017, Chennai, India. pp.186-205
Lecture notes in computer science
Lecture notes in computer science, springer, 2017
Lecture Notes in Computer Science ISBN: 9783319716664
INDOCRYPT
International audience; Following the emergence of Kim and Barbulescu's new number field sieve (exTNFS) algorithm at CRYPTO'16 [21] for solving discrete logarithm problem (DLP) over the finite field; pairing-based cryptography researchers are intrigu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::adbe57708ed480b85bb0eb34af0de7b4
https://hal.archives-ouvertes.fr/hal-01620848
https://hal.archives-ouvertes.fr/hal-01620848