Igor E. Shparlinski

Finite Fields Their Appl., January, 2024

2023

Distribution of recursive matrix pseudorandom number generator modulo prime powers.

[BibT_eX]

[DOI]

Math. Comput., October, 2023

On oracle factoring of integers.

[BibT_eX]

[DOI]

Andrzej Dabrowski

Jacek Pomykala

J. Complex., June, 2023

Functional graphs of families of quadratic polynomials.

[BibT_eX]

[DOI]

Math. Comput., April, 2023

On the number of Diophantine m-tuples in finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2023

Fixed points of the subset sum pseudorandom number generators.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2023

Bohr sets generated by polynomials and Coppersmith's method in many variables.

[BibT_eX]

[DOI]

Riley Baird

Bryce Kerr

CoRR, 2023

On sets of linear forms of maximal complexity.

[BibT_eX]

[DOI]

Michael Kaminski

Michel Waldschmidt

Comput. Complex., 2023

2022

Multiplicative Properties of Hilbert Cubes.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Energy bounds, bilinear forms and their applications in function fields.

[BibT_eX]

[DOI]

Christian Bagshaw

Finite Fields Their Appl., 2022

2021

Exponential Sums with Sparse Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Qiang Wang

SIAM J. Discret. Math., 2021

Noisy polynomial interpolation modulo prime powers.

[BibT_eX]

[DOI]

J. Complex., 2021

Sets of Linear Forms Which Are Hard to Compute.

[BibT_eX]

[DOI]

Michael Kaminski

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Bounds of Trilinear and Trinomial Exponential Sums.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Distribution of short subsequences of inversive congruential pseudorandom numbers modulo 2t.

[BibT_eX]

[DOI]

Math. Comput., 2020

On the complexity of exact counting of dynamically irreducible polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2020

Geometric progressions in vector sumsets over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2020

2019

Double sums of Kloosterman sums in finite fields.

[BibT_eX]

[DOI]

Simon Macourt

Finite Fields Their Appl., 2019

On Functional Graphs of Quadratic Polynomials.

[BibT_eX]

[DOI]

Exp. Math., 2019

Codes correcting restricted errors.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2019

2018

On Constructing Primitive Roots in Finite Fields With Advice.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Identity testing and interpolation from high powers of polynomials of large degree over finite fields.

[BibT_eX]

[DOI]

J. Complex., 2018

Connected Components of the Graph Generated by Power Maps in Prime Finite Fields.

[BibT_eX]

[DOI]

Carl Pomerance

Integers, 2018

Arithmetic Properties of Integers in Chains and Reflections of g-ary Expansions.

[BibT_eX]

[DOI]

Exp. Math., 2018

Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields.

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

Power series approximations to Fekete polynomials.

[BibT_eX]

[DOI]

Jason P. Bell

J. Approx. Theory, 2017

An explicit polynomial analogue of Romanoff's theorem.

[BibT_eX]

[DOI]

Andreas J. Weingartner

Finite Fields Their Appl., 2017

Identity Testing from High Powers of Polynomials of Large Degree over Finite Fields.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Counting Co-Cyclic Lattices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

On Gauss sums and the evaluation of Stechkin's constant.

[BibT_eX]

[DOI]

Math. Comput., 2016

Functional graphs of polynomials over finite fields.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2016

On the additive energy of the distance set in finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2016

Counting irreducible binomials over finite fields.

[BibT_eX]

[DOI]

Randell Heyman

Finite Fields Their Appl., 2016

Ratios of Small Integers in Multiplicative Subgroups of Residue Rings.

[BibT_eX]

[DOI]

Exp. Math., 2016

On small gaps between the elements of multiplicative subgroups of finite fields.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2016

Dominating Sets in Circulant Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Optimal Quantum Algorithm for Polynomial Interpolation.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Cayley Graphs Generated by Small Degree Polynomials over Finite Fields.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Character sums and deterministic polynomial root finding in finite fields.

[BibT_eX]

[DOI]

Jean Bourgain

Sergei V. Konyagin

