- Polynomial Representations of the Di#eHellman Mapping
- Security of Most Significant Bits of g x 2 Igor E. Shparlinski
- On Singularity of Generalized Vandermonde Matrices over Finite Fields
- ON THE DISTRIBUTION OF DIFFIE--HELLMAN TRIPLES WITH SPARSE EXPONENTS
- Exponential Sums and Lattice Reduction: Applications to Cryptography
- Catalan and Apery Numbers in Residue Moubariz Z. Garaev
- Nonapproximability of the Permanent of Structured Matrices over Finite Fields
- ON A NEW EXPONENTIAL SUM Daniel Lieman #
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- On the Uniformity of Distribution of the Elliptic Curve ElGamal Signature
- Circuit Complexity of Testing SquareFree Anna Bernasconi 1 and Igor Shparlinski 2
- On the Security of Di#e--Hellman Bits Maria Isabel Gonzalez Vasco and Igor E. Shparlinski
- The Insecurity of Nyberg--Rueppel and Other DSALike Signature Schemes
- ON THE CORRELATION OF BINARY MSEQUENCES
- ON THE DISTRIBUTION OF THE DIFFIE--HELLMAN PAIRS
- MATHEMATICS OF COMPUTATION Volume 00, Number 0, Xxxx XXXX, Pages 000--000
- MATHEMATICS OF COMPUTATION Volume 00, Number 0, Xxxx XXXX, Pages 000--000
- MATHEMATICS OF COMPUTATION Volume 00, Number 0, Xxxx XXXX, Pages 000--000
- On the Generalised Hidden Number Problem and Bit Security of XTR
- ON SOME PROPERTIES OF THE SHRINKING GENERATOR
- Short Kloosterman Sums for Polynomials over Finite Fields #
- Linear Complexity of the Naor--Reingold Pseudorandom Function
- Playing ``HideandSeek'' in Finite Fields: The Hidden Number Problem and Its
- Chinese Remaindering for Algebraic Numbers in a Hidden Field
- COMPUTING COMPONENTS AND PROJECTIONS OF CURVES OVER FINITE
- MATHEMATICS OF COMPUTATION Volume 00, Number 0, Xxxx XXXX, Pages 000--000
- ON VALUES TAKEN BY THE LARGEST PRIME FACTOR OF SHIFTED PRIMES
- Character Sums over Integers with Restricted gary Digits #
- ON EXPONENTIAL SUMS WITH SPARSE POLYNOMIALS AND RATIONAL FUNCTIONS
- ON THE MULTIPLICATIVE ORDERS OF # AND # + # -1 OVER FINITE FIELDS
- ON THE STATISTICAL PROPERTIES OF DIFFIE--HELLMAN
- NONLINEAR COMPLEXITY OF THE NAOR--REINGOLD PSEUDORANDOM
- CircuitandDecisionTreeComplexity ofSome Number TheoreticProblems
- THE CREW PRAM COMPLEXITY OF MODULAR INVERSION JOACHIM VON ZUR GATHEN # AND IGOR E. SHPARLINSKI +
- Noisy Chinese Remaindering in the Lee Norm Igor E. Shparlinski
- ON THE DISTRIBUTION OF NORMAL BASES OF NUMBER FIELDS
- On the Uniformity of Distribution of Congruential Generators over Elliptic Curves
- On the Unpredictability of Bits of the Elliptic Curve Di#e--Hellman Scheme
- IEEE TRANSACTIONS ON INFORMATION THEORY 1 On the Linear and Nonlinear Complexity Profile of
- Sparse Polynomial Approximation in Finite Fields Igor E. Shparlinski #
- On the Uniformity of Distribution of the ElGamal Signature
- Average Normalisations of Elliptic Curves
- On the Bit Security of NTRUEncrypt Mats Naslund 1 , Igor E. Shparlinski 2 , and William Whyte 3
- Distribution of Harmonic Sums and Bernoulli Polynomials Modulo a Prime
- Exponential Sums with Catalan Numbers Moubariz Z. Garaev
- Estimates for Wieferich Numbers William D. Banks
- COMMUNICATION COMPLEXITY AND FOURIER COEFFICIENTS OF THE
- MATHEMATICS OF COMPUTATION Volume 00, Number 0, Xxxx XXXX, Pages 000--000
- A Variant of NTRU with NonInvertible Polynomials
- Prime Divisors of Sparse Integers Igor E. Shparlinski
- ON THE UNIFORMITY OF DISTRIBUTION OF THE
- COMPUTATIONAL ALGEBRA AND NUMBER THEORY,
- Exponential Function Analogue of Kloosterman Sums
- On Polynomial Representations of Boolean Functions Related to Some Number Theoretic
- Linear Complexity of the Discrete Logarithm Sergei Konyagin
- A PUBLIC KEY CRYPTOSYSTEM BASED ON SPARSE POLYNOMIALS
- OPEN PROBLEMS AND CONJECTURES IN FINITE FIELDS
- Unconditional Proof of Tightness of Johnson Bound Venkatesan Guruswami # Igor Shparlinski +
- On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields
- Security of Polynomial Transformations of the Di#e--Hellman Key
- Illinois Journal of Mathematics Volume 48, Number 3, Fall 2004, Pages 10411052
- Gau Periods in Finite Fields Joachim von zur Gathen 1 and Igor Shparlinski 2
- On Some Uniformity of Distribution Properties of ESIGN
- APPROXIMATE CONSTRUCTIONS IN FINITE FIELDS
- CONSTRUCTING ELEMENTS OF LARGE ORDER IN FINITE FIELDS
- ON THE COMPUTATIONAL HARDNESS OF TESTING SQUAREFREENESS OF SPARSE
- AN EXTREMELY SMALL AND EFFICIENT IDENTIFICATION
- Distribution of Inverses in Polynomial Rings William D. Banks
- Smooth Orders and Cryptographic Applications Carl Pomerance 1 and Igor E. Shparlinski 2
- DOUBLE EXPONENTIAL SUMS OVER THIN SETS JOHN B. FRIEDLANDER AND IGOR E. SHPARLINSKI
- The Insecurity of the Digital Signature Algorithm with Partially Known Nonces
- Number Theoretic Designs for Directed Regular Graphs of Small Diameter
- A Lower Bound for Primality # Eric Allender +
- Selective Forgery of RSA Signatures with Fixedpattern Padding
- ON THE LINEAR COMPLEXITY OF THE NAOR--REINGOLD PSEUDORANDOM
- On the Linear Complexity of the Naor--Reingold Pseudorandom Function from
- The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known
- On the Nonlinearity of Linear Recurrence Igor E. Shparlinski
- ON THE SPECTRAL AM PROPERTY
- COMPUTING JACOBI SYMBOLS MODULO SPARSE INTEGERS AND
- CHARACTER SUMS WITH EXPONENTIAL FUNCTIONS
- ON THE LINEAR COMPLEXITY PROFILE OF THE POWER GENERATOR
- ON CERTAIN EXPONENTIAL SUMS AND THE DISTRIBUTION OF
- Some Doubly Exponential Sums over ZZ m John B. Friedlander #
- ORDERS OF GAUSS PERIODS IN FINITE FIELDS
- ON THE NAOR--REINGOLD PSEUDORANDOM FUNCTION FROM
- MATHEMATICS OF COMPUTATION Volume 00, Number 0, Xxxx XXXX, Pages 000--000
- The Average Sensitivity of SquareFreeness Anna Bernasconi
- The Hidden Number Problem in Extension and Its Applications
- COUNTING CURVES AND THEIR PROJECTIONS
- ON THE LINEAR COMPLEXITY OF THE POWER GENERATOR
- ON THE DISTRIBUTION OF THE RSA John B. Friedlander, 1 Daniel Lieman 2 and Igor E. Shparlinski 3
- Distribution of Modular Sums and the Security of the Server Aided Exponentiation
- FINDING POINTS ON CURVES OVER FINITE FIELDS
- Bounds of Gauss Sums in Finite Fields Igor E. Shparlinski
- On the Number of Sparse RSA Exponents William D. Banks
- Arithmetic Properties of Numbers with Restricted Digits
- Small Values of the Carmichael Function and Cryptographic Applications
- On the Insecurity of Some ServerAided RSA Protocol
- Average Multiplicative Orders of Elements Florian Luca and Igor E. Shparlinski
- On a Question of Erdos and Graham Igor E. Shparlinski
