On Cryptographic Properties of Random Boolean Functions. - Daniel Olejár; Martin Stanek (J. Univers. Comput. Sci., 1998)

Weaknesses in EHA Authentication and Key Distribution Protocol. - Martin Stanek; Daniel Olejár (Communications and Multimedia Security, 1999)

Integrity Testing in WWW Environment. - Martin Stanek; Daniel Olejár (IICIS, 1999)

Efficient Simultaneous Contract Signing. - Lubica Liskova; Martin Stanek (SEC, 2004)

Generating cryptographically strong Boolean functions using partial information. - Marta Simovcová; Martin Stanek (Period. Math. Hung., 2004)

Fast Contract Signing with Batch Oblivious Transfer. - Lubica Staneková; Martin Stanek (Communications and Multimedia Security, 2005)

Unpuzzling Puzzle (analysis of a video encryption algorithm). - Martin Stanek; Lubica Staneková (AINA (2), 2006)

Analysis of Fast Blockcipher-Based Hash Functions. - Martin Stanek (ICCSA (3), 2006)

Analysis of Greedy Algorithm for Vertex Covering of Random Graph by Cubes. - Eduard Toman; Martin Stanek (Comput. Artif. Intell., 2006)

Enforcing Policies in Content Manipulation Signature Schemes. - Martin Stanek (Int. J. Netw. Secur., 2006)

On High-Rate Cryptographic Compression Functions. - Richard Ostertág; Martin Stanek (Comput. Artif. Intell., 2007)

On Ciphertext Undetectability. - Peter Gazi; Martin Stanek (IACR Cryptol. ePrint Arch., 2007)

Average Degree in the Interval Graph of a Random Boolean Function. - Eduard Toman; Daniel Olejár; Martin Stanek (Comput. Informatics, 2008)

Attacking LCCC Batch Verification of RSA Signatures. - Martin Stanek (Int. J. Netw. Secur., 2008)

On Designated Verifier Signature Schemes. - Michal Rjasko; Martin Stanek (IACR Cryptol. ePrint Arch., 2010)

Extending Baby-step Giant-step algorithm for FACTOR problem. - Martin Stanek (IACR Cryptol. ePrint Arch., 2011)

Threshold Encryption into Multiple Ciphertexts. - Martin Stanek (IACR Cryptol. ePrint Arch., 2011)

Attacking M&M Collective Signature Scheme. - Michal Rjasko; Martin Stanek (Fundam. Informaticae, 2012)

Attacking Scrambled Burrows-Wheeler Transform. - Martin Stanek (IACR Cryptol. ePrint Arch., 2012)

A Note on Security Protocol for Multicast Communications. - Martin Stanek (Int. J. Netw. Secur., 2012)

Analysis of dictionary methods for PIN selection. - Lubica Staneková; Martin Stanek (Comput. Secur., 2013)

Entropy Assessment of Windows OS Performance Counters. - Richard Ostertág; Martin Stanek (CoRR, 2013)

How to choose a PIN - assessment of dictionary methods - Lubica Staneková; Martin Stanek (CoRR, 2013)

Memory-only selection of dictionary PINs. - Martin Stanek (CoRR, 2014)

Experimenting with Shuffle Block Cipher and SMT Solvers. - Martin Stanek (IACR Cryptol. ePrint Arch., 2014)

State recovery of RC4 and Spritz Revisited. - Martin Gábris; Martin Stanek (IACR Cryptol. ePrint Arch., 2016)

Weaknesses of Password Authentication Scheme Based on Geometric Hashing. - Martin Stanek (Int. J. Netw. Secur., 2016)

Secure by default - the case of TLS. - Martin Stanek (CoRR, 2017)

Insufficient properties of image encryption algorithms. - Martin Stanek (CoRR, 2018)

Anomaly Detection in Certificate Transparency Logs. - Richard Ostertág; Martin Stanek (ITAT, 2024)

Revisiting Monte Carlo Strength Evaluation. - Martin Stanek (ITAT, 2024)

Cryptographic Keywords in NVD: Statistics and Visualization. - Martin Stanek (CoRR, 2024)

Bad Crypto: Chessography and Weak Randomness of Chess Games. - Martin Stanek (CoRR, 2024)

Differential MITM attacks on SLIM and LBCIoT. - Peter Grochal; Martin Stanek (IACR Cryptol. ePrint Arch., 2024)