Výsledky vyhledávání - "Cyril Bouvier"

An Alternative Approach for SIDH Arithmetic

Publikováno v: IACR International Conference on Public-Key Cryptography (PKC 2021)
IACR International Conference on Public-Key Cryptography (PKC 2021), May 2021, Virtual, United Kingdom. pp.27-44, ⟨10.1007/978-3-030-75245-3_2⟩
Public-Key Cryptography – PKC 2021 ISBN: 9783030752446
Public Key Cryptography (1)

International audience; In this paper, we present new algorithms for the field arithmetic layers of supersingular isogeny Diffie-Hellman; one of the fifteen remaining candidates in the NIST post-quantum standardization process. Our approach uses a po

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ebec5971686d4d914844ecb7dbef2c4d
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02990006

Zobrazit plný text záznamu

Faster Cofactorization with ECM Using Mixed Representations

Autor: Laurent Imbert, Cyril Bouvier

Publikováno v: IACR International Conference on Public-Key Cryptography (PKC)
IACR International Conference on Public-Key Cryptography (PKC), Jun 2020, Virtual, United Kingdom. pp.483-504, ⟨10.1007/978-3-030-45388-6_17⟩
Lecture Notes in Computer Science ISBN: 9783030453879
Public Key Cryptography (2)

International audience; This paper introduces a novel implementation of the elliptic curve factoring method specifically designed for medium-size integers such as those arising by billions in the cofactorization step of the Number Field Sieve. In thi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::741b98bb94145ff65996d75c7defdad6
https://hal-lirmm.ccsd.cnrs.fr/lirmm-02613652/document

Zobrazit plný text záznamu

Robust Optimization On GPU: a use case, shortest paths

Autor: Eric Bourreau, Michael Poss, Cyril Bouvier

Publikováno v: 29th European Conference on Operational Research
EURO: European Conference on Operational Research
EURO: European Conference on Operational Research, Jul 2018, Valencia, Spain
HAL

International audience

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5c6a3d3a0ccf5181ad4a9ae645277692
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01875585

Zobrazit plný text záznamu

Optimisation Robuste sur GPU. Cas d’application : les plus courts chemins

Autor: Eric Bourreau, Michael Poss, Cyril Bouvier

Publikováno v: 19eme congrès annuel de la société Française de Recherche Opérationnelle et d'Aide à la Décision
ROADEF: Recherche Opérationnelle et Aide à la Décision
ROADEF: Recherche Opérationnelle et Aide à la Décision, Feb 2018, Lorient, France
HAL

National audience

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4c27e56f53d702c09a95b5cb2bade8c0
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01875581

Zobrazit plný text záznamu

Better polynomials for GNFS

Autor: Alexander Kruppa, Cyril Bouvier, Shi Bai, Paul Zimmermann

Publikováno v: Mathematics of Computation
Mathematics of Computation, American Mathematical Society, 2016, 85, pp.12. ⟨10.1090/mcom3048⟩
Mathematics of Computation, 2016, 85, pp.12. ⟨10.1090/mcom3048⟩

International audience; The general number field sieve (GNFS) is the most efficient algo-rithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the selected polynomials can be

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92eb27892d26a90164bce35ba8c4421c
https://hal.inria.fr/hal-01089507/file/sopt-20140905.pdf

Zobrazit plný text záznamu

Division-Free Binary-to-Decimal Conversion

Autor: Paul Zimmermann, Cyril Bouvier

Publikováno v: IEEE Transactions on Computers
IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers, 2014, 63 (8), pp.1895-1901. ⟨10.1109/TC.2014.2315621⟩
IEEE Transactions on Computers, 2014, 63 (8), pp.1895-1901. ⟨10.1109/TC.2014.2315621⟩

This article presents algorithms that convert multiple precision integer or floating-point numbers from radix $2$ to radix $10$ (or to any radix $b > 2$). Those algorithms, based on the “scaled remainder tree” technique, use multiplications inste

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5eb6afd82b7a060eba504248ab6a970
https://hal.inria.fr/hal-00864293

Zobrazit plný text záznamu

Discrete logarithm in GF($2^{809}$) with FFS

Autor: Pierrick Gaudry, Jérémie Detrey, Razvan Barbulescu, Emmanuel Thomé, Marion Videau, Paul Zimmermann, Cyril Bouvier, Hamza Jeljeli

Publikováno v: International Workshop on Public Key Cryptography
Public-Key Cryptography – PKC 2014
Public-Key Cryptography – PKC 2014, 2014, Buenos Aires, Argentina. ⟨10.1007/978-3-642-54631-0_13⟩
Public-Key Cryptography – PKC 2014 ISBN: 9783642546303
Public Key Cryptography

International audience; The year 2013 has seen several major complexity advances for the discrete logarithm problem in multiplicative groups of small- characteristic finite fields. These outmatch, asymptotically, the Function Field Sieve (FFS) approa

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::927460678ee9ff557a7c0bd114c06d8d
https://inria.hal.science/hal-00818124

Zobrazit plný text záznamu

Finding ECM-friendly curves through a study of Galois properties

Autor: Cyril Bouvier, Peter L. Montgomery, Thorsten Kleinjung, Razvan Barbulescu, Joppe W. Bos

Publikováno v: ANTS-X 10th Algorithmic Number Theory Symposium-2012
ANTS-X 10th Algorithmic Number Theory Symposium-2012, University of California, Jul 2012, San Diego, United States

International audience; In this paper we prove some divisibility properties of the cardinality of elliptic curves modulo primes. These proofs explain the good behavior of certain parameters when using Montgomery or Edwards curves in the setting of th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5dbb113466862d27e607c8732347ea0

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání