Igor E. Shparlinski

According to our database1, Igor E. Shparlinski authored at least 241 papers between 1987 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
On Functional Graphs of Quadratic Polynomials.
Experimental Mathematics, 2019

Codes correcting restricted errors.
Des. Codes Cryptogr., 2019

2018
On Constructing Primitive Roots in Finite Fields With Advice.
IEEE Trans. Information Theory, 2018

Identity testing and interpolation from high powers of polynomials of large degree over finite fields.
J. Complexity, 2018

Arithmetic Properties of Integers in Chains and Reflections of g-ary Expansions.
Experimental Mathematics, 2018

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

2017
Power series approximations to Fekete polynomials.
Journal of Approximation Theory, 2017

An explicit polynomial analogue of Romanoff's theorem.
Finite Fields and Their Applications, 2017

2016
Counting Co-Cyclic Lattices.
SIAM J. Discrete Math., 2016

On Gauss sums and the evaluation of Stechkin's constant.
Math. Comput., 2016

Functional graphs of polynomials over finite fields.
J. Comb. Theory, Ser. B, 2016

On the additive energy of the distance set in finite fields.
Finite Fields and Their Applications, 2016

Counting irreducible binomials over finite fields.
Finite Fields and Their Applications, 2016

Ratios of Small Integers in Multiplicative Subgroups of Residue Rings.
Experimental Mathematics, 2016

On small gaps between the elements of multiplicative subgroups of finite fields.
Des. Codes Cryptogr., 2016

Optimal Quantum Algorithm for Polynomial Interpolation.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Cayley Graphs Generated by Small Degree Polynomials over Finite Fields.
SIAM J. Discrete Math., 2015

Character sums and deterministic polynomial root finding in finite fields.
Math. Comput., 2015

Circulant graphs and GCD and LCM of subsets.
Inf. Process. Lett., 2015

Results on polynomial interpolation with mixed modular operations and unknown moduli.
IACR Cryptology ePrint Archive, 2015

Close values of shifted modular inversions and the decisional modular inversion hidden number problem.
Adv. in Math. of Comm., 2015

2014
Covering Sets for Limited-Magnitude Errors.
IEEE Trans. Information Theory, 2014

Evasive properties of sparse graphs and some linear equations in primes.
Theor. Comput. Sci., 2014

On shifted Eisenstein polynomials.
Periodica Mathematica Hungarica, 2014

On the Multidimensional Distribution of the Naor-Reingold Pseudo-Random Function.
Math. Comput., 2014

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

Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields.
J. Symb. Comput., 2014

On the Distribution of Atkin and Elkies Primes.
Foundations of Computational Mathematics, 2014

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

Random Walks, Bisections and Gossiping in Circulant Graphs.
Algorithmica, 2014

VSH and multiplicative modular relations between small primes with polynomial exponents.
Appl. Algebra Eng. Commun. Comput., 2014

Periodic structure of the exponential pseudorandom number generator.
Proceedings of the Applied Algebra and Number Theory, 2014

2013
Additive Decompositions of Subgroups of Finite Fields.
SIAM J. Discrete Math., 2013

On products of primes and almost primes in arithmetic progressions.
Periodica Mathematica Hungarica, 2013

Indifferentiable deterministic hashing to elliptic and hyperelliptic curves.
Math. Comput., 2013

Generating safe primes.
J. Mathematical Cryptology, 2013

Correcting noisy exponentiation black-boxes modulo a prime.
Inf. Process. Lett., 2013

Distribution of values of polynomial Fermat quotients.
Finite Fields and Their Applications, 2013

Statistics of Different Reduction Types of Fermat Curves.
Experimental Mathematics, 2013

Predicting masked linear pseudorandom number generators over finite fields.
Des. Codes Cryptogr., 2013

On the number of Eisenstein polynomials of bounded height.
Appl. Algebra Eng. Commun. Comput., 2013

2012
Pseudorandom Bits From Points on Elliptic Curves.
IEEE Trans. Information Theory, 2012

On the Hidden Shifted Power Problem.
SIAM J. Comput., 2012

Multiplicative character sums and products of sparse integers in residue classes.
Periodica Mathematica Hungarica, 2012

On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves.
Math. Comput., 2012

On the modular inversion hidden number problem.
J. Symb. Comput., 2012

On the power generator and its multivariate analogue.
J. Complexity, 2012

On Group Structures Realized by Elliptic Curves over a Fixed Finite Field.
Experimental Mathematics, 2012

On Group Structures Realized by Elliptic Curves over Arbitrary Finite Fields.
Experimental Mathematics, 2012

Random Walks and Bisections in Random Circulant Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011
Computational Diffie-Hellman Problem.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

Pseudorandomness and Dynamics of Fermat Quotients.
SIAM J. Discrete Math., 2011

On the average distribution of pseudorandom numbers generated by nonlinear permutations.
Math. Comput., 2011

On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves.
IACR Cryptology ePrint Archive, 2011

2010
On the Distribution of Orbits of PGL2(q) in Fqn and the Klapper Conjecture.
SIAM J. Discrete Math., 2010

On the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators.
Math. Comput., 2010

Approximate polynomial GCD: Small degree and small height perturbations.
J. Symb. Comput., 2010

On the asymptotic effectiveness of Weil descent attacks.
J. Mathematical Cryptology, 2010

Discrete Logarithms, Diffie-Hellman, and Reductions.
IACR Cryptology ePrint Archive, 2010

Indifferentiable Deterministic Hashing to Elliptic and Hyperelliptic Curves.
IACR Cryptology ePrint Archive, 2010

On pseudorandom numbers from multivariate polynomial systems.
Finite Fields and Their Applications, 2010

Short cycles in repeated exponentiation modulo a prime.
Des. Codes Cryptogr., 2010

On the number of distinct elliptic curves in some families.
Des. Codes Cryptogr., 2010

Pseudorandom numbers and hash functions from iterations of multivariate polynomials.
Cryptography and Communications, 2010

On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences.
Adv. in Math. of Comm., 2010

2009
Divisibility, Smoothness and Cryptographic Applications.
Proceedings of the Algebraic Aspects of Digital Communications, 2009

On the values of Kloosterman sums.
IEEE Trans. Information Theory, 2009

Subset sum pseudorandom numbers: fast generation and distribution.
J. Mathematical Cryptology, 2009

On the density of some special primes.
J. Mathematical Cryptology, 2009

On hashing into elliptic curves.
J. Mathematical Cryptology, 2009

On the embedding degree of reductions of an elliptic curve.
Inf. Process. Lett., 2009

On character sums with distances on the upper half plane over a finite field.
Finite Fields and Their Applications, 2009

Elliptic Twin Prime Conjecture.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009

2008
Exponential sums and prime divisors of sparse integers.
Periodica Mathematica Hungarica, 2008

Divisibility, Smoothness and Cryptographic Applications.
IACR Cryptology ePrint Archive, 2008

On the elliptic curve analogue of the sum-product problem.
Finite Fields and Their Applications, 2008

Bilinear character sums over elliptic curves.
Finite Fields and Their Applications, 2008

On the Convex Closure of the Graph of Modular Inversions.
Experimental Mathematics, 2008

On RSA moduli with almost half of the bits prescribed.
Discrete Applied Mathematics, 2008

Classical and Quantum Algorithms for Exponential Congruences.
Proceedings of the Theory of Quantum Computation, 2008

Pseudorandom Graphs from Elliptic Curves.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Approximate Polynomial gcd: Small Degree and Small Height Perturbations.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007
Character sums with subsequence sums.
Periodica Mathematica Hungarica, 2007

Chinese Remaindering with Multiplicative Noise.
Theory Comput. Syst., 2007

A computational introduction to number theory and algebra.
Math. Comput., 2007

Distribution of some sequences of points on elliptic curves.
J. Mathematical Cryptology, 2007

Statistical distribution and collisions of VSH.
J. Mathematical Cryptology, 2007

Quantum period reconstruction of approximate sequences.
Inf. Process. Lett., 2007

Distribution of Roots of Polynomial Congruences.
Int. J. Math. Mathematical Sciences, 2007

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

Communication complexity of some number theoretic functions.
Appl. Math. Lett., 2007

On finite fields for pairing based cryptography.
Adv. in Math. of Comm., 2007

2006
On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences.
IEEE Trans. Information Theory, 2006

Complexity of inverting the Euler function.
Math. Comput., 2006

Elliptic Curves with Low Embedding Degree.
J. Cryptology, 2006

Testing set proportionality and the Ádám isomorphism of circulant graphs.
J. Discrete Algorithms, 2006

Catalan and Apéry numbers in residue classes.
J. Comb. Theory, Ser. A, 2006

