Stanislav Bulygin Talks
<
Contact
Research Interests
Curriculum Vitae
Publications
Teaching
Talks
Links
Files
Fun
1 : Symbolic methods in cryptanalysis and coding theory (short overview). 15.12, Bonn, Germany (2008).
2 : Complexity issues in decoding linear codes via polynomial systems solving. 29.07, Hagenberg, Austria (2008).
3 : Obtaining and solving systems of equations in key variables only for the small variants of AES. 27.07, Hagenberg, Austria (2008).
4 : Decoding linear codes via polynomial systems solving. Generalized Newton identities for linear codes. 05.07, Soria, Spain (2008).
5 : Decoding and finding the minimum distance of codes with Gröbner bases. 04.07, Soria, Spain (2008).
6 : Algebraic-geometry codes in SINGULAR. 03.07, Soria, Spain (2008).
7 : Attacking AES via Solving Systems in the Key Variables Only. 29.04, Beijing, China (2008).
8 : Decoding linear codes via systems solving: complexity issues and generalized Newton identities. 14.03, Valladolid, Spain (2008).
9 : Decoding linear codes with Groebner bases. Part II: Experimental results and comparison of methods. 09.10, Segovia, Spain (2007).
10 : On decoding up to error correcting capacity of linear error-correcting codes with Gröbner bases. 25.06, Strobl, Austria (2007).
11 : Decoding linear codes via solving systems of polynomial equations. 16.04, Minneapolis, USA (2007).
12 : Some Problems from Coding Theory and Cryptography. 26.03, Berlin, Germany (2007).
13 : New developments in the theory of Gröbner bases to formal verification, cryptography, and coding theory. 28.02, Kaiserslautern, Germany (2007).
14 : Decoding and finding the minimum distance of error-correcting codes with Groebner bases. 30.11, Vught, Netherlands (2006).
15 : Decoding Linear Error-correcting Codes with Groebner Bases. 27.10, Paris, France (2006).
16 : Non-commutative Polly Cracker: Chosen-ciphertext attacks. 17.05, Special Semester on Groebner Bases, Linz, Austria (2006).
17 : Finding Minimum Distance and Decoding Linear Error-correcting Codes with Groebner Bases. 03.05, Special Semester on Groebner Bases, Linz, Austria (2006).
18 : Non-commutative Polly Cracker: Chosen-ciphertext attacks. 25.01, Ruhr Universitaet Bochum (2006).
19 : Decoding AG codes with Gröbner bases. 18.01, TU Kaiserslautern (2006).
20 : Non-Commutative Polly Cracker Cryptosystem Security Issues. 12.12, TU Kaiserslautern (2005).
21 : Generalized Hermitian Codes over GF(2^r). 25.05, Combinatorial Theory Seminar, TU Eindhoven, Netherlands (2005).
22 : Generalized Hermitian Codes over GF(2^r). 11.02, TU Kaiserslautern (2005).
23 : On estimation of one cryptographic function using algebraic geometric codes technique (in Russian). Information Security Seminar, National Technical University, Kiev, Ukraine (2003).
Univ. of KaiserslauternDept. of MathematicsWG Algebra & GeometryCAS SINGULAR KIS