default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAurore Guillevic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Diego F. Aranha
, Georgios Fotiadis, Aurore Guillevic:
A short-list of pairing-friendly curves resistant to the Special TNFS algorithm at the 192-bit security level. IACR Commun. Cryptol. 1(3): 3 (2024)- [i27]Aurore Guillevic:
More Embedded Curves for SNARK-Pairing-Friendly Curves. IACR Cryptol. ePrint Arch. 2024: 752 (2024) - [i26]Diego F. Aranha, Georgios Fotiadis, Aurore Guillevic:
A short-list of pairing-friendly curves resistant to the Special TNFS algorithm at the 192-bit security level. IACR Cryptol. ePrint Arch. 2024: 1223 (2024) - [i25]Aurore Guillevic, Simon Masson:
Embedded Curves and Embedded Families for SNARK-Friendly Curves. IACR Cryptol. ePrint Arch. 2024: 1737 (2024) - 2023
- [j5]Diego F. Aranha, Youssef El Housni, Aurore Guillevic:
A survey of elliptic curves for proof systems. Des. Codes Cryptogr. 91(11): 3333-3378 (2023) - 2022
- [j4]Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann:
The State of the Art in Integer Factoring and Breaking Public-Key Cryptography. IEEE Secur. Priv. 20(2): 80-86 (2022) - [c16]Youssef El Housni, Aurore Guillevic, Thomas Piellard:
Co-factor Clearing and Subgroup Membership Testing on Pairing-Friendly Curves. AFRICACRYPT 2022: 518-536 - [c15]Youssef El Housni, Aurore Guillevic:
Families of SNARK-Friendly 2-Chains of Elliptic Curves. EUROCRYPT (2) 2022: 367-396 - [i24]Youssef El Housni, Aurore Guillevic, Thomas Piellard:
Co-factor clearing and subgroup membership testing on pairing-friendly curves. IACR Cryptol. ePrint Arch. 2022: 352 (2022) - [i23]Diego F. Aranha, Youssef El Housni, Aurore Guillevic:
A survey of elliptic curves for proof systems. IACR Cryptol. ePrint Arch. 2022: 586 (2022) - 2021
- [j3]Myriam Guillevic, Aurore Guillevic, Martin K. Vollmer, Paul Schlauri, Matthias Hill, Lukas Emmenegger, Stefan Reimann:
Automated fragment formula annotation for electron ionisation, high resolution mass spectrometry: application to atmospheric measurements of halocarbons. J. Cheminformatics 13(1): 78 (2021) - [i22]Myriam Guillevic, Aurore Guillevic, Martin Vollmer, Paul Schlauri, Matthias Hill, Lukas Emmenegger, Stefan Reimann:
Automated fragment identification for electron ionisation mass spectrometry: application to atmospheric measurements of halocarbons. CoRR abs/2103.13807 (2021) - [i21]Youssef El Housni, Aurore Guillevic:
Families of SNARK-friendly 2-chains of elliptic curves. IACR Cryptol. ePrint Arch. 2021: 1359 (2021) - 2020
- [j2]Aurore Guillevic, Simon Masson, Emmanuel Thomé:
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation. Des. Codes Cryptogr. 88(6): 1047-1081 (2020) - [c14]Youssef El Housni, Aurore Guillevic:
Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition. CANS 2020: 259-279 - [c13]Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann:
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. CRYPTO (2) 2020: 62-91 - [c12]Aurore Guillevic:
A Short-List of Pairing-Friendly Curves Resistant to Special TNFS at the 128-Bit Security Level. Public Key Cryptography (2) 2020: 535-564 - [i20]Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann:
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. CoRR abs/2006.06197 (2020) - [i19]Youssef El Housni, Aurore Guillevic:
Optimized and secure pairing-friendly elliptic curves suitable for one layer proof composition. IACR Cryptol. ePrint Arch. 2020: 351 (2020) - [i18]Fabrice Boudot, Pierrick Gaudry, Aurore Guillevic, Nadia Heninger, Emmanuel Thomé, Paul Zimmermann:
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. IACR Cryptol. ePrint Arch. 2020: 697 (2020)
2010 – 2019
- 2019
- [j1]Aurore Guillevic:
Faster individual discrete logarithms in finite fields of composite extension degree. Math. Comput. 88(317): 1273-1301 (2019) - [i17]Aurore Guillevic, Simon Masson, Emmanuel Thomé:
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation. IACR Cryptol. ePrint Arch. 2019: 431 (2019) - [i16]Aurore Guillevic, Shashank Singh:
On the alpha value of polynomials in the tower number field sieve algorithm. IACR Cryptol. ePrint Arch. 2019: 885 (2019) - [i15]Aurore Guillevic:
A short-list of STNFS-secure pairing-friendly curves at the 128-bit security level. IACR Cryptol. ePrint Arch. 2019: 1371 (2019) - 2018
- [c11]Michael Scott, Aurore Guillevic:
A New Family of Pairing-Friendly Elliptic Curves. WAIFI 2018: 43-57 - [i14]Aurore Guillevic:
Faster individual discrete logarithms in finite fields of composite extension degree. CoRR abs/1809.06135 (2018) - 2017
- [c10]Laurent Grémy, Aurore Guillevic, François Morain, Emmanuel Thomé:
Computing Discrete Logarithms in 𝔽p6. SAC 2017: 85-105 - [i13]Sean Ballentine, Aurore Guillevic, Elisa Lorenzo García, Chloe Martindale, Maike Massierer, Benjamin Smith, Jaap Top:
Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication. CoRR abs/1701.01927 (2017) - 2016
- [c9]Aurore Guillevic, François Morain, Emmanuel Thomé:
Solving Discrete Logarithms on a 170-Bit MNT Curve by Pairing Reduction. SAC 2016: 559-578 - [i12]Aurore Guillevic, François Morain, Emmanuel Thomé:
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. CoRR abs/1605.07746 (2016) - [i11]Aurore Guillevic, François Morain, Emmanuel Thomé:
Solving discrete logarithms on a 170-bit MNT curve by pairing reduction. IACR Cryptol. ePrint Arch. 2016: 507 (2016) - [i10]Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain:
Improving NFS for the discrete logarithm problem in non-prime finite fields. IACR Cryptol. ePrint Arch. 2016: 605 (2016) - [i9]Aurore Guillevic:
Faster individual discrete logarithms in non-prime finite fields with the NFS and FFS algorithms. IACR Cryptol. ePrint Arch. 2016: 684 (2016) - 2015
- [c8]Aurore Guillevic:
Computing Individual Discrete Logarithms Faster in GF(p n ) with the NFS-DL Algorithm. ASIACRYPT (1) 2015: 149-173 - [c7]Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain:
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields. EUROCRYPT (1) 2015: 129-155 - [i8]Aurore Guillevic:
Computing Individual Discrete Logarithms Faster in GF(p^n). CoRR abs/1505.07553 (2015) - [i7]Aurore Guillevic:
Computing Individual Discrete Logarithms Faster in GF(pn). IACR Cryptol. ePrint Arch. 2015: 513 (2015) - 2014
- [c6]Aurore Guillevic, Damien Vergnaud:
Algorithms for Outsourcing Pairing Computation. CARDIS 2014: 193-211 - [i6]Razvan Barbulescu, Pierrick Gaudry, Aurore Guillevic, François Morain:
Improvements to the number field sieve for non-prime finite fields. CoRR abs/1408.0718 (2014) - 2013
- [b1]Aurore Guillevic:
Arithmetic of pairings on algebraic curves for cryptography. (Étude de l'arithmétique des couplages sur les courbes algébriques pour la cryptographie). École Normale Supérieure, Paris, France, 2013 - [c5]Aurore Guillevic:
Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves. ACNS 2013: 357-372 - [c4]Aurore Guillevic, Sorina Ionica:
Four-Dimensional GLV via the Weil Restriction. ASIACRYPT (1) 2013: 79-96 - [i5]Aurore Guillevic:
Comparing the Pairing Efficiency over Composite-Order and Prime-Order Elliptic Curves. IACR Cryptol. ePrint Arch. 2013: 218 (2013) - [i4]Aurore Guillevic, Sorina Ionica:
Four dimensional GLV via the Weil restriction. IACR Cryptol. ePrint Arch. 2013: 311 (2013) - [i3]Renaud Dubois, Margaux Dugardin, Aurore Guillevic:
Golden Sequence for the PPSS Broadcast Encryption Scheme with an Asymmetric Pairing. IACR Cryptol. ePrint Arch. 2013: 477 (2013) - 2012
- [c3]Renaud Dubois, Aurore Guillevic, Marine Sengelin Le Breton:
Improved Broadcast Encryption Scheme with Constant-Size Ciphertext. Pairing 2012: 196-202 - [c2]Aurore Guillevic, Damien Vergnaud:
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions. Pairing 2012: 234-253 - [i2]Renaud Dubois, Aurore Guillevic, Marine Sengelin Le Breton:
Improved Broadcast Encryption Scheme with Constant-Size Ciphertext. IACR Cryptol. ePrint Arch. 2012: 370 (2012) - 2011
- [c1]Nadia El Mrabet, Aurore Guillevic, Sorina Ionica:
Efficient Multiplication in Finite Field Extensions of Degree 5. AFRICACRYPT 2011: 188-205 - [i1]Aurore Guillevic, Damien Vergnaud:
Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions. IACR Cryptol. ePrint Arch. 2011: 604 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
