Marek Sys
Cited by
Cited by
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
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
Faster randomness testing with the NIST statistical test suite
M Sıs, Z Říha
International conference on security, privacy, and applied cryptography …, 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
Isotopy of Latin squares in cryptography
O Grošek, M Sıs
Tatra Mountains Mathematical Publications 45 (1), 27-36, 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
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
The Efficient Randomness Testing using Boolean Functions.
M Sıs, D Klinec, P Svenda
SECRYPT, 92-103, 2017
A note on algebraic properties of quasigroups in edon80
M Vojvoda, M Sıs, M Jókay
Workshop Record of SASC, 2007
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
International Conference on E-Business and Telecommunications, 123-149, 2017
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
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
Randomness testing: Result interpretation and speed
M Sıs, V Matyáš
The New Codebreakers, 389-395, 2016
The zodiac killer ciphers
H Raddum, M Sıs
Tatra Mountains Mathematical Publications 45 (1), 75-91, 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
DiSSECT: Distinguisher of Standard & Simulated Elliptic Curves via Traits
V Sedlacek, V Suchanek, A Dufka, M Sys, V Matyas
Cryptology ePrint Archive, 2022
Efficient on-chip randomness testing utilizing machine learning techniques
V Mrazek, L Sekanina, R Dobai, M Sys, P Svenda
IEEE Transactions on Very Large Scale Integration (VLSI) Systems 27 (12 …, 2019
Mathematical and Engineering Methods in Computer Science: 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers
A Kucera, TA Henzinger, J Nešetřil, T Vojnar, D Antos
Springer, 2013
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), 1-20, 2022
NIST Statistical Test Suite–result interpretation and optimization
M Sıs, Z Říha
TNS, 2015
The system can't perform the operation now. Try again later.
Articles 1–20