Stanislav Bulygin

Affiliations:
  • Technische Universität Darmstadt, Germany


According to our database1, Stanislav Bulygin authored at least 35 papers between 2005 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
On lower bounds for information set decoding over <sub>q</sub> and on the effect of partial knowledge.
Int. J. Inf. Coding Theory, 2017

2014
Full analysis of PRINTcipher with respect to invariant subspace attack: efficient key recovery and countermeasures.
Des. Codes Cryptogr., 2014

2013
Improved algebraic side-channel attack on AES.
J. Cryptogr. Eng., 2013

More on linear hulls of PRESENT-like ciphers and a cryptanalysis of full-round EPCBC-96.
IACR Cryptol. ePrint Arch., 2013

A multivariate based threshold ring signature scheme.
Appl. Algebra Eng. Commun. Comput., 2013

Foreword: computer algebra in coding theory and cryptography.
Appl. Algebra Eng. Commun. Comput., 2013

Fast Verification for Improved Versions of the UOV and Rainbow Signature Schemes.
Proceedings of the Post-Quantum Cryptography - 5th International Workshop, 2013

Many Weak Keys for PRINTcipher: Fast Key Recovery and Countermeasures.
Proceedings of the Topics in Cryptology - CT-RSA 2013, 2013

2012
Selecting parameters for secure McEliece-based cryptosystems.
Int. J. Inf. Sec., 2012

Improved Algebraic Side-Channel Attack on AES.
IACR Cryptol. ePrint Arch., 2012

Study of the invariant coset attack on PRINTcipher: more weak keys with practical key recovery.
IACR Cryptol. ePrint Arch., 2012

Linear Recurring Sequences for the UOV Key Generation Revisited.
Proceedings of the Information Security and Cryptology - ICISC 2012, 2012

Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC.
Proceedings of the Information Security and Cryptology - 8th International Conference, 2012

2011
Small Public Keys and Fast Verification for Multivariate Quadratic Public Key Systems.
IACR Cryptol. ePrint Arch., 2011

Algebraic cryptanalysis of the round-reduced and side channel analysis of the full PRINTCipher-48.
IACR Cryptol. ePrint Arch., 2011

Using SAT Solving to Improve Differential Fault Analysis of Trivium.
Proceedings of the Information Security and Assurance - International Conference, 2011

Linear Recurring Sequences for the UOV Key Generation.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

Small Public Keys and Fast Verification for $\mathcal{M}$ ultivariate $\mathcal{Q}$ uadratic Public Key Systems.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2011 - 13th International Workshop, Nara, Japan, September 28, 2011

Algebraic Cryptanalysis of the Round-Reduced and Side Channel Analysis of the Full PRINTCipher-48.
Proceedings of the Cryptology and Network Security - 10th International Conference, 2011

2010
Obtaining and Solving Systems of Equations in Key Variables Only for the Small Variants of AES.
Math. Comput. Sci., 2010

Selecting Parameters for the Rainbow Signature Scheme - Extended Version -.
IACR Cryptol. ePrint Arch., 2010

CyclicRainbow - A multivariate Signature Scheme with a Partially Cyclic Public Key based on Rainbow.
IACR Cryptol. ePrint Arch., 2010

Towards provable security of the Unbalanced Oil and Vinegar signature scheme under direct attacks.
IACR Cryptol. ePrint Arch., 2010

Abstract only: Polynomial system solving for decoding linear codes and algebraic cryptanalysis parametric polynomial system discussion: canonical comprehensive.
ACM Commun. Comput. Algebra, 2010

Selecting Parameters for the Rainbow Signature Scheme.
Proceedings of the Post-Quantum Cryptography, Third International Workshop, 2010

CyclicRainbow - A Multivariate Signature Scheme with a Partially Cyclic Public Key.
Proceedings of the Progress in Cryptology - INDOCRYPT 2010, 2010

Practical Algebraic Cryptanalysis for Dragon-Based Cryptosystems.
Proceedings of the Cryptology and Network Security - 9th International Conference, 2010

2009
Polynomial system solving for decoding linear codes and algebraic cryptanalysis.
PhD thesis, 2009

Bounded distance decoding of linear error-correcting codes with Gröbner bases.
J. Symb. Comput., 2009

A Note on the Injection Distance
CoRR, 2009

MXL<sub>3</sub>: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals.
Proceedings of the Information, Security and Cryptology, 2009

Decoding Linear Error-Correcting Codes up to Half the Minimum Distance with Gröbner Bases.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008
Noncommutative Polly Cracker-type cryptosystems and chosen-ciphertext security.
IACR Cryptol. ePrint Arch., 2008

2005
Generalized Hermitian Codes over GF(2^r)
CoRR, 2005

Chosen-ciphertext attack on noncommutative Polly Cracker
CoRR, 2005


  Loading...