The return of coppersmith's attack: Practical factorization of widely used rsa moduli M Nemec, M Sys, P Svenda, D Klinec, V Matyas Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017 | 192 | 2017 |
On the interpretation of results from the NIST statistical test suite M Sys, Z Riha, V Matyas, K MARTON, A SUCIU SCIENCE AND TECHNOLOGY 18 (1), 18-32, 2015 | 108 | 2015 |
Faster randomness testing with the NIST statistical test suite M Sýs, Z Říha Security, Privacy, and Applied Cryptography Engineering: 4th International …, 2014 | 64 | 2014 |
Minerva: The curse of ECDSA nonces: Systematic analysis of lattice attacks on noisy leakage of bit-length of ECDSA nonces J Jancar, V Sedlacek, P Svenda, M Sys IACR Transactions on Cryptographic Hardware and Embedded Systems, 281-308, 2020 | 56 | 2020 |
Isotopy of Latin squares in cryptography O Grošek, M Sýs Tatra Mountains Mathematical Publications 45 (1), 27-36, 2010 | 25 | 2010 |
Algorithm 970: Optimizing the NIST statistical test suite and the Berlekamp-Massey algorithm M Sýs, Z Říha, V Matyáš ACM Transactions on Mathematical Software (TOMS) 43 (3), 1-11, 2016 | 19 | 2016 |
The Efficient Randomness Testing using Boolean Functions. M Sýs, D Klinec, P Svenda SECRYPT, 92-103, 2017 | 17 | 2017 |
Booltest: The fast randomness testing strategy based on Boolean functions with application to DES, 3-DES, MD5, MD6 and SHA-256 M Sýs, D Klinec, K Kubíček, P Švenda E-Business and Telecommunications: 14th International Joint Conference …, 2019 | 15 | 2019 |
Constructing empirical tests of randomness M Sýs, P Švenda, M Ukrop, V Matyáš 2014 11th International Conference on Security and Cryptography (SECRYPT), 1-9, 2014 | 14 | 2014 |
A note on algebraic properties of quasigroups in Edon80 M Vojvoda, M Sýs, M Jókay Workshop Record of SASC, 2007 | 11 | 2007 |
I Want to Break Square-free: The 4p-1 Factorization Method and Its RSA Backdoor Viability. V Sedlacek, D Klinec, M Sýs, P Svenda, V Matyas ICETE (2), 25-36, 2019 | 6 | 2019 |
Eacirc, Framework for autmatic search for problem solving circuit via evolutionary algorithms, Centre for Research on Cryptography and Security, Masaryk University P Švenda, M Ukrop, M Sýs | 6 | 2012 |
A Bad Day to Die Hard: Correcting the Dieharder Battery M Sýs, L Obrátil, V Matyáš, D Klinec Journal of Cryptology 35, 1-20, 2022 | 5 | 2022 |
Randomness testing: Result interpretation and speed M Sýs, V Matyáš The New Codebreakers: Essays Dedicated to David Kahn on the Occasion of His …, 2016 | 5 | 2016 |
The zodiac killer ciphers H Raddum, M Sýs Tatra Mountains Mathematical Publications 45 (1), 75-91, 2010 | 5 | 2010 |
Evolving boolean functions for fast and efficient randomness testing V Mrazek, M Sys, Z Vasicek, L Sekanina, V Matyas Proceedings of the Genetic and Evolutionary Computation Conference, 1302-1309, 2018 | 3 | 2018 |
NIST statistical test suite–result interpretation and optimization M Sýs, Z Říha TNS, 2015 | 3 | 2015 |
DiSSECT: distinguisher of standard and simulated elliptic curves via traits V Sedlacek, V Suchanek, A Dufka, M Sys, V Matyas International Conference on Cryptology in Africa, 493-517, 2022 | 2 | 2022 |
DiSSECT: Distinguisher of Standard and Simulated Elliptic Curves via Traits V Sedláček, V Suchánek, A Dufka, M Sýs, V Matyáš Springer, Cham, 2022 | 1 | 2022 |
Large-scale randomness study of security margins for 100+ cryptographic functions K Dušan, M Sýs, K Kubicek, P Švenda, V Matyáš Proceedings of the 19th International Conference on Security and …, 2022 | 1 | 2022 |