We stand with Ukraine

We stand with Ukraine

Igor A. Semaev

According to our database¹, Igor A. Semaev authored at least 30 papers between 1998 and 2019.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2019

New non-linearity parameters of Boolean functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

2017

Separable Statistics and Multidimensional Linear Cryptanalysis.

[BibT_eX]

[DOI]

Stian Fauskanger

,

IACR Cryptol. ePrint Arch., 2017

A combinatorial problem related to sparse systems of equations.

[BibT_eX]

[DOI]

,

,

Des. Codes Cryptogr., 2017

2016

On low degree polynomials in 2-round AES.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

MaxMinMax problem and sparse equations over finite fields.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2016

2015

Experimental Study of DIGIPASS GO3 and the Security of Authentication.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

New algorithm for the discrete logarithm problem on elliptic curves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

Statistical and Algebraic Properties of DES.

[BibT_eX]

[DOI]

Stian Fauskanger

,

IACR Cryptol. ePrint Arch., 2015

An application of Combinatorics in Cryptography.

[BibT_eX]

[DOI]

,

,

Electron. Notes Discret. Math., 2015

2014

New Results in the Linear Cryptanalysis of DES.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

2013

Improved Agreeing-Gluing Algorithm.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2013

2011

New Statistical Box-Test and its Power.

[BibT_eX]

[DOI]

,

Mehdi M. Hassanzadeh

IACR Cryptol. ePrint Arch., 2011

Local limit theorem for large deviations and statistical box-tests.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Sparse Boolean equations and circuit lattices.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2011

2009

Sparse Algebraic Equations over Finite Fields.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

2008

New hash function designs.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

On solving sparse algebraic equations over finite fields.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2008

Solving Multiple Right Hand Sides linear equations.

[BibT_eX]

[DOI]

,

Des. Codes Cryptogr., 2008

2007

On solving sparse algebraic equations over finite fields II.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Solving MRHS linear equations.

[BibT_eX]

[DOI]

,

IACR Cryptol. ePrint Arch., 2007

2006

New Technique for Solving Sparse Equation Systems.

[BibT_eX]

[DOI]

,

IACR Cryptol. ePrint Arch., 2006

An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve.

[BibT_eX]

[DOI]

,

Proceedings of the Public Key Cryptography, 2006

2005

The ANF of the Composition of Addition and Multiplication mod 2<sup>n</sup> with a Boolean Function.

[BibT_eX]

[DOI]

,

Proceedings of the Fast Software Encryption: 12th International Workshop, 2005

2004

Summation polynomials and the discrete logarithm problem on elliptic curves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2004

2003

A reduction of the space for the parallelized Pollard lambda search on elliptic curves over prime finite fields and on anomalous binary elliptic curves.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2003

2002

Special prime numbers and discrete logs in finite prime fields.

[BibT_eX]

[DOI]

Math. Comput., 2002

2001

A 3-Dimensional Lattice Reduction Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Lattices, International Conference, 2001

1998

An algorithm for evaluation of discrete logarithms in some nonprime finite fields.

[BibT_eX]

[DOI]

Math. Comput., 1998

Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p.

[BibT_eX]

[DOI]

Math. Comput., 1998

Evaluation of Linear Relations between Vectors of a Lattice in Euclidean Space.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

Loading...