The following pages link to Igor E. Shparlinski (Q240100):
Displaying 50 items.
- Residue classes modulo a prime number in an algebraic number field (Q1113940) (← links)
- On exponential sums with sparse polynomials and rational functions (Q1126370) (← links)
- Estimates of Gaussian sums (Q1177799) (← links)
- On the construction of solutions of systems of linear ordinary differential equations in the neighbourhood of a regular singularity (Q1186902) (← links)
- Distances from differences of roots of polynomials to the nearest integers (Q1199554) (← links)
- A deterministic test for permutation polynomials (Q1207336) (← links)
- Distribution of nonresidues and primitive roots in recurrent sequences (Q1258770) (← links)
- Number theoretic methods in cryptography. Complexity lower bounds (Q1276548) (← links)
- On the correlation of binary \(M\)-sequences (Q1299899) (← links)
- Finding irreducible and primitive polynomials (Q1311621) (← links)
- On parameters of some graphs from finite fields (Q1321682) (← links)
- On some approximation problems concerning sparse polynomials over finite fields (Q1351508) (← links)
- On finding primitive roots in finite fields (Q1351512) (← links)
- Orders of Gauss periods in finite fields (Q1389144) (← links)
- The insecurity of the elliptic curve digital signature algorithm with partially known nonces (Q1412249) (← links)
- Square-free values of the Carmichael function. (Q1415371) (← links)
- Security of polynomial transformations of the Diffie-Hellman key. (Q1418189) (← links)
- On the hardness of approximating the permanent of structured matrices (Q1430572) (← links)
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping. (Q1573770) (← links)
- Zero testing of \(p\)-adic and modular polynomials (Q1575936) (← links)
- On the Naor-Reingold pseudo-random function from elliptic curves (Q1583882) (← links)
- The average sensitivity of square-freeness (Q1590081) (← links)
- On the uniformity of distribution of the ElGamal signature (Q1598124) (← links)
- Distribution of inverses in polynomial rings (Q1605093) (← links)
- On the distribution of the Diffie-Hellman pairs (Q1609391) (← links)
- On the spectral Ádám property for circulant graphs (Q1613548) (← links)
- Elliptic curves in isogeny classes (Q1651976) (← links)
- On the exponential large sieve inequality for sparse sequences modulo primes (Q1684700) (← links)
- Divisor problem in arithmetic progressions modulo a prime power (Q1688638) (← links)
- Bilinear forms with exponential sums with binomials (Q1708076) (← links)
- Effective results on linear dependence for elliptic curves (Q1708453) (← links)
- Polynomial interpolation and identity testing from high powers over finite fields (Q1709581) (← links)
- Counting additive decompositions of quadratic residues in finite fields (Q1744826) (← links)
- Multiples of squares in short intervals (Q1744938) (← links)
- Constructing dominating sets in circulant graphs (Q1745909) (← links)
- Character sums with smooth numbers (Q1749379) (← links)
- Smooth values of shifted primes in arithmetic progressions (Q1766486) (← links)
- MOV attack in various subgroups on elliptic curves (Q1766871) (← links)
- Exponential function analogue of Kloosterman sums (Q1767357) (← links)
- Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves (Q1772239) (← links)
- On the singularity of generalised Vandermonde matrices over finite fields (Q1779326) (← links)
- Identity testing and interpolation from high powers of polynomials of large degree over finite fields (Q1791682) (← links)
- The Sato-Tate distribution in thin parametric families of elliptic curves (Q1794559) (← links)
- On distribution of values of recurrence sequences (Q1825901) (← links)
- Incomplete character sums and a special class of permutations (Q1826280) (← links)
- Classical and quantum function reconstruction via character evaluation (Q1827578) (← links)
- Noisy Chinese remaindering in the Lee norm (Q1827579) (← links)
- The insecurity of the digital signature algorithm with partially known nonces (Q1849602) (← links)
- Security of most significant bits of \(g^{x^{2}}\). (Q1853041) (← links)
- Circuit and decision tree complexity of some number theoretic problems (Q1854439) (← links)
