Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Guillevic, Aurore"'
Autor:
Guillevic, Myriam, Guillevic, Aurore, Vollmer, Martin, Schlauri, Paul, Hill, Matthias, Emmenegger, Lukas, Reimann, Stefan
Non-target screening consists in searching a sample for all present substances, suspected or unknown, with very little prior knowledge about the sample. This approach has been introduced more than a decade ago in the field of water analysis, together
Externí odkaz:
http://arxiv.org/abs/2103.13807
Autor:
Boudot, Fabrice, Gaudry, Pierrick, Guillevic, Aurore, Heninger, Nadia, Thomé, Emmanuel, Zimmermann, Paul
Publikováno v:
The 40th Annual International Cryptology Conference (Crypto 2020), Aug 2020, Santa Barbara, USA, United States
We report on two new records: the factorization of RSA-240, a 795-bit number, and a discrete logarithm computation over a 795-bit prime field. Previous records were the factorization of RSA-768 in 2009 and a 768-bit discrete logarithm computation in
Externí odkaz:
http://arxiv.org/abs/2006.06197
Autor:
Guillevic, Aurore
Publikováno v:
Mathematics of Computation, American Mathematical Society, 2018, pp.29. http://www.ams.org/journals/mcom/
Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special, high-degree, tow
Externí odkaz:
http://arxiv.org/abs/1809.06135
Autor:
Ballentine, Sean, Guillevic, Aurore, García, Elisa Lorenzo, Martindale, Chloe, Massierer, Maike, Smith, Benjamin, Top, Jaap
Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of explicit isog
Externí odkaz:
http://arxiv.org/abs/1701.01927
Autor:
Guillevic, Aurore
Depuis 2000 les couplages sont devenus un très bon outil pour la conception de nouveaux protocoles cryptographiques. Les signatures courtes et le chiffrement basé sur l'identité sont devenus réalisables grâce aux couplages. Les travaux réalisé
Publikováno v:
Roberto Avanzi and Howard Heys. Selected Areas in Cryptography 2016, Aug 2016, St. John's, Canada. Springer, Selected Areas in Cryptography 2016
Pairing based cryptography is in a dangerous position following the breakthroughs on discrete logarithms computations in finite fields of small characteristic. Remaining instances are built over finite fields of large characteristic and their securit
Externí odkaz:
http://arxiv.org/abs/1605.07746
Autor:
Guillevic, Aurore
The Number Field Sieve (NFS) algorithm is the best known method to compute discrete logarithms (DL) in finite fields $\mathbb{F}\_{p^n}$, with $p$ medium to large and $n \geq 1$ small. This algorithm comprises four steps: polynomial selection, relati
Externí odkaz:
http://arxiv.org/abs/1505.07553
We propose various strategies for improving the computation of discrete logarithms in non-prime fields of medium to large characteristic using the Number Field Sieve. This includes new methods for selecting the polynomials; the use of explicit automo
Externí odkaz:
http://arxiv.org/abs/1408.0718
Publikováno v:
Designs, Codes & Cryptography; Nov2023, Vol. 91 Issue 11, p3333-3378, 46p
Autor:
Boudot, Fabrice, Gaudry, Pierrick, Guillevic, Aurore, Heninger, Nadia, Thomé, Emmanuel, Zimmermann, Paul
Publikováno v:
IEEE Security and Privacy Magazine
IEEE Security and Privacy Magazine, 2022, 20 (2), pp.80-86. ⟨10.1109/MSEC.2022.3141918⟩
IEEE Security and Privacy Magazine, 2022, 20 (2), pp.80-86. ⟨10.1109/MSEC.2022.3141918⟩
International audience; The security of essentially all public-key cryptography currently in common use today is based on the presumed computational hardness of three number-theoretic problems: integer factoring (required for the security of RSA encr