Výsledky vyhledávání - "Stanislav Bulygin"

A multivariate based threshold ring signature scheme

Autor: Johannes Buchmann, Stanislav Bulygin, Albrecht Petzoldt

Publikováno v: Applicable Algebra in Engineering, Communication and Computing. 24:255-275

In Sakumoto et al. (CRYPTO 2011, LNCS, vol 6841. Springer, Berlin, pp 706–723, 2011), presented a new multivariate identification scheme, whose security is based solely on the MQ-Problem of solving systems of quadratic equations over finite fields.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0a4671a985170f54afcb9e42e1ae7eb4
https://doi.org/10.1007/s00200-013-0190-3

Zobrazit plný text záznamu

Full analysis of PRINTcipher with respect to invariant subspace attack: efficient key recovery and countermeasures

Autor: Johannes Buchmann, Stanislav Bulygin, Michael Walter

Publikováno v: Designs, Codes and Cryptography. 73:997-1022

In this paper we investigate the invariant property of PRINTcipher initially discovered by Leander et al. in their CRYPTO 2011 paper. We provide a complete study of the attack and show that there exist 64 families of weak keys for PRINTcipher---48 an

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::4ddb4469e233ea582f57615c69726471
https://doi.org/10.1007/s10623-013-9840-5

Zobrazit plný text záznamu

Improved algebraic side-channel attack on AES

Autor: Mohamed Saied Emam Mohamed, Michael Zohner, Michael Walter, Johannes Buchmann, Annelie Heuser, Stanislav Bulygin

Publikováno v: HOST

In this paper, we present improvements of the algebraic side-channel analysis of the Advanced Encryption Standard (AES) proposed in the works of M. Renauld and F.-X. Standaert. In particular, we optimize the algebraic representation of both the AES b

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0009024b43e77e024c420c8436e68421
https://doi.org/10.1007/s13389-013-0059-1

Zobrazit plný text záznamu

Selecting parameters for secure McEliece-based cryptosystems

Autor: Johannes Buchmann, Mohammed Meziani, Robert Niebuhr, Stanislav Bulygin

Publikováno v: International Journal of Information Security. 11:137-147

In 1994, Shor showed that quantum computers will be able to break cryptosystems based on the problems of integer factorization and the discrete logarithm, for example, RSA or ECC. Code-based cryptosystems are promising alternatives to public-key sche

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ac20c024c34999ff525b2a9df8cb9602
https://doi.org/10.1007/s10207-011-0153-2

Zobrazit plný text záznamu

Obtaining and Solving Systems of Equations in Key Variables Only for the Small Variants of AES

Autor: Stanislav Bulygin, Michael Brickenstein

Publikováno v: Mathematics in Computer Science. 3:185-200

This work is devoted to attacking the small scale variants of the Advanced Encryption Standard (AES) via systems that contain only the initial key variables. To this end, we investigate a system of equations that naturally arises in the AES, and then

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8885657fdd48dc3c3a626f7f661ac40f
https://doi.org/10.1007/s11786-009-0020-y

Zobrazit plný text záznamu

Bounded distance decoding of linear error-correcting codes with Gröbner bases

Autor: Ruud Pellikaan, Stanislav Bulygin

Publikováno v: Journal of Symbolic Computation, 44(12), 1626-1643. Academic Press Inc.

The problem of bounded distance decoding of arbitrary linear codes using Gröbner bases is addressed. A new method is proposed, which is based on reducing an initial decoding problem to solving a certain system of polynomial equations over a finite f

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8aadb9a31214ffe1a1eb7056555e1343
https://doi.org/10.1016/j.jsc.2007.12.003

Zobrazit plný text záznamu

Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC

Autor: Johannes Buchmann, Michael Walter, Stanislav Bulygin

Publikováno v: Information Security and Cryptology ISBN: 9783642385186
Inscrypt

In this paper we demonstrate how to use Mixed Integer Linear Programming to optimize guessing strategies for algebraic cryptanalysis with applications to the block cipher EPCBC. Using our optimized guessing strategy we are able to attack 5 rounds of

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::77da91e834828289bcddc947de6ebd6b
https://doi.org/10.1007/978-3-642-38519-3_12

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání