Hjem
Universitetet i Bergen
Igor Aleksandrovich Semaevs bilde

Igor Aleksandrovich Semaev

Professor
Institutt for informatikk
  • E-postIgor.Semaev@uib.no
  • Telefon+47 55 58 42 79
  • Besøksadresse
    HIB - Thormøhlensgt. 55
  • Postadresse
    Postboks 7803
    5020 Bergen
Vitenskapelig artikkel
  • Vis forfatter(e) 2020. Probabilistic analysis on Macaulay matrices over finite fields and complexity of constructing Gröbner bases. Journal of Algebra. 651-674.
  • Vis forfatter(e) 2018. Separable Statistics and Multidimensional Linear Cryptanalysis. IACR Transactions on Symmetric Cryptology (ToSC). 79-110.
  • Vis forfatter(e) 2016. Statistical and Algebraic Properties of DES. Lecture Notes in Computer Science (LNCS). 93-107.
  • Vis forfatter(e) 2016. A combinatorial problem related to sparse systems of equations. Designs, Codes and Cryptography. 1-16.
  • Vis forfatter(e) 2015. MaxMinMax problem and sparse equations over finite fields. Designs, Codes and Cryptography. 22 sider.
  • Vis forfatter(e) 2015. An application of Combinatorics in Cryptography. Electronic Notes in Discrete Mathematics. 31-35.
  • Vis forfatter(e) 2013. Improved agreeing-gluing algorithm. Mathematics in Computer Science. 321-339.
  • Vis forfatter(e) 2011. Sparse Boolean equations and circuit lattices. Designs, Codes and Cryptography. 349-364.
  • Vis forfatter(e) 2010. Sparse Boolean equations and circuit lattices. Designs, Codes and Cryptography. 16 sider.
  • Vis forfatter(e) 2010. Methods to Solve Algebraic Equations in Cryptanalysis. Tatra Mountains Mathematical Publications. 1-29.
  • Vis forfatter(e) 2009. Sparse algebraic equations over finite fields. SIAM journal on computing (Print). 388-409.
  • Vis forfatter(e) 2008. Solving Multiple Right Hand Sides linear equations. Designs, Codes and Cryptography. 147-160.
  • Vis forfatter(e) 2008. On solving sparse algebraic equations over finite fields. Designs, Codes and Cryptography. 47-60.
  • Vis forfatter(e) 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.
  • Vis forfatter(e) 2006. An algorithm to solve the discrete logarithm problem with the number field sieve. Lecture Notes in Computer Science (LNCS). 174-190.
  • Vis forfatter(e) 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.
Vitenskapelig foredrag
  • Vis forfatter(e) 2015. Statistical and Algebraic Properties of DES.
  • Vis forfatter(e) 2010. Improved Agreeing-Gluing algorithm.

Se fullstendig oversikt over publikasjoner i CRIStin.