Arithmetic of Finite Fields is a computational framework in computational number theory that systematically governs the implementation of algebraic operations—such as addition, multiplication, inversion, and exponentiation—within finite fields, distinguishing itself by enabling precise algorithmic manipulation of field elements represented via prime or polynomial bases for cryptographic, coding-theoretic, and algorithmic applications.
1.3K
Publications
49.3K
Citations
1.7K
Authors
725
Institutions
Publications per year
2017–2026
134
Parents
Publications
1.3K
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Quantum · 2021 · 660 citations · Full text
Computing, Computer Science, Physics +17
1–5 of 1.3K
Authors
1.7K
- MH
21
h-index
- JV
14
h-index
- HN
14
h-index
- IE
13
h-index
- AR
13
h-index
1–5 of 1.7K
Institutions
725
University of Waterloo
Waterloo, Canada
29 h-index
83 publications
4.1K citations
Centre National de la Recherche Scientifique
Paris, France
20 h-index
53 publications
2K citations
University of Toronto
Toronto, Canada
15 h-index
21 publications
903 citations
University of Southern California
Los Angeles, United States
15 h-index
24 publications
1.6K citations
Tsinghua University
Beijing, China
14 h-index
35 publications
927 citations
Carleton University
Ottawa, Canada
14 h-index
25 publications
641 citations
University of South Florida
Tampa, United States
14 h-index
26 publications
984 citations
Chinese Academy of Sciences
Beijing, China
13 h-index
22 publications
737 citations
1–8 of 725
Venues
- IEEE Transactions on Computers
86 publications · 5K citations
42
h-index
- IEEE Transactions on Information Theory
47 publications · 2.9K citations
28
h-index
- Mathematics of Computation
MCOM · 60 publications · 2.7K citations
27
h-index
- Finite Fields and Their Applications
69 publications · 2.3K citations
26
h-index
- Acta Arithmetica
27 publications · 877 citations
18
h-index
1–5