Evaluation of Linear Relations between Vectors of a Lattice in Euclidean Space. - Igor A. Semaev (ANTS, 1998)

Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. - Igor A. Semaev (Math. Comput., 1998)

An algorithm for evaluation of discrete logarithms in some nonprime finite fields. - Igor A. Semaev (Math. Comput., 1998)

A 3-Dimensional Lattice Reduction Algorithm. - Igor A. Semaev (CaLC, 2001)

Special prime numbers and discrete logs in finite prime fields. - Igor A. Semaev (Math. Comput., 2002)

A reduction of the space for the parallelized Pollard lambda search on elliptic curves over prime finite fields and on anomalous binary elliptic curves. - Igor A. Semaev (IACR Cryptol. ePrint Arch., 2003)

Summation polynomials and the discrete logarithm problem on elliptic curves. - Igor A. Semaev (IACR Cryptol. ePrint Arch., 2004)

The ANF of the Composition of Addition and Multiplication mod 2n with a Boolean Function. - An Braeken; Igor A. Semaev (FSE, 2005)

An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve. - An Commeine; Igor A. Semaev (Public Key Cryptography, 2006)

New Technique for Solving Sparse Equation Systems. - Håvard Raddum; Igor A. Semaev (IACR Cryptol. ePrint Arch., 2006)

Solving MRHS linear equations. - Håvard Raddum; Igor A. Semaev (IACR Cryptol. ePrint Arch., 2007)

On solving sparse algebraic equations over finite fields II. - Igor A. Semaev (IACR Cryptol. ePrint Arch., 2007)

Solving Multiple Right Hand Sides linear equations. - Håvard Raddum; Igor A. Semaev (Des. Codes Cryptogr., 2008)

On solving sparse algebraic equations over finite fields. - Igor A. Semaev (Des. Codes Cryptogr., 2008)

New hash function designs. - Igor A. Semaev (IACR Cryptol. ePrint Arch., 2008)

Sparse Algebraic Equations over Finite Fields. - Igor A. Semaev (SIAM J. Comput., 2009)

Sparse Boolean equations and circuit lattices. - Igor A. Semaev (Des. Codes Cryptogr., 2011)

Local limit theorem for large deviations and statistical box-tests. - Igor A. Semaev (IACR Cryptol. ePrint Arch., 2011)

New Statistical Box-Test and its Power. - Igor A. Semaev; Mehdi M. Hassanzadeh (IACR Cryptol. ePrint Arch., 2011)

Improved Agreeing-Gluing Algorithm. - Igor A. Semaev (Math. Comput. Sci., 2013)

New Results in the Linear Cryptanalysis of DES. - Igor A. Semaev (IACR Cryptol. ePrint Arch., 2014)

An application of Combinatorics in Cryptography. - Peter Horák; Igor A. Semaev; Zsolt Tuza (Electron. Notes Discret. Math., 2015)

Statistical and Algebraic Properties of DES. - Stian Fauskanger; Igor A. Semaev (IACR Cryptol. ePrint Arch., 2015)

New algorithm for the discrete logarithm problem on elliptic curves. - Igor A. Semaev (IACR Cryptol. ePrint Arch., 2015)

Experimental Study of DIGIPASS GO3 and the Security of Authentication. - Igor A. Semaev (IACR Cryptol. ePrint Arch., 2015)

MaxMinMax problem and sparse equations over finite fields. - Igor A. Semaev (Des. Codes Cryptogr., 2016)

On low degree polynomials in 2-round AES. - Igor A. Semaev (IACR Cryptol. ePrint Arch., 2016)

A combinatorial problem related to sparse systems of equations. - Peter Horák; Igor A. Semaev; Zsolt Tuza (Des. Codes Cryptogr., 2017)

Separable Statistics and Multidimensional Linear Cryptanalysis. - Stian Fauskanger; Igor A. Semaev (IACR Trans. Symmetric Cryptol., 2018)

New non-linearity parameters of Boolean functions. - Igor A. Semaev (IACR Cryptol. ePrint Arch., 2019)