Math. Comput., 2015

On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average.

[BibT_eX]

[DOI]

Andrew V. Sutherland

LMS J. Comput. Math., 2015

Circulant graphs and GCD and LCM of subsets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Results on polynomial interpolation with mixed modular operations and unknown moduli.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Close values of shifted modular inversions and the decisional modular inversion hidden number problem.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2015

2014

Covering Sets for Limited-Magnitude Errors.

[BibT_eX]

[DOI]

Zhixiong Chen

IEEE Trans. Inf. Theory, 2014

Evasive properties of sparse graphs and some linear equations in primes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On shifted Eisenstein polynomials.

[BibT_eX]

[DOI]

Randell Heyman

Period. Math. Hung., 2014

On the Multidimensional Distribution of the Naor-Reingold Pseudo-Random Function.

[BibT_eX]

[DOI]

San Ling

Huaxiong Wang

Math. Comput., 2014

Algebraic entropy, automorphisms and sparsity of algebraic dynamical systems and pseudorandom number generators.

[BibT_eX]

[DOI]

Math. Comput., 2014

Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields.

[BibT_eX]

[DOI]

J. Symb. Comput., 2014

On the Distribution of Atkin and Elkies Primes.

[BibT_eX]

[DOI]

Andrew V. Sutherland

Found. Comput. Math., 2014

Interpolation and Approximation of Polynomials in Finite Fields over a Short Interval from Noisy Values.

[BibT_eX]

[DOI]

Exp. Math., 2014

Random Walks, Bisections and Gossiping in Circulant Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2014

VSH and multiplicative modular relations between small primes with polynomial exponents.

[BibT_eX]

[DOI]

Ian F. Blake

Appl. Algebra Eng. Commun. Comput., 2014

Periodic structure of the exponential pseudorandom number generator.

[BibT_eX]

[DOI]

Jonas Kaszian

Pieter Moree

Proceedings of the Applied Algebra and Number Theory, 2014

2013

Additive Decompositions of Subgroups of Finite Fields.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

On products of primes and almost primes in arithmetic progressions.

[BibT_eX]

[DOI]

Period. Math. Hung., 2013

Indifferentiable deterministic hashing to elliptic and hyperelliptic curves.

[BibT_eX]

[DOI]

Math. Comput., 2013

Generating safe primes.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2013

Correcting noisy exponentiation black-boxes modulo a prime.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Distribution of values of polynomial Fermat quotients.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2013

Statistics of Different Reduction Types of Fermat Curves.

[BibT_eX]

[DOI]

David Harvey

Exp. Math., 2013

Predicting masked linear pseudorandom number generators over finite fields.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2013

On the Product of Small Elkies Primes

[BibT_eX]

[DOI]

CoRR, 2013

Functional Graphs of Polynomials over Finite Fields.

[BibT_eX]

[DOI]

CoRR, 2013

Periodic Structure of the Exponential Pseudorandom Number Generator.

[BibT_eX]

[DOI]

Jonas Kaszian

Pieter Moree

CoRR, 2013

On the number of Eisenstein polynomials of bounded height.

[BibT_eX]

[DOI]

Randell Heyman

Appl. Algebra Eng. Commun. Comput., 2013

Additive Combinatorics over Finite Fields: New Results and Applications.

[BibT_eX]

Proceedings of the Finite Fields and Their Applications - Character Sums and Polynomials., 2013

Algebraic dynamical systems over finite fields.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

2012

Pseudorandom Bits From Points on Elliptic Curves.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

On the Hidden Shifted Power Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2012

Multiplicative character sums and products of sparse integers in residue classes.

[BibT_eX]

[DOI]

Period. Math. Hung., 2012

On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves.

[BibT_eX]

[DOI]

Jorge Jiménez Urroz

Math. Comput., 2012

On the modular inversion hidden number problem.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

On the power generator and its multivariate analogue.

[BibT_eX]

[DOI]

J. Complex., 2012

Sum-Products Estimates with Several Sets and Applications.

[BibT_eX]

[DOI]

