default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca De Feo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]Luca De Feo
, Tako Boris Fouotsa, Lorenz Panny:
Isogeny Problems with Level Structure. EUROCRYPT (6) 2024: 181-204- [i29]Luca De Feo, Tako Boris Fouotsa, Lorenz Panny:
Isogeny problems with level structure. IACR Cryptol. ePrint Arch. 2024: 459 (2024) - [i28]Andrea Basso, Luca De Feo, Pierrick Dartois, Antonin Leroux, Luciano Maino, Giacomo Pope, Damien Robert, Benjamin Wesolowski:
SQIsign2D-West: The Fast, the Small, and the Safer. IACR Cryptol. ePrint Arch. 2024: 760 (2024) - 2023
- [j13]Luca De Feo, Bertram Poettering, Alessandro Sorniotti:
On the (In)Security of ElGamal in OpenPGP. Commun. ACM 66(6): 107-115 (2023) - [j12]Ward Beullens, Luca De Feo, Steven D. Galbraith, Christophe Petit:
Proving knowledge of isogenies: a survey. Des. Codes Cryptogr. 91(11): 3425-3456 (2023) - [c22]Andrea Basso, Giulio Codogni, Deirdre Connolly, Luca De Feo, Tako Boris Fouotsa, Guido Maria Lido, Travis Morrison, Lorenz Panny, Sikhar Patranabis, Benjamin Wesolowski:
Supersingular Curves You Can Trust. EUROCRYPT (2) 2023: 405-437 - [c21]Luca De Feo, Antonin Leroux, Patrick Longa, Benjamin Wesolowski:
New Algorithms for the Deuring Correspondence - Towards Practical and Secure SQISign Signatures. EUROCRYPT (5) 2023: 659-690 - [c20]Luca De Feo, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, Simon-Philipp Merz, Lorenz Panny, Benjamin Wesolowski:
SCALLOP: Scaling the CSI-FiSh. Public Key Cryptography (1) 2023: 345-375 - [e1]Nadia El Mrabet, Luca De Feo, Sylvain Duquesne:
Progress in Cryptology - AFRICACRYPT 2023 - 14th International Conference on Cryptology in Africa, Sousse, Tunisia, July 19-21, 2023, Proceedings. Lecture Notes in Computer Science 14064, Springer 2023, ISBN 978-3-031-37678-8 [contents] - [i27]Luca De Feo, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, Simon-Philipp Merz, Lorenz Panny, Benjamin Wesolowski:
SCALLOP: scaling the CSI-FiSh. IACR Cryptol. ePrint Arch. 2023: 58 (2023) - [i26]Ward Beullens, Luca De Feo, Steven D. Galbraith, Christophe Petit:
Proving knowledge of isogenies - A survey. IACR Cryptol. ePrint Arch. 2023: 671 (2023) - 2022
- [j11]Luca De Feo, Nadia El Mrabet, Aymeric Genêt, Novak Kaluderovic, Natacha Linard de Guertechin, Simon Pontié, Élise Tasso:
SIKE Channels Zero-Value Side-Channel Attacks on SIKE. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(3): 264-289 (2022) - [c19]Luca De Feo, Samuel Dobson, Steven D. Galbraith, Lukas Zobernig:
SIDH Proof of Knowledge. ASIACRYPT (2) 2022: 310-339 - [c18]Pierrick Dartois, Luca De Feo:
On the Security of OSIDH. Public Key Cryptography (1) 2022: 52-81 - [i25]Luca De Feo, Nadia El Mrabet, Aymeric Genêt, Novak Kaluderovic, Natacha Linard de Guertechin, Simon Pontié, Élise Tasso:
SIKE Channels. IACR Cryptol. ePrint Arch. 2022: 54 (2022) - [i24]Luca De Feo, Antonin Leroux, Benjamin Wesolowski:
New algorithms for the Deuring correspondence: SQISign twice as fast. IACR Cryptol. ePrint Arch. 2022: 234 (2022) - [i23]Andrea Basso, Giulio Codogni, Deirdre Connolly, Luca De Feo, Tako Boris Fouotsa, Guido Maria Lido, Travis Morrison, Lorenz Panny, Sikhar Patranabis, Benjamin Wesolowski:
Supersingular Curves You Can Trust. IACR Cryptol. ePrint Arch. 2022: 1469 (2022) - 2021
- [c17]Luca De Feo, Cyprien Delpech de Saint Guilhem, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, Christophe Petit, Javier Silva, Benjamin Wesolowski:
Séta: Supersingular Encryption from Torsion Attacks. ASIACRYPT (4) 2021: 249-278 - [c16]Luca De Feo, Bertram Poettering, Alessandro Sorniotti:
On the (In)Security of ElGamal in OpenPGP. CCS 2021: 2066-2080 - [c15]Élise Tasso, Luca De Feo, Nadia El Mrabet, Simon Pontié:
Resistance of Isogeny-Based Cryptographic Implementations to a Fault Attack. COSADE 2021: 255-276 - [c14]Jeffrey Burdges, Luca De Feo:
Delay Encryption. EUROCRYPT (1) 2021: 302-326 - [i22]Élise Tasso, Luca De Feo, Nadia El Mrabet, Simon Pontié:
Resistance of Isogeny-Based Cryptographic Implementations to a Fault Attack. IACR Cryptol. ePrint Arch. 2021: 850 (2021) - [i21]Luca De Feo, Bertram Poettering, Alessandro Sorniotti:
On the (in)security of ElGamal in OpenPGP. IACR Cryptol. ePrint Arch. 2021: 923 (2021) - [i20]Luca De Feo, Samuel Dobson, Steven D. Galbraith, Lukas Zobernig:
SIDH Proof of Knowledge. IACR Cryptol. ePrint Arch. 2021: 1023 (2021) - [i19]Pierrick Dartois, Luca De Feo:
On the security of OSIDH. IACR Cryptol. ePrint Arch. 2021: 1681 (2021) - 2020
- [c13]Luca De Feo, David Kohel, Antonin Leroux, Christophe Petit, Benjamin Wesolowski:
SQISign: Compact Post-quantum Signatures from Quaternions and Isogenies. ASIACRYPT (1) 2020: 64-93 - [c12]Navid Alamati, Luca De Feo, Hart Montgomery, Sikhar Patranabis:
Cryptographic Group Actions and Applications. ASIACRYPT (2) 2020: 411-439 - [c11]Luca De Feo, Michael Meyer:
Threshold Schemes from Isogeny Assumptions. Public Key Cryptography (2) 2020: 187-212 - [i18]Daniel J. Bernstein, Luca De Feo, Antonin Leroux, Benjamin Smith:
Faster computation of isogenies of large prime degree. CoRR abs/2003.10118 (2020) - [i17]Daniel J. Bernstein, Luca De Feo, Antonin Leroux, Benjamin Smith:
Faster computation of isogenies of large prime degree. IACR Cryptol. ePrint Arch. 2020: 341 (2020) - [i16]Jeffrey Burdges, Luca De Feo:
Delay Encryption. IACR Cryptol. ePrint Arch. 2020: 638 (2020) - [i15]Navid Alamati, Luca De Feo, Hart Montgomery, Sikhar Patranabis:
Cryptographic Group Actions and Applications. IACR Cryptol. ePrint Arch. 2020: 1188 (2020) - [i14]Luca De Feo, David Kohel, Antonin Leroux, Christophe Petit, Benjamin Wesolowski:
SQISign: compact post-quantum signatures from quaternions and isogenies. IACR Cryptol. ePrint Arch. 2020: 1240 (2020)
2010 – 2019
- 2019
- [j10]Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. Math. Comput. 88(317): 1391-1426 (2019) - [c10]Luca De Feo, Simon Masson, Christophe Petit, Antonio Sanso:
Verifiable Delay Functions from Supersingular Isogenies and Pairings. ASIACRYPT (1) 2019: 248-277 - [c9]Luca De Feo, Steven D. Galbraith:
SeaSign: Compact Isogeny Signatures from Class Group Actions. EUROCRYPT (3) 2019: 759-789 - [c8]Luca De Feo, Hugues Randriam, Édouard Rousseau:
Standard Lattices of Compatibly Embedded Finite Fields. ISSAC 2019: 122-130 - [c7]Daniel Cervantes-Vázquez, Mathilde Chenu, Jesús-Javier Chi-Domínguez, Luca De Feo, Francisco Rodríguez-Henríquez, Benjamin Smith:
Stronger and Faster Side-Channel Protections for CSIDH. LATINCRYPT 2019: 173-193 - [i13]Luca De Feo, Hugues Randriam, Édouard Rousseau:
Standard Lattices of Compatibly Embedded Finite Fields. CoRR abs/1906.00870 (2019) - [i12]Daniel Cervantes-Vázquez, Mathilde Chenu, Jesús-Javier Chi-Domínguez, Luca De Feo, Francisco Rodríguez-Henríquez, Benjamin Smith:
Stronger and Faster Side-Channel Protections for CSIDH. CoRR abs/1907.08704 (2019) - [i11]Luca De Feo, Simon Masson, Christophe Petit, Antonio Sanso:
Verifiable Delay Functions from Supersingular Isogenies and Pairings. IACR Cryptol. ePrint Arch. 2019: 166 (2019) - [i10]Daniel Cervantes-Vázquez, Mathilde Chenu, Jesús-Javier Chi-Domínguez, Luca De Feo, Francisco Rodríguez-Henríquez, Benjamin Smith:
Stronger and Faster Side-Channel Protections for CSIDH. IACR Cryptol. ePrint Arch. 2019: 837 (2019) - [i9]Luca De Feo, Michael Meyer:
Threshold Schemes from Isogeny Assumptions. IACR Cryptol. ePrint Arch. 2019: 1288 (2019) - 2018
- [j9]Luca De Feo, Hugues Randriambololona, Édouard Rousseau:
Lattices of compatibly embedded finite fields in nemo/flint. ACM Commun. Comput. Algebra 52(2): 38-41 (2018) - [j8]Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. ACM Commun. Comput. Algebra 52(4): 117-119 (2018) - [j7]Jean Kieffer, Luca De Feo:
Isogeny-based cryptography in Julia/Nemo: a case study. ACM Commun. Comput. Algebra 52(4): 130-132 (2018) - [c6]Luca De Feo, Jean Kieffer, Benjamin Smith:
Towards Practical Key Exchange from Ordinary Isogeny Graphs. ASIACRYPT (3) 2018: 365-394 - [i8]Luca De Feo, Jean Kieffer, Benjamin Smith:
Towards practical key exchange from ordinary isogeny graphs. CoRR abs/1809.07543 (2018) - [i7]Luca De Feo, Jean Kieffer, Benjamin Smith:
Towards practical key exchange from ordinary isogeny graphs. IACR Cryptol. ePrint Arch. 2018: 485 (2018) - [i6]Luca De Feo, Steven D. Galbraith:
SeaSign: Compact isogeny signatures from class group actions. IACR Cryptol. ePrint Arch. 2018: 824 (2018) - 2017
- [c5]Michael Kohlhase, Luca De Feo, Dennis Müller, Markus Pfeiffer, Florian Rabe, Nicolas M. Thiéry, Victor Vasilyev, Tom Wiesing:
Knowledge-Based Interoperability for Mathematical Software Systems. MACIS 2017: 195-210 - [i5]Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori, Éric Schost:
Computing isomorphisms and embeddings of finite fields. CoRR abs/1705.01221 (2017) - [i4]Luca De Feo:
Mathematics of Isogeny Based Cryptography. CoRR abs/1711.04062 (2017) - 2016
- [j6]Luca De Feo, Cyril Hugounenq, Jérôme Plût, Éric Schost:
Explicit isogenies in quadratic time in any characteristic. LMS J. Comput. Math. 19(A): 267-282 (2016) - 2015
- [j5]Luca De Feo, Christophe Petit, Michaël Quisquater:
Deterministic root finding in finite fields. ACM Commun. Comput. Algebra 49(3): 87-89 (2015) - 2014
- [j4]Luca De Feo, David Jao, Jérôme Plût:
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. J. Math. Cryptol. 8(3): 209-247 (2014) - [c4]Luca De Feo, Javad Doliskani, Éric Schost:
Fast arithmetic for the algebraic closure of finite fields. ISSAC 2014: 122-129 - 2013
- [c3]Luca De Feo, Javad Doliskani, Éric Schost:
Fast algorithms for l-adic towers over finite fields. ISSAC 2013: 165-172 - [i3]Luca De Feo, Javad Doliskani, Éric Schost:
Fast algorithms for ell-adic towers over finite fields. CoRR abs/1301.6021 (2013) - 2012
- [j3]Luca De Feo, Éric Schost:
Fast arithmetics in Artin-Schreier towers over finite fields. J. Symb. Comput. 47(7): 771-792 (2012) - 2011
- [c2]David Jao, Luca De Feo:
Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies. PQCrypto 2011: 19-34 - [i2]David Jao, Luca De Feo:
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. IACR Cryptol. ePrint Arch. 2011: 506 (2011) - 2010
- [b1]Luca De Feo:
Fast Algorithms for Towers of Finite Fields and Isogenies. (Algorithmes Rapides pour les Tours de Corps Finis et les Isogénies). École Polytechnique, Palaiseau, France, 2010 - [j2]Luca De Feo, Éric Schost:
transalpyne: a language for automatic transposition. ACM Commun. Comput. Algebra 44(1/2): 59-71 (2010) - [j1]Luca De Feo, Éric Schost:
transalpyne: a language for automatic transposition. ACM Commun. Comput. Algebra 44(3/4): 105-106 (2010) - [i1]Luca De Feo, Éric Schost:
Fast Arithmetics in Artin-Schreier Towers over Finite Fields. CoRR abs/1002.2594 (2010)
2000 – 2009
- 2009
- [c1]Luca De Feo, Éric Schost:
Fast arithmetics in artin-schreier towers over finite fields. ISSAC 2009: 127-134
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 2024-10-07 21:19 CEST 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:
