What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algebra
- Discrete mathematics
Igor E. Shparlinski mainly investigates Discrete mathematics, Combinatorics, Finite field, Pseudorandom number generator and Modulo.
His Discrete mathematics research includes themes of Elliptic curve, Polynomial and Discrete logarithm.
His work focuses on many connections between Combinatorics and other disciplines, such as Upper and lower bounds, that overlap with his field of interest in Algorithm.
His Finite field study integrates concerns from other disciplines, such as Multiplicative function, Multiplicative order, Element and Primitive element theorem.
Igor E. Shparlinski has researched Pseudorandom number generator in several fields, including Linear congruential generator, Inversive and Distribution.
His work in Modulo addresses subjects such as Character sum, which are connected to disciplines such as Congruence relation.
His most cited work include:
- The insecurity of the digital signature algorithm with partially known nonces (173 citations)
- Character Sums with Exponential Functions and their Applications (167 citations)
- The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces (134 citations)
What are the main themes of his work throughout his whole career to date?
Igor E. Shparlinski spends much of his time researching Combinatorics, Discrete mathematics, Finite field, Prime and Modulo.
He works mostly in the field of Combinatorics, limiting it down to concerns involving Exponential function and, occasionally, Number theory.
His research in Discrete mathematics intersects with topics in Pseudorandom number generator, Asymptotic formula, Distribution, Function and Polynomial.
His work carried out in the field of Finite field brings together such families of science as Degree and Elliptic curve, Pure mathematics, Rational function.
His study brings together the fields of Sequence and Prime.
His study in Modulo is interdisciplinary in nature, drawing from both Riemann hypothesis and Congruence relation.
He most often published in these fields:
- Combinatorics (50.05%)
- Discrete mathematics (42.66%)
- Finite field (28.97%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (50.05%)
- Pure mathematics (16.58%)
- Finite field (28.97%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Combinatorics, Pure mathematics, Finite field, Prime and Modulo.
Combinatorics is closely attributed to Upper and lower bounds in his work.
His Pure mathematics research incorporates themes from Multiplicative function, Series and Distribution.
Igor E. Shparlinski has included themes like Quadratic equation and Sequence in his Finite field study.
Igor E. Shparlinski interconnects Discrete mathematics, Prime number, Integer sequence and Exponential function in the investigation of issues within Prime.
Igor E. Shparlinski applies his multidisciplinary studies on Discrete mathematics and Root of unity in his research.
Between 2016 and 2021, his most popular works were:
- Prescribing the binary digits of squarefree numbers and quadratic residues (16 citations)
- Divisor problem in arithmetic progressions modulo a prime power (15 citations)
- New bounds of Weyl sums (14 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Real number
The scientist’s investigation covers issues in Combinatorics, Pure mathematics, Finite field, Prime and Upper and lower bounds.
His Combinatorics research is multidisciplinary, relying on both Arithmetic function and Sequence.
His Pure mathematics research integrates issues from Multiplicative function, Algebraic number and Distribution.
His research integrates issues of Graph, Multiplicative order, Polynomial interpolation, Partition and Connected component in his study of Finite field.
His work deals with themes such as Discrete mathematics, Quadratic residue, Square-free integer, Quadratic equation and Exponential function, which intersect with Prime.
In his articles, Igor E. Shparlinski combines various disciplines, including Discrete mathematics and Quantum algorithm.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