Antal Balog

Kevin A. Broughan

Integers, 2012

On Group Structures Realized by Elliptic Curves over a Fixed Finite Field.

[BibT_eX]

[DOI]

Exp. Math., 2012

On Group Structures Realized by Elliptic Curves over Arbitrary Finite Fields.

[BibT_eX]

[DOI]

Francesco Pappalardi

Exp. Math., 2012

Random Walks and Bisections in Random Circulant Graphs.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Computational Diffie-Hellman Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Pseudorandomness and Dynamics of Fermat Quotients.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

On the average distribution of pseudorandom numbers generated by nonlinear permutations.

[BibT_eX]

[DOI]

Math. Comput., 2011

On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves.

[BibT_eX]

[DOI]

Simon R. Blackburn

IACR Cryptol. ePrint Arch., 2011

On the Hidden Shifted Power Problem

[BibT_eX]

[DOI]

Jean Bourgain

Sergei Konyagin

CoRR, 2011

2010

On the Distribution of Orbits of PGL2(q) in Fqn and the Klapper Conjecture.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators.

[BibT_eX]

[DOI]

Math. Comput., 2010

Approximate polynomial GCD: Small degree and small height perturbations.

[BibT_eX]

[DOI]

Maurice Mignotte

J. Symb. Comput., 2010

On the asymptotic effectiveness of Weil descent attacks.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2010

Some Divisibility Properties of Binomial Coefficients and the Converse of Wolstenholme's Theorem.

[BibT_eX]

[DOI]

Kevin A. Broughan

Integers, 2010

Discrete Logarithms, Diffie-Hellman, and Reductions.

[BibT_eX]

[DOI]

Neal Koblitz

Alfred Menezes

IACR Cryptol. ePrint Arch., 2010

On pseudorandom numbers from multivariate polynomial systems.

[BibT_eX]

[DOI]

Elena Pelican

Finite Fields Their Appl., 2010

Short cycles in repeated exponentiation modulo a prime.

[BibT_eX]

[DOI]

Lev Glebsky

Des. Codes Cryptogr., 2010

On the number of distinct elliptic curves in some families.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2010

Pseudorandom numbers and hash functions from iterations of multivariate polynomials.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2010

On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2010

2009

Divisibility, Smoothness and Cryptographic Applications.

[BibT_eX]

[DOI]

David Naccache

Proceedings of the Algebraic Aspects of Digital Communications, 2009

On the values of Kloosterman sums.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Subset sum pseudorandom numbers: fast generation and distribution.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2009

On the density of some special primes.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2009

On hashing into elliptic curves.

[BibT_eX]

[DOI]

José Felipe Voloch

J. Math. Cryptol., 2009

On the embedding degree of reductions of an elliptic curve.

[BibT_eX]

[DOI]

Alina Carmen Cojocaru

Inf. Process. Lett., 2009

On character sums with distances on the upper half plane over a finite field.

[BibT_eX]

[DOI]

Nicholas M. Katz

Maosheng Xiong

Finite Fields Their Appl., 2009

Elliptic Twin Prime Conjecture.

[BibT_eX]

[DOI]

Proceedings of the Coding and Cryptology, Second International Workshop, 2009

2008

Exponential sums and prime divisors of sparse integers.

[BibT_eX]

[DOI]

Period. Math. Hung., 2008

Divisibility, Smoothness and Cryptographic Applications.

[BibT_eX]

[DOI]

David Naccache

IACR Cryptol. ePrint Arch., 2008

On the elliptic curve analogue of the sum-product problem.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2008

Bilinear character sums over elliptic curves.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2008

On the Convex Closure of the Graph of Modular Inversions.

[BibT_eX]

[DOI]

Mizan R. Khan

Christian L. Yankov

Exp. Math., 2008

On RSA moduli with almost half of the bits prescribed.

[BibT_eX]

[DOI]

Sidney W. Graham

Discret. Appl. Math., 2008

Classical and Quantum Algorithms for Exponential Congruences.

[BibT_eX]

[DOI]

Wim van Dam

Proceedings of the Theory of Quantum Computation, 2008

Pseudorandom Graphs from Elliptic Curves.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Approximate Polynomial gcd: Small Degree and Small Height Perturbations.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Prime Divisors Of Some Recurrence Sequence.

[BibT_eX]

[DOI]

Sanka Balasuriya

Period. Math. Hung., June, 2007

Character sums with subsequence sums.

[BibT_eX]

[DOI]

Sanka Balasuriya

Period. Math. Hung., 2007

Chinese Remaindering with Multiplicative Noise.

[BibT_eX]

[DOI]

Ron Steinfeld

Theory Comput. Syst., 2007

A computational introduction to number theory and algebra.

[BibT_eX]

[DOI]

Math. Comput., 2007

Distribution of some sequences of points on elliptic curves.

[BibT_eX]

[DOI]

Tanja Lange

J. Math. Cryptol., 2007

Statistical distribution and collisions of VSH.

[BibT_eX]

[DOI]

Ian F. Blake

J. Math. Cryptol., 2007

Quantum period reconstruction of approximate sequences.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Bounds on the Fourier coefficients of the weighted sum function.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Distribution of Roots of Polynomial Congruences.

[BibT_eX]

[DOI]

Int. J. Math. Math. Sci., 2007

Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131].

[BibT_eX]

[DOI]

Simon R. Blackburn

Discret. Math., 2007

Communication complexity of some number theoretic functions.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2007

On finite fields for pairing based cryptography.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2007

2006

On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Elliptic Curves with Low Embedding Degree.

[BibT_eX]

[DOI]

J. Cryptol., 2006

Testing set proportionality and the Ádám isomorphism of circulant graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2006

Catalan and Apéry numbers in residue classes.

[BibT_eX]

[DOI]

Moubariz Z. Garaev

J. Comb. Theory, Ser. A, 2006

Reconstructing noisy polynomial evaluation in residue rings.

[BibT_eX]

[DOI]

J. Algorithms, 2006

On the set of distances between two sets over finite fields.

[BibT_eX]

[DOI]

Int. J. Math. Math. Sci., 2006

Exponential sums with Dickson polynomials.

[BibT_eX]

[DOI]

Jaime Gutierrez

Finite Fields Their Appl., 2006

Character sums and nonlinear recurrence sequences.

[BibT_eX]

[DOI]

Simon R. Blackburn

Discret. Math., 2006

On RSA Moduli with Prescribed Bit Patterns.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2006

On the nonlinearity of linear recurrence sequences.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2006

GCD of Random Linear Combinations.

[BibT_eX]

[DOI]

Algorithmica, 2006

On the bit security of the Diffie-Hellman key.

[BibT_eX]

[DOI]

Ian F. Blake

Theodoulos Garefalakis

Appl. Algebra Eng. Commun. Comput., 2006

On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences.

[BibT_eX]

[DOI]

Proceedings of the Sequences and Their Applications, 2006

Constructions of Approximately Mutually Unbiased Bases.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Diffie-Hellman Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Prime divisors of palindromes.

[BibT_eX]

[DOI]

Period. Math. Hung., 2005

A hidden number problem in small subgroups.

[BibT_eX]

[DOI]

Math. Comput., 2005

Report on global methods for combinatorial isoperimetric problems.

[BibT_eX]

[DOI]

Math. Comput., 2005

Predicting nonlinear pseudorandom number generators.

[BibT_eX]

[DOI]

Math. Comput., 2005

On the linear complexity of bounded integer sequences over different moduli.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Prime divisors of some shifted products.

[BibT_eX]

[DOI]

Éric Levieil

Int. J. Math. Math. Sci., 2005

On the singularity of generalised Vandermonde matrices over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2005

On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves.

[BibT_eX]

[DOI]

Florian Hess

Des. Codes Cryptogr., 2005

Noisy interpolation of sparse polynomials in finite fields.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2005

Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves.

[BibT_eX]

[DOI]

Tanja Lange

Appl. Algebra Eng. Commun. Comput., 2005

Quantum Noisy Rational Function Reconstruction.

[BibT_eX]

[DOI]

Sean Hallgren

Alexander Russell

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

On Stern's Attack Against Secret Truncated Linear Congruential Generators.

[BibT_eX]

[DOI]

Scott Contini

Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005

2004

On Decimations of l-Sequences.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Number Theoretic Designs for Directed Regular Graphs of Small Diameter.

[BibT_eX]

[DOI]

Alessandro Conflitti

SIAM J. Discret. Math., 2004

On the multidimensional distribution of the subset sum generator of pseudorandom numbers.

[BibT_eX]

[DOI]

Alessandro Conflitti

Math. Comput., 2004

Noisy Chinese remaindering in the Lee norm.

[BibT_eX]

[DOI]

Ron Steinfeld

J. Complex., 2004

Classical and quantum function reconstruction via character evaluation.

[BibT_eX]

[DOI]

Alexander Russell

J. Complex., 2004

On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Security of polynomial transformations of the Diffie-Hellman key.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2004

Complexity of Inverting the Euler Function

[BibT_eX]

[DOI]

Scott Contini

Ernie Croot

Electron. Colloquium Comput. Complex., 2004

Polynomial interpolation from multiples.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Predicting Subset Sum Pseudorandom Generators.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 11th International Workshop, 2004

New Results on the Hardness of Diffie-Hellman Bits.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2004

A Nonuniform Algorithm for the Hidden Number Problem in Subgroups.

[BibT_eX]

[DOI]

Proceedings of the Public Key Cryptography, 2004

Bisecting and Gossiping in Circulant Graphs.

[BibT_eX]

[DOI]

Gudmund Skovbjerg Frandsen

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

On reducing a system of equations to a single equation.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2004

GCD of Random Linear Forms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003

On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators.

[BibT_eX]

[DOI]

Jaime Gutierrez

IEEE Trans. Inf. Theory, 2003

Finding Points on Curves over Finite Fields.

[BibT_eX]

[DOI]

Alistair Sinclair

SIAM J. Comput., 2003

Prime divisors of sparse integers.

[BibT_eX]

[DOI]

Period. Math. Hung., 2003

On the maximal difference between an element and its inverse modulo n.

[BibT_eX]

[DOI]

Mizan R. Khan

Period. Math. Hung., 2003

Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation.

[BibT_eX]

[DOI]

Nick Howgrave-Graham

Math. Comput., 2003

The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2003

Linear Complexity of the Discrete Logarithm.

[BibT_eX]

Sergei Konyagin

Tanja Lange

Des. Codes Cryptogr., 2003

Complexity of some arithmetic problems for binary polynomials.

[BibT_eX]

[DOI]

Eric Allender

Michael E. Saks

Comput. Complex., 2003

Unconditional proof of tightness of Johnson bound.

[BibT_eX]

[DOI]

Venkatesan Guruswami

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

On the Bit Security of NTRUEncrypt.

[BibT_eX]

[DOI]

William Whyte

Proceedings of the Public Key Cryptography, 2003

An authentication scheme based on roots of sparse polynomials.

[BibT_eX]

[DOI]

Amin Shokrollahi

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2003

Predicting the Inversive Generator.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 2003

Dynamical Systems Generated by Rational Functions.

[BibT_eX]

[DOI]

Alfred J. van der Poorten

Proceedings of the Applied Algebra, 2003

Recurrence Sequences.

[BibT_eX]

[DOI]

Graham Everest

Thomas Ward

Mathematical surveys and monographs 104, American Mathematical Society, ISBN: 978-0-8218-3387-2, 2003

Cryptographic applications of analytic number theory - complexity lower bounds and pseudorandomness.

[BibT_eX]

Progress in computer science and applied logic 22, Birkhäuser, ISBN: 978-3-7643-6654-4, 2003

2002

The Insecurity of the Digital Signature Algorithm with Partially Known Nonces.

[BibT_eX]

[DOI]

J. Cryptol., 2002

