Luca De Feo

2.2k total citations
11 papers, 152 citations indexed

About

Luca De Feo is a scholar working on Artificial Intelligence, Information Systems and Geometry and Topology. According to data from OpenAlex, Luca De Feo has authored 11 papers receiving a total of 152 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Artificial Intelligence, 7 papers in Information Systems and 2 papers in Geometry and Topology. Recurrent topics in Luca De Feo's work include Cryptography and Residue Arithmetic (7 papers), Coding theory and cryptography (6 papers) and Cryptographic Implementations and Security (4 papers). Luca De Feo is often cited by papers focused on Cryptography and Residue Arithmetic (7 papers), Coding theory and cryptography (6 papers) and Cryptographic Implementations and Security (4 papers). Luca De Feo collaborates with scholars based in France, Switzerland and Canada. Luca De Feo's co-authors include Jérôme Plût, David Jao, Antonin Leroux, Benjamin Smith, Éric Schost, Nadia El Mrabet, Bertram Poettering, Alessandro Sorniotti, Ward Beullens and Christophe Petit and has published in prestigious journals such as Communications of the ACM, Mathematics of Computation and Designs Codes and Cryptography.

In The Last Decade

Luca De Feo

8 papers receiving 147 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Luca De Feo France	4	120	97	32	21	17	11	152
Jérôme Plût Burundi	1	104 0.9×	86 0.9×	31 1.0×	18 0.9×	12 0.7×	2	130
Christophe Petit Belgium	6	97 0.8×	35 0.4×	29 0.9×	18 0.9×	14 0.8×	23	122
Reza Rezaeian Farashahi Iran	9	183 1.5×	137 1.4×	56 1.8×	16 0.8×	26 1.5×	19	212
Robert Zuccherato Canada	7	109 0.9×	95 1.0×	29 0.9×	25 1.2×	13 0.8×	11	130
Thorsten Kleinjung Switzerland	7	93 0.8×	76 0.8×	13 0.4×	11 0.5×	19 1.1×	18	116
Mehdi Tibouchi Japan	8	168 1.4×	74 0.8×	43 1.3×	5 0.2×	27 1.6×	37	191
Thomas Plantard Australia	9	179 1.5×	161 1.7×	40 1.3×	5 0.2×	19 1.1×	32	206
Stanislav Bulygin Germany	8	104 0.9×	19 0.2×	41 1.3×	19 0.9×	36 2.1×	18	140
Khoa Nguyen Singapore	7	91 0.8×	41 0.4×	22 0.7×	9 0.4×	21 1.2×	22	113
Sylvain Duquesne France	7	127 1.1×	114 1.2×	10 0.3×	28 1.3×	16 0.9×	18	166

Countries citing papers authored by Luca De Feo

Since Specialization

Citations

This map shows the geographic impact of Luca De Feo's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Luca De Feo with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Luca De Feo more than expected).

Fields of papers citing papers by Luca De Feo

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Luca De Feo. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Luca De Feo. The network helps show where Luca De Feo may publish in the future.

Co-authorship network of co-authors of Luca De Feo

This figure shows the co-authorship network connecting the top 25 collaborators of Luca De Feo. A scholar is included among the top collaborators of Luca De Feo based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Luca De Feo. Luca De Feo is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

11 of 11 papers shown

1.

Beullens, Ward, Luca De Feo, Steven D. Galbraith⋆, & Christophe Petit. (2023). Proving knowledge of isogenies: a survey. Designs Codes and Cryptography. 91(11). 3425–3456.

2.

Feo, Luca De, Bertram Poettering, & Alessandro Sorniotti. (2023). On the (In)Security of ElGamal in OpenPGP. Communications of the ACM. 66(6). 107–115.

3.

Feo, Luca De, et al.. (2022). SIKE Channels. IACR Transactions on Cryptographic Hardware and Embedded Systems. 264–289. 4 indexed citations

4.

Feo, Luca De, Bertram Poettering, & Alessandro Sorniotti. (2021). On the (In)Security of ElGamal in OpenPGP. 2066–2080. 2 indexed citations

5.

Feo, Luca De, et al.. (2020). Faster computation of isogenies of large prime degree. arXiv (Cornell University). 4(1). 39–55. 9 indexed citations

6.

Feo, Luca De, et al.. (2019). Computing isomorphisms and embeddings of finite fields. ACM communications in computer algebra. 52(4). 117–119.

7.

Feo, Luca De, et al.. (2018). Computing isomorphisms and embeddings of finite fields. Mathematics of Computation. 88(317). 1391–1426. 1 indexed citations

8.

Feo, Luca De, David Jao, & Jérôme Plût. (2014). Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. Journal of Mathematical Cryptology. 8(3). 209–247. 130 indexed citations

9.

Feo, Luca De & Éric Schost. (2011). Fast arithmetics in Artin–Schreier towers over finite fields. Journal of Symbolic Computation. 47(7). 771–792. 3 indexed citations

10.

Feo, Luca De & Éric Schost. (2010). transalpyne. ACM communications in computer algebra. 44(1/2). 59–71. 1 indexed citations

11.

Feo, Luca De. (2010). Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic. Journal of Number Theory. 131(5). 873–893. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact