# Igor Aleksandrovich Semaev

Professor
• E-mailIgor.Semaev@uib.no
• Phone+47 55 58 42 79
HIB - Thormøhlens gate 55
5006 Bergen
Postboks 7803
5020 Bergen
• Show author(s) (2020). Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases. Journal of Algebra. 651-674.
• Show author(s) (2018). Separable Statistics and Multidimensional Linear Cryptanalysis. IACR Transactions on Symmetric Cryptology (ToSC). 79-110.
• Show author(s) (2016). Statistical and Algebraic Properties of DES. Lecture Notes in Computer Science (LNCS). 93-107.
• Show author(s) (2016). A combinatorial problem related to sparse systems of equations. Designs, Codes and Cryptography. 1-16.
• Show author(s) (2015). MaxMinMax problem and sparse equations over finite fields. Designs, Codes and Cryptography. 22 pages.
• Show author(s) (2015). An application of Combinatorics in Cryptography. Electronic Notes in Discrete Mathematics. 31-35.
• Show author(s) (2013). Improved agreeing-gluing algorithm. Mathematics in Computer Science. 321-339.
• Show author(s) (2011). Sparse Boolean equations and circuit lattices. Designs, Codes and Cryptography. 349-364.
• Show author(s) (2010). Sparse Boolean equations and circuit lattices. Designs, Codes and Cryptography. 16 pages.
• Show author(s) (2010). Methods to Solve Algebraic Equations in Cryptanalysis. Tatra Mountains Mathematical Publications. 1-29.
• Show author(s) (2009). Sparse algebraic equations over finite fields. SIAM journal on computing (Print). 388-409.
• Show author(s) (2008). Solving Multiple Right Hand Sides linear equations. Designs, Codes and Cryptography. 147-160.
• Show author(s) (2008). On solving sparse algebraic equations over finite fields. Designs, Codes and Cryptography. 47-60.
• Show author(s) (2006). The ANF of the Composition of Addition and Multiplication mod 2^n with a Boolean Function. Lecture Notes in Computer Science (LNCS). 112-125.
• Show author(s) (2006). An algorithm to solve the discrete logarithm problem with the number field sieve. Lecture Notes in Computer Science (LNCS). 174-190.
• Show author(s) (2005). The ANF of the composition of addition and multiplication mod 2(n) with a Boolean function. Lecture Notes in Computer Science (LNCS). 112-125.