Security of most significant bits of gx2.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Secure Bilinear Diffie-Hellman Bits.

[BibT_eX]

[DOI]

Steven D. Galbraith

Herbie J. Hopkins

IACR Cryptol. ePrint Arch., 2002

Non-approximability of the Permanent of Structured Matrices over Finite Fields

[BibT_eX]

[DOI]

Bruno Codenotti

Electron. Colloquium Comput. Complex., 2002

On the spectral Ádám property for circulant graphs.

[BibT_eX]

[DOI]

Francesco Pappalardi

Discret. Math., 2002

On the hardness of approximating the permanent of structured matrices.

[BibT_eX]

[DOI]

Bruno Codenotti

Comput. Complex., 2002

On the Uniformity of Distribution of the ElGamal Signature.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2002

Selective Forgery of RSA Signatures with Fixed-Pattern Padding.

[BibT_eX]

[DOI]

Arjen K. Lenstra

Proceedings of the Public Key Cryptography, 2002

The Hidden Number Problem in Extension Fields and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2002: Theoretical Informatics, 2002

A Variant of NTRU with Non-invertible Polynomials.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2002

Hidden Number Problem with the Trace and Bit Security of XTR and LUC.

[BibT_eX]

[DOI]

Wen-Ching W. Li

Proceedings of the Advances in Cryptology, 2002

Chinese Remaindering for Algebraic Numbers in a Hidden Field.

[BibT_eX]

[DOI]

Ron Steinfeld

Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

Smooth Orders and Cryptographic Applications.

[BibT_eX]

[DOI]

Carl Pomerance

Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001

On the Distribution of Diffie-Hellman Triples with Sparse Exponents.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2001

On the uniformity of distribution of the RSA pairs.

[BibT_eX]

[DOI]

Math. Comput., 2001

On the distribution of inversive congruential pseudorandom numbers in parts of the period.

[BibT_eX]

[DOI]

Math. Comput., 2001

On the distribution of the power generator.

[BibT_eX]

[DOI]

Math. Comput., 2001

Period of the power generator and small values of Carmichael's function.

[BibT_eX]

[DOI]

Carl Pomerance

Math. Comput., 2001

A Lower Bound for Primality.

[BibT_eX]

[DOI]

Eric Allender

Michael E. Saks

J. Comput. Syst. Sci., 2001

On Some Uniformity of Distribution Properties of ESIGN.

[BibT_eX]

[DOI]

Edwin El Mahassni

Electron. Notes Discret. Math., 2001

On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves.

[BibT_eX]

Joseph H. Silverman

Des. Codes Cryptogr., 2001

On Some Properties of the Shrinking Generator.

[BibT_eX]

Des. Codes Cryptogr., 2001

On the Linear Complexity of the Power Generator.

[BibT_eX]

Des. Codes Cryptogr., 2001

Sparse polynomial approximation in finite fields.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

On the Uniformity of Distribution of Congruential Generators over Elliptic Curves.

[BibT_eX]

[DOI]

Edwin El Mahassni

Proceedings of the Sequences and their Applications, 2001

On the Security of Lenstra's Variant of DSA without Long Inversions.

[BibT_eX]

[DOI]

Arjen K. Lenstra

Proceedings of the Public Key Cryptography, 2001

On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems.

[BibT_eX]

[DOI]

Erion Plaku

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

On the Unpredictability of Bits of the Elliptic Curve Diffie--Hellman Scheme.

[BibT_eX]

[DOI]

Dan Boneh

Proceedings of the Advances in Cryptology, 2001

The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces.

[BibT_eX]

[DOI]

Edwin El Mahassni

Proceedings of the Cryptography and Lattices, International Conference, 2001

On the Insecurity of a Server-Aided RSA Protocol.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2001

On the Generalised Hidden Number Problem and Bit Security of XTR.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2001

2000

On the linear complexity profile of the power generator.

[BibT_eX]

[DOI]

Frances Griffin

IEEE Trans. Inf. Theory, 2000

Zero testing of p-adic and modular polynomials.

