Marek Sýs

Orcid: 0000-0003-0534-5916

According to our database1, Marek Sýs authored at least 17 papers between 2012 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
A Bad Day to Die Hard: Correcting the Dieharder Battery.
J. Cryptol., 2022

DiSSECT: Distinguisher of Standard & Simulated Elliptic Curves via Traits.
IACR Cryptol. ePrint Arch., 2022

Large-scale Randomness Study of Security Margins for 100+ Cryptographic Functions.
Proceedings of the 19th International Conference on Security and Cryptography, 2022

DiSSECT: Distinguisher of Standard and Simulated Elliptic Curves via Traits.
Proceedings of the Progress in Cryptology, 2022

2020
Minerva: The curse of ECDSA nonces Systematic analysis of lattice attacks on noisy leakage of bit-length of ECDSA nonces.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2020

Minerva: The curse of ECDSA nonces.
IACR Cryptol. ePrint Arch., 2020

2019
Efficient On-Chip Randomness Testing Utilizing Machine Learning Techniques.
IEEE Trans. Very Large Scale Integr. Syst., 2019

I Want to Break Square-free: The 4p - 1 Factorization Method and Its RSA Backdoor Viability.
Proceedings of the 16th International Joint Conference on e-Business and Telecommunications, 2019

2018
Evolving boolean functions for fast and efficient randomness testing.
Proceedings of the Genetic and Evolutionary Computation Conference, 2018

2017
Algorithm 970: Optimizing the NIST Statistical Test Suite and the Berlekamp-Massey Algorithm.
ACM Trans. Math. Softw., 2017

The Efficient Randomness Testing using Boolean Functions.
Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017), 2017

BoolTest: The Fast Randomness Testing Strategy Based on Boolean Functions with Application to DES, 3-DES, MD5, MD6 and SHA-256.
Proceedings of the E-Business and Telecommunications - 14th International Joint Conference, 2017

The Return of Coppersmith's Attack: Practical Factorization of Widely Used RSA Moduli.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Randomness Testing: Result Interpretation and Speed.
Proceedings of the New Codebreakers, 2016

2014
Faster Randomness Testing with the NIST Statistical Test Suite.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2014

Constructing Empirical Tests of Randomness.
Proceedings of the SECRYPT 2014, 2014

2012
Ciphertext-Only Attack on Gentry-Halevi Implementation of Somewhat Homomorphic Scheme.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012


  Loading...