Integer Root Extraction is a number-theoretic algorithmic method that computes the largest integer whose nth power is less than or equal to a given integer, distinguishing itself from general root-finding techniques by restricting solutions exclusively to integer domains and emphasizing exactness over approximation.
7
Publications
114
Citations
12
Authors
8
Institutions
Publications per year
2017–2026
0
Parents
Publications
7
Practical extension of Fiat-Shamir scheme
Kazuo Ohta, Tatsuaki Okamoto · Electronics Letters · 1988 · 22 citations
A Digit-by-Digit Algorithm for mth Root Extraction
Paolo Montuschi, J.D. Bruguera, L. Ciminiera et al. · IEEE Transactions on Computers · 2007 · 16 citations
Robert S. Lehman · Mathematics of Computation · 1974 · 15 citations · Full text
1–5 of 7
Authors
12
- TO
1
h-index
- LC
1
h-index
- GB
1
h-index
- MS
1
h-index
- AC
1
h-index
1–5 of 12
Institutions
8
Politecnico di Torino
Turin, Italy
1 h-index
3 publications
48 citations
Universidade de Santiago de Compostela
Santiago de Compostela, Spain
1 h-index
2 publications
32 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
1 h-index
1 publications
16 citations
Max Planck Society
Munich, Germany
1 h-index
1 publications
13 citations
Syracuse University
Syracuse, United States
1 h-index
1 publications
11 citations
Research Design And Standards Organization
Lucknow, India
1 h-index
1 publications
11 citations
NTT (Japan)
Tokyo, Japan
1 h-index
2 publications
44 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
1 h-index
1 publications
13 citations
1–8 of 8
Venues
- Linear Algebra and its Applications
2 publications · 22 citations
2
h-index
- Mathematics of Computation
MCOM · 1 publications · 15 citations
1
h-index
- IEEE Transactions on Computers
1 publications · 16 citations
1
h-index
- Electronics Letters
1 publications · 22 citations
1
h-index
- Mathematics in Computer Science
1 publications · 13 citations
1
h-index
1–5