[BibT_eX]

[DOI]

Alfred J. van der Poorten

Theor. Comput. Sci., 2000

The CREW PRAM Complexity of Modular Inversion.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping.

[BibT_eX]

[DOI]

Don Coppersmith

J. Cryptol., 2000

Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications.

[BibT_eX]

[DOI]

J. Algorithms, 2000

Linear complexity of the Naor-Reingold pseudo-random function.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

On the Security of Diffie-Hellman Bits

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

Security of Polynomial Transformations of the Diffie--Hellma

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

Security of the Most Significant Bits of the Shamir Message Passing Scheme

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2000

The average sensitivity of square-freeness.

[BibT_eX]

[DOI]

Comput. Complex., 2000

On the Naor-Reingold Pseudo-Random Function from Elliptic Curves.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2000

On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2000

An Identification Scheme Based on Sparse Polynomials.

[BibT_eX]

[DOI]

Daniel Lieman

Proceedings of the Public Key Cryptography, 2000

Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Cryptographic Applications of Sparse Polynomials over Finite Rings.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology, 2000

On the distribution of the power generator modulo a prime power.

[BibT_eX]

[DOI]

Jan S. dT. Hansen

Proceedings of the Unusual Applications of Number Theory, 2000

On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields.

[BibT_eX]

[DOI]

David R. Kohel

Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

An Extremely Small and Efficient Identification Scheme.

[BibT_eX]

[DOI]

Daniel Lieman

Proceedings of the Information Security and Privacy, 5th Australasian Conference, 2000

1999

On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1999

On the Uniformity of Distribution of a Certain Pseudo-Random Function

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1999

On The Correlation of Binary Sequences.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 1999

Non-linear Complexity of the Naor-Reingold Pseudo-random Function.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology, 1999

On the Linear Complexity of the Naor-Reingold Pseudo-Random Function.

[BibT_eX]

[DOI]

Frances Griffin

Proceedings of the Information and Communication Security, Second International Conference, 1999

On Routing in Circulant Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

On the Average Sensitivity of Testing Square-Free Numbers.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders.

[BibT_eX]

[DOI]

Frances Griffin

Proceedings of the Applied Algebra, 1999

Constructing Elements of Large Order in Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1999

1998

Circuit and Decision Tree Complexity of Some Number Theoretic Problems

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

Computing components and projections of curves over finite fields.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

Circuit Complexity of Testing Square-Free Numbers

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

Orders of Gauss Periods in Finite Fields.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1998

On the Distribution of the RSA Generator.

[BibT_eX]

[DOI]

Daniel Lieman

Proceedings of the Sequences and their Applications, 1998

On the Ádám Conjecture on Circulant Graphs.

[BibT_eX]

[DOI]

Francesco Pappalardi

Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997

Counting Curves and Their Projections.

[BibT_eX]

[DOI]

Comput. Complex., 1997

1996

On Finding Primitive Roots in Finite Fields.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

On irreducible polynomials of small height over finite fields.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1996

1995

Finding Points on Curves over Finite Fields (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

Components and Projections of Curves over Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

On some applications of finitely generated semi-groups.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993

On Parameters of Some Graphs from Finite Fields.

[BibT_eX]

[DOI]

Eur. J. Comb., 1993

Finding Irreducible and Primitive Polynomials.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1993

1992

Distances from Differences of Roots of Polynomials to the Nearest Integers.

[BibT_eX]

[DOI]

V. I. Galiev

A. F. Polupanov

Inf. Process. Lett., 1992

A Deterministic Test for Permutation Polynomials.

[BibT_eX]

[DOI]

Comput. Complex., 1992

1991

On the Distribution of Values of Recurring Sequences and the Bell Numbers in Finite Fields.

[BibT_eX]

[DOI]

Eur. J. Comb., 1991

On Gaussian Sums for Finite Fields and Elliptic Curves.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Coding, 1991

1987

On Structure Complexity of Normal Basis of Finite Field.

[BibT_eX]

[DOI]

S. A. Stepanov