activity
20132024
most citedSecure by default - the case of TLS

1 citations · 1 across the 8 of their papers we have counts for

collaborators

9 papers

cs.CR2024

Bad Crypto: Chessography and Weak Randomness of Chess Games

Martin Stanek

This short communication shows that the Chessography encryption scheme is incorrect, redundant, and the the security claims based on the complexity of chess games are unjustified.…

cs.CR2024

Cryptographic Keywords in NVD: Statistics and Visualization

Martin Stanek

A preliminary attempt to use cryptographic keywords and analyze vulnerabilities published in the National Vulnerability Database is presented. Basic statistics and visualizations a…

cs.CR2024

Revisiting Monte Carlo Strength Evaluation

Martin Stanek

The Monte Carlo method, proposed by Dell'Amico and Filippone, estimates a password's rank within a probabilistic model for password generation, i.e., it determines the password's s…

cs.CR2024

Anomaly Detection in Certificate Transparency Logs

Richard Ostertág, Martin Stanek

We propose an anomaly detection technique for X.509 certificates utilizing Isolation Forest. This method can be beneficial when compliance testing with X.509 linters proves unsatis…

cs.CR2018

Insufficient properties of image encryption algorithms

Martin Stanek

We analyze the security of recently proposed image encryption scheme [1]. We show that the scheme is insecure and the methods used to evaluate its security are insufficient. By des…

cs.CR2017★ 1 cited

Secure by default - the case of TLS

Martin Stanek

Default configuration of various software applications often neglects security objectives. We tested the default configuration of TLS in dozen web and application servers. The resu…

cs.CR2014

Memory-only selection of dictionary PINs

Martin Stanek

We estimate the security of dictionary-based PINs (Personal Identification Numbers) that a user selects from his/her memory without any additional aids. The estimates take into acc…

cs.CR2013

Entropy Assessment of Windows OS Performance Counters

Richard Ostertág, Martin Stanek

The security of many cryptographic constructions depends on random number generators for providing unpredictable keys, nonces, initialization vectors and other parameters. Modern o…

cs.CR2013

How to choose a PIN - assessment of dictionary methods

Lubica Staneková, Martin Stanek

Personal Identification Numbers (PINs) are commonly used as an authentication mechanism. An important security requirement is that PINs should be hard to guess for an attacker. On…