Pascal Véron

462 total citations
16 papers, 116 citations indexed

About

Pascal Véron is a scholar working on Artificial Intelligence, Information Systems and Electrical and Electronic Engineering. According to data from OpenAlex, Pascal Véron has authored 16 papers receiving a total of 116 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Artificial Intelligence, 6 papers in Information Systems and 5 papers in Electrical and Electronic Engineering. Recurrent topics in Pascal Véron's work include Coding theory and cryptography (11 papers), Cryptography and Residue Arithmetic (6 papers) and Cryptography and Data Security (5 papers). Pascal Véron is often cited by papers focused on Coding theory and cryptography (11 papers), Cryptography and Residue Arithmetic (6 papers) and Cryptography and Data Security (5 papers). Pascal Véron collaborates with scholars based in France, Luxembourg and Germany. Pascal Véron's co-authors include Laurent-Stéphane Didier, Pierre-Louis Cayrel, Özgür Dagdelen, David Galindo, Philippe Langevin, Jean–Marc Robert, Nadia El Mrabet, Jean-Claude Bajard and Thomas Plantard and has published in prestigious journals such as Nature, IEEE Transactions on Information Theory and Lecture notes in computer science.

In The Last Decade

Pascal Véron

14 papers receiving 109 citations

Peers

Pascal Véron

AI

EEE

CTM

CNC

IS

Ludovic Perret France

Iris Anshel United States

Constanza Riera Norway

Jaume Martí-Farré Spain

Marion Videau France

Jens Zumbrägel Germany

M.J. Coster Netherlands

Christophe Petit Belgium

Avraham Ben-Aroya Israel

David Kohel Australia

Ludovic Perret France

Pascal Véron

101 ×1.0

AI

32 ×0.9

EEE

51 ×2.1

CTM

10 ×0.6

CNC

29 ×1.7

IS

Citations per year, relative to Pascal Véron Pascal Véron (= 1×) peers Ludovic Perret

Countries citing papers authored by Pascal Véron

Since Specialization

Citations

This map shows the geographic impact of Pascal Véron'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 Pascal Véron with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pascal Véron more than expected).

Fields of papers citing papers by Pascal Véron

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Pascal Véron. 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 Pascal Véron. The network helps show where Pascal Véron may publish in the future.

Co-authorship network of co-authors of Pascal Véron

This figure shows the co-authorship network connecting the top 25 collaborators of Pascal Véron. A scholar is included among the top collaborators of Pascal Véron 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 Pascal Véron. Pascal Véron 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:

16 of 16 papers shown

1.

Mrabet, Nadia El, et al.. (2023). Montgomery Multiplication Scalable Systolic Designs Optimized for DSP48E2. ACM Transactions on Reconfigurable Technology and Systems. 17(1). 1–31. 3 indexed citations

2.

Véron, Pascal, et al.. (2023). PMNS for cryptography: A guided tour. Advances in Mathematics of Communications. 18(2). 342–359.

3.

Bajard, Jean-Claude, et al.. (2022). On Polynomial Modular Number Systems over $ \mathbb{Z}/{p}\mathbb{Z} $. Advances in Mathematics of Communications. 18(3). 674–695. 2 indexed citations

4.

Robert, Jean–Marc & Pascal Véron. (2022). Faster multiplication over $${\mathbb {F}}_2[X]$$ using AVX512 instruction set and VPCLMULQDQ instruction. Journal of Cryptographic Engineering. 13(1). 37–55. 2 indexed citations

5.

Robert, Jean–Marc, et al.. (2022). PMNS for efficient arithmetic and small memory cost. 84–84. 1 indexed citations

6.

Robert, Jean–Marc, et al.. (2022). PMNS for Efficient Arithmetic and Small Memory Cost. IEEE Transactions on Emerging Topics in Computing. 10(3). 1263–1277.

7.

Didier, Laurent-Stéphane, et al.. (2020). Efficient modular operations using the adapted modular number system. Journal of Cryptographic Engineering. 10(2). 111–133. 10 indexed citations

8.

Dagdelen, Özgür, et al.. (2014). Extended security arguments for signature schemes. Designs Codes and Cryptography. 78(2). 441–461. 10 indexed citations

9.

Dagdelen, Özgür, et al.. (2012). Extended Security Arguments for Signature Schemes. Lecture notes in computer science. 19–34. 5 indexed citations

10.

Langevin, Philippe & Pascal Véron. (2005). On the Non-linearity of Power Functions. Designs Codes and Cryptography. 37(1). 31–43. 4 indexed citations

11.

Véron, Pascal. (2005). Proof of Conjectures on the True Dimension of Some Binary Goppa Codes. Designs Codes and Cryptography. 36(3). 317–325. 7 indexed citations

12.

Véron, Pascal. (2002). A fast identification scheme. 359–359. 2 indexed citations

13.

Véron, Pascal. (2001). True Dimension of Some Binary Quadratic Trace Goppa Codes. Designs Codes and Cryptography. 24(1). 81–97. 7 indexed citations

14.

Véron, Pascal. (1998). Goppa codes and trace operator. IEEE Transactions on Information Theory. 44(1). 290–294. 11 indexed citations

15.

Véron, Pascal. (1997). Improved identification schemes based on error-correcting codes. Applicable Algebra in Engineering Communication and Computing. 8(1). 57–69. 41 indexed citations

16.

Véron, Pascal. (1966). Counts of Radiosources in the Revised 3 C Catalogue. Nature. 211(5050). 724–725. 11 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