GOST (block cipher) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "GOST (block cipher)" in English language version.

refsWebsite

Global rank English rank

5,032^nd place

3,357^th place

2^nd place

2^nd place

1web.archive.org

1^st place

1^st place

low place

low place

207^th place

136^th place

6^th place

6^th place

1,185^th place

840^th place

low place

low place

low place

low place

acm.org

dl.acm.org

Orhun Kara (2008). "Reflection Cryptanalysis of Some Ciphers".

archive.org

Schneier, Bruce (1996). Applied cryptography : protocols, algorithms, and source code in C (2. ed., [Nachdr.] ed.). New York [u.a.]: Wiley. ISBN 978-0-471-11709-4.

din.de

"Draft of ISO/IEC JTC 1/SC 27 Standing Document No. 12 (SD12) on the Assessment of Cryptographic Techniques and Key Lengths, 4th edition" (PDF). 2016.

doi.org

Isobe, Takanori (2011). "A Single-Key Attack on the Full GOST Block Cipher". Fast Software Encryption. Lecture Notes in Computer Science. Vol. 6733. pp. 290–305. doi:10.1007/978-3-642-21702-9_17. ISBN 978-3-642-21701-2.
Dinur, Itai; Dunkelman, Orr; Shamir, Adi (2012). "Improved Attacks on Full GOST". Fast Software Encryption. Lecture Notes in Computer Science. Vol. 7549. pp. 9–28. doi:10.1007/978-3-642-34047-5_2. ISBN 978-3-642-34046-8.

iacr.org

eprint.iacr.org

Courtois, Nicolas T. (9 May 2011). "Security Evaluation of GOST 28147-89 In View Of International Standardisation". Cryptology ePrint Archive. IACR. Until 2011 researchers unanimously agreed that GOST could or should be very secure, which was summarised in 2010 in these words: despite considerable cryptanalytic efforts spent in the past 20 years, GOST is still not broken". Unhappily, it was recently discovered that GOST can be broken and is a deeply flawed cipher
Courtois, Nicolas T. (9 May 2011). "Security Evaluation of GOST 28147-89 In View Of International Standardisation". Cryptology ePrint Archive. IACR. Until 2011 researchers unanimously agreed that GOST could or should be very secure, which was summarised in 2010 in these words: despite considerable cryptanalytic efforts spent in the past 20 years, GOST is still not broken". Unhappily, it was recently discovered that GOST can be broken and is a deeply flawed cipher
Nicolas T. Courtois; Michał Miształ (2011). "Differential Cryptanalysis of GOST". IACR.
Nicolas T. Courtois (2012). "An Improved Differential Attack on Full GOST" (PDF). IACR.
Courtois, Nicolas T. (Jun 13, 2011). "Algebraic Complexity Reduction and Cryptanalysis of GOST" (PDF). Cryptology ePrint Archive. IACR.

iacr.org

Eli Biham; Orr Dunkelman; Nathan Keller (2007). "Improved Slide Attacks" (PDF).

psu.edu

citeseer.ist.psu.edu

Saarinen, Markku-Juhani (1998). "A chosen key attack against the secret S-boxes of GOST". We show that a simple "black box" chosen-key attack against GOST can recover secret S-boxes with approximately 2^32 encryptions {{cite journal}}: Cite journal requires |journal= (help)

sav.sk

Nicolas T. Courtois; Jerzy A. Gawinecki; Guangyan Song (2012). "CONTRADICTION IMMUNITY AND GUESS-THEN-DETERMINE ATTACKS ON GOST" (PDF). Versita. Retrieved 2014-08-25.

tc26.ru

"GOST R 34.12-2015 (Russian only)" (PDF). Archived from the original (PDF) on 2015-09-24. Retrieved 2015-08-28.

web.archive.org

"GOST R 34.12-2015 (Russian only)" (PDF). Archived from the original (PDF) on 2015-09-24. Retrieved 2015-08-28.