Reconstructing noisy polynomial evaluation in residue rings.
J. Algorithms, 2006

On the set of distances between two sets over finite fields.
Int. J. Math. Mathematical Sciences, 2006

Exponential sums with Dickson polynomials.
Finite Fields and Their Applications, 2006

Character sums and nonlinear recurrence sequences.
Discrete Mathematics, 2006

On RSA Moduli with Prescribed Bit Patterns.
Des. Codes Cryptogr., 2006

On the nonlinearity of linear recurrence sequences.
Appl. Math. Lett., 2006

GCD of Random Linear Combinations.
Algorithmica, 2006

On the bit security of the Diffie-Hellman key.
Appl. Algebra Eng. Commun. Comput., 2006

On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences.
Proceedings of the Sequences and Their Applications, 2006

Constructions of Approximately Mutually Unbiased Bases.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Bounds on the Fourier Coefficients of the Weighted Sum Function.
Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

2005
Diffie-Hellman Problem.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

Prime divisors of palindromes.
Periodica Mathematica Hungarica, 2005

A hidden number problem in small subgroups.
Math. Comput., 2005

Report on global methods for combinatorial isoperimetric problems.
Math. Comput., 2005

Predicting nonlinear pseudorandom number generators.
Math. Comput., 2005

On the linear complexity of bounded integer sequences over different moduli.
Inf. Process. Lett., 2005

Prime divisors of some shifted products.
Int. J. Math. Mathematical Sciences, 2005

Elliptic Curves with Low Embedding Degree.
IACR Cryptology ePrint Archive, 2005

On the singularity of generalised Vandermonde matrices over finite fields.
Finite Fields and Their Applications, 2005

On the Linear Complexity and Multidimensional Distribution of Congruential Generators over Elliptic Curves.
Des. Codes Cryptogr., 2005

Noisy interpolation of sparse polynomials in finite fields.
Appl. Algebra Eng. Commun. Comput., 2005

Collisions in Fast Generation of Ideal Classes and Points on Hyperelliptic and Elliptic Curves.
Appl. Algebra Eng. Commun. Comput., 2005

Quantum Noisy Rational Function Reconstruction.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

On Stern's Attack Against Secret Truncated Linear Congruential Generators.
Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005

2004
On Decimations of l-Sequences.
SIAM J. Discrete Math., 2004

Number Theoretic Designs for Directed Regular Graphs of Small Diameter.
SIAM J. Discrete Math., 2004

On the multidimensional distribution of the subset sum generator of pseudorandom numbers.
Math. Comput., 2004

Noisy Chinese remaindering in the Lee norm.
J. Complexity, 2004

Classical and quantum function reconstruction via character evaluation.
J. Complexity, 2004

On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA.
Inf. Process. Lett., 2004

Security of polynomial transformations of the Diffie-Hellman key.
Finite Fields and Their Applications, 2004

Complexity of Inverting the Euler Function
Electronic Colloquium on Computational Complexity (ECCC), 2004

Polynomial interpolation from multiples.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Predicting Subset Sum Pseudorandom Generators.
Proceedings of the Selected Areas in Cryptography, 11th International Workshop, 2004

New Results on the Hardness of Diffie-Hellman Bits.
Proceedings of the Public Key Cryptography, 2004

A Nonuniform Algorithm for the Hidden Number Problem in Subgroups.
Proceedings of the Public Key Cryptography, 2004

Bisecting and Gossiping in Circulant Graphs.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

On reducing a system of equations to a single equation.
Proceedings of the Symbolic and Algebraic Computation, 2004

GCD of Random Linear Forms.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Secure Bilinear Diffie-Hellman Bits.
Proceedings of the Information Security and Privacy: 9th Australasian Conference, 2004

2003
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators.
IEEE Trans. Information Theory, 2003

Finding Points on Curves over Finite Fields.
SIAM J. Comput., 2003

Prime divisors of sparse integers.
Periodica Mathematica Hungarica, 2003

On the maximal difference between an element and its inverse modulo n.
Periodica Mathematica Hungarica, 2003

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

Hidden Number Problem in Small Subgroups.
IACR Cryptology ePrint Archive, 2003

The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces.
Des. Codes Cryptogr., 2003

Linear Complexity of the Discrete Logarithm.
Des. Codes Cryptogr., 2003

Complexity of some arithmetic problems for binary polynomials.
Computational Complexity, 2003

Unconditional proof of tightness of Johnson bound.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

On the Bit Security of NTRUEncrypt.
Proceedings of the Public Key Cryptography, 2003

An authentication scheme based on roots of sparse polynomials.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity.
Proceedings of the Cryptography and Coding, 2003

Predicting the Inversive Generator.
Proceedings of the Cryptography and Coding, 2003

Dynamical Systems Generated by Rational Functions.
Proceedings of the Applied Algebra, 2003

Recurrence Sequences.
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.
Progress in computer science and applied logic 22, Birkhäuser, ISBN: 978-3-7643-6654-4, 2003

2002
Security of the most significant bits of the Shamir message passing scheme.
Math. Comput., 2002

The Insecurity of the Digital Signature Algorithm with Partially Known Nonces.
J. Cryptology, 2002

Security of most significant bits of gx2.
Inf. Process. Lett., 2002

Non-approximability of the Permanent of Structured Matrices over Finite Fields
Electronic Colloquium on Computational Complexity (ECCC), 2002

On the spectral Ádám property for circulant graphs.
Discrete Mathematics, 2002

On the hardness of approximating the permanent of structured matrices.
Computational Complexity, 2002

On the Uniformity of Distribution of the ElGamal Signature.
Appl. Algebra Eng. Commun. Comput., 2002

Selective Forgery of RSA Signatures with Fixed-Pattern Padding.
Proceedings of the Public Key Cryptography, 2002

The Hidden Number Problem in Extension Fields and Its Applications.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

A Variant of NTRU with Non-invertible Polynomials.
Proceedings of the Progress in Cryptology, 2002

Hidden Number Problem with the Trace and Bit Security of XTR and LUC.
Proceedings of the Advances in Cryptology, 2002

Chinese Remaindering for Algebraic Numbers in a Hidden Field.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

Smooth Orders and Cryptographic Applications.
Proceedings of the Algorithmic Number Theory, 5th International Symposium, 2002

2001
On the Distribution of Diffie-Hellman Triples with Sparse Exponents.
SIAM J. Discrete Math., 2001

On the uniformity of distribution of the RSA pairs.
Math. Comput., 2001

On the distribution of inversive congruential pseudorandom numbers in parts of the period.
Math. Comput., 2001

On the distribution of the power generator.
Math. Comput., 2001

Period of the power generator and small values of Carmichael's function.
Math. Comput., 2001

Circuit and Decision Tree Complexity of Some Number Theoretic Problems.
Inf. Comput., 2001

On Some Uniformity of Distribution Properties of ESIGN.
Electronic Notes in Discrete Mathematics, 2001

On the Linear Complexity of the Naor-Reingold Pseudo-random Function from Elliptic Curves.
Des. Codes Cryptogr., 2001

On Some Properties of the Shrinking Generator.
Des. Codes Cryptogr., 2001

On the Linear Complexity of the Power Generator.
Des. Codes Cryptogr., 2001

Sparse polynomial approximation in finite fields.
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.
Proceedings of the Sequences and their Applications, 2001

On the Security of Lenstra's Variant of DSA without Long Inversions.
Proceedings of the Public Key Cryptography, 2001

On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems.
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.
Proceedings of the Advances in Cryptology, 2001

The Insecurity of Nyberg-Rueppel and Other DSA-Like Signature Schemes with Partially Known Nonces.
Proceedings of the Cryptography and Lattices, International Conference, 2001

On the Insecurity of a Server-Aided RSA Protocol.
Proceedings of the Advances in Cryptology, 2001

On the Generalised Hidden Number Problem and Bit Security of XTR.
Proceedings of the Applied Algebra, 2001

2000
On the linear complexity profile of the power generator.
IEEE Trans. Information Theory, 2000

Zero testing of p-adic and modular polynomials.
Theor. Comput. Sci., 2000

On Polynomial Approximation of the Discrete Logarithm and the Diffie - Hellman Mapping.
J. Cryptology, 2000

Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications.
J. Algorithms, 2000

Linear complexity of the Naor-Reingold pseudo-random function.
Inf. Process. Lett., 2000

Security of the Most Significant Bits of the Shamir Message Passing Scheme.
IACR Cryptology ePrint Archive, 2000

On the Security of Diffie-Hellman Bits.
IACR Cryptology ePrint Archive, 2000

Security of Polynomial Transformations of the Diffie-Hellman Key.
IACR Cryptology ePrint Archive, 2000

On the Security of Diffie-Hellman Bits
Electronic Colloquium on Computational Complexity (ECCC), 2000

Security of Polynomial Transformations of the Diffie--Hellma
Electronic Colloquium on Computational Complexity (ECCC), 2000

Security of the Most Significant Bits of the Shamir Message Passing Scheme
Electronic Colloquium on Computational Complexity (ECCC), 2000

The average sensitivity of square-freeness.
Computational Complexity, 2000

On the Naor-Reingold Pseudo-Random Function from Elliptic Curves.
Appl. Algebra Eng. Commun. Comput., 2000

On the Distribution of Pseudorandom Numbers and Vectors Generated by Inversive Methods.
Appl. Algebra Eng. Commun. Comput., 2000

An Identification Scheme Based on Sparse Polynomials.
Proceedings of the Public Key Cryptography, 2000

Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Cryptographic Applications of Sparse Polynomials over Finite Rings.
Proceedings of the Information Security and Cryptology, 2000

On the distribution of the power generator modulo a prime power.
Proceedings of the Unusual Applications of Number Theory, 2000

On Exponential Sums and Group Generators for Elliptic Curves over Finite Fields.
Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

An Extremely Small and Efficient Identification Scheme.
Proceedings of the Information Security and Privacy, 5th Australasian Conference, 2000

1999
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials
Electronic Colloquium on Computational Complexity (ECCC), 1999

On the Uniformity of Distribution of a Certain Pseudo-Random Function
Electronic Colloquium on Computational Complexity (ECCC), 1999

A Lower Bound for Primality
Electronic Colloquium on Computational Complexity (ECCC), 1999

On The Correlation of Binary Sequences.
Des. Codes Cryptogr., 1999

Circuit Complexity of Testing Square-Free Numbers.
Proceedings of the STACS 99, 1999

Non-linear Complexity of the Naor-Reingold Pseudo-random Function.
Proceedings of the Information Security and Cryptology, 1999

On the Linear Complexity of the Naor-Reingold Pseudo-Random Function.
Proceedings of the Information and Communication Security, Second International Conference, 1999

On Routing in Circulant Graphs.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

On the Average Sensitivity of Testing Square-Free Numbers.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

A Lower Bound for Primality.
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials.
Proceedings of the Applied Algebra, 1999

On the Distribution of Nonlinear Recursive Congruential Pseudorandom Numbers of Higher Orders.
Proceedings of the Applied Algebra, 1999

Constructing Elements of Large Order in Finite Fields.
Proceedings of the Applied Algebra, 1999

1998
Circuit and Decision Tree Complexity of Some Number Theoretic Problems
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

Computing components and projections of curves over finite fields.
SIAM J. Comput., 1998

Circuit Complexity of Testing Square-Free Numbers
Electronic Colloquium on Computational Complexity (ECCC), 1998

On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems
Electronic Colloquium on Computational Complexity (ECCC), 1998

On the Distribution of the RSA Generator.
Proceedings of the Sequences and their Applications, 1998

The CREW PRAM Complexity of Modular Inversion.
Proceedings of the LATIN '98: Theoretical Informatics, 1998

On the Ádám Conjecture on Circulant Graphs.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1996
On Finding Primitive Roots in Finite Fields.
Theor. Comput. Sci., 1996

On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields.
Theor. Comput. Sci., 1996

On irreducible polynomials of small height over finite fields.
Appl. Algebra Eng. Commun. Comput., 1996

1995
Orders of Gauss Periods in Finite Fields.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Finding Points on Curves over Finite Fields (Extended Abstract).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994
Components and Projections of Curves over Finite Fields.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

On some applications of finitely generated semi-groups.
Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993
On Parameters of Some Graphs from Finite Fields.
Eur. J. Comb., 1993

Finding Irreducible and Primitive Polynomials.
Appl. Algebra Eng. Commun. Comput., 1993

Counting curves and their projections.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992
Distances from Differences of Roots of Polynomials to the Nearest Integers.
Inf. Process. Lett., 1992

A Deterministic Test for Permutation Polynomials.
Computational Complexity, 1992

1991
On the Distribution of Values of Recurring Sequences and the Bell Numbers in Finite Fields.
Eur. J. Comb., 1991

On Gaussian Sums for Finite Fields and Elliptic Curves.
Proceedings of the Algebraic Coding, 1991

1987
On Structure Complexity of Normal Basis of Finite Field.
Proceedings of the Fundamentals of Computation Theory, 1987


  Loading...