Dr. Stanislav Bulygin

Stanislav Bulygin

Center for Advanced Security Research Darmstadt (CASED)
Mornewegstrasse, 32
64293 Darmstadt
Germany

4. Etage, 4.3.29

Tel.: 06151/16-70484

Email: Stanislav.Bulygin[[[a_t]]]cased.de

Related Information at CASED

Former homepage in Kaiserslautern



Contents

- Research Interests

- Curriculum Vitae

- Publications

- Talks

- Links

Research Interests

  • Computer algebra
  • Algebraic cryptoanalysis
  • Post-Quantum cryptography
  • Algebraic coding theory

Curriculum Vitae

My CV in pdf-format

1999-2005 Study of Mathematics at the Kyiv Shevchenko University (Kyiv, Ukraine)
2004 Bachelor of Science in Mathematics at the Kyiv Shevchenko University
2004-2006 Study of Mathematics at the University of Kaiserslautern (Kaiserslautern, Germany)
2005Diploma in Mathematics at the Kyiv Shevchenko University
2006 Master of Science in Mathematics at the University of Kaiserslautern
2006-2009 Ph.D. Student at the University of Kaiserslautern
seit 01.07.2009 Post doctoral fellow at the Center for Advanced Security Research Darmstadt (CASED)

Publications

Scientific Papers
  1. Stanislav Bulygin: Computer algebra in coding theory and cryptanalysis: Polynomial system solving for decoding linear codes and algebraic cryptanalysis. Südwestdeutscher Verlag für Hochschulschriften (2009).
  2. Stanislav Bulygin: Polynomial system solving for decoding linear codes and algebraic cryptanalysis. Ph.D. Thesis, University of Kaiserslautern (2009)
  3. Stanislav Bulygin, Ruud Pellikaan: Bounded distance decoding of linear error-correcting codes with Gröbner bases. Journal of Symbolic Computation Special Issue "Gröbner Bases Techniques in Cryptography and Coding Theory", Volume 44, Issue 12, pp. 1626-1643, (2009)
  4. Ruud Pellikaan, Xin-Wen Wu, Stanislav Bulygin: Codes and Cryptography on Algebraic Curves. A book in progress, to be published by Cambridge University Press (2011-2012)
  5. Stanislav Bulygin, Michael Brickenstein: Obtaining and solving systems of equations in key variables only for the small variants of AES. Accepted to Mathematics in Computer science Special Issue "Symbolic Computation and Cryptography" (2009)
  6. Maria Bras-Amoros, Stanislav Bulygin: Towards a Better Understanding of the Semigroup Tree. Semigroup Forum, no.3, pp. 561-574 (2009)
  7. Stanislav Bulygin, Ruud Pellikaan: Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases. In Sala, M.; Mora, T.; Perret, L.; Sakata, S.; Traverso, C. (Eds.) "Gröbner Bases, Coding, and Cryptography" (RISC Book Series,Springer), pp.361-365 (2009)
  8. Stanislav Bulygin, Ruud Pellikaan: Decoding and finding the minimum distance with Gröbner bases: history and new insights. A chapter to appear in the "Selected Topics in Information and Coding Theory", World Scientific (2009)
  9. Michael Brickenstein, Stanislav Bulygin: Attacking AES via Solving Systems in the Key Variables Only. In J.-C. Faugere, D. Wang (Eds.)Proceedings of the First International Conference on Symbolic Computation and Cryptography, Beijing, China, April 28-30, pp.118-123 (2008)
  10. Tapan Rain, Stanislav Bulygin: Noncommutative Polly Cracker-type cryptosystems and chosen-ciphertext security. Preprint (2008)
  11. Stanislav Bulygin, Ruud Pellikaan: Decoding error-correcting codes with Groebner bases. Proceedings of the 28-th Symposium on Information Theory in the Benelux, Enschede, The Netherlands, May 24-25, pp.3-10 (2007)
  12. Stanislav Bulygin: Some Problems from Coding Theory and Cryptography. Thesis submitted for the degree of Master of Science. Technische Universität Kaiserslautern (2006)
  13. Stanislav Bulygin: Generalized Hermitian Codes over GF(2^r). IEEE Transactions on Information Theory, vol.52, no.10, pp.4664-4669 (2006)
  14. Stanislav Bulygin: On estimation of one cryptographic function using algebraic geometric codes technique. Bulletin of the University of Kiev, Series: Physics&Mathematics, no.2, pp. 24-28 (2003)

Talks

  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 Groebner 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)

Links

Center for Advanced Security Research Darmstadt (CASED)
DASMOD: Dependable Adaptive Systems and Mathematical Modeling
Kryptographie und Codierungstheorie
Systeme für Computeralgebra

Printerenglisch deutsche Flagge   Impressum