Martin Stanek

According to our database, Martin Stanek authored at least 29 papers between 1998 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2018

Insufficient properties of image encryption algorithms.

Martin Stanek

CoRR, 2018

2017

Secure by default - the case of TLS.

Martin Stanek

CoRR, 2017

2016

Weaknesses of Password Authentication Scheme Based on Geometric Hashing.

Martin Stanek

Int. J. Netw. Secur., 2016

State recovery of RC4 and Spritz Revisited.

Martin Gábris, Martin Stanek

IACR Cryptol. ePrint Arch., 2016

2014

Experimenting with Shuffle Block Cipher and SMT Solvers.

Martin Stanek

IACR Cryptol. ePrint Arch., 2014

Memory-only selection of dictionary PINs.

Martin Stanek

CoRR, 2014

2013

How to choose a PIN - assessment of dictionary methods

Lubica Staneková, Martin Stanek

CoRR, 2013

Entropy Assessment of Windows OS Performance Counters.

Richard Ostertág, Martin Stanek

CoRR, 2013

Analysis of dictionary methods for PIN selection.

Lubica Staneková, Martin Stanek

Comput. Secur., 2013

2012

A Note on Security Protocol for Multicast Communications.

Martin Stanek

Int. J. Netw. Secur., 2012

Attacking Scrambled Burrows-Wheeler Transform.

Martin Stanek

IACR Cryptol. ePrint Arch., 2012

Attacking M&M Collective Signature Scheme.

Michal Rjasko, Martin Stanek

Fundam. Informaticae, 2012

2011

Threshold Encryption into Multiple Ciphertexts.

Martin Stanek

IACR Cryptol. ePrint Arch., 2011

Extending Baby-step Giant-step algorithm for FACTOR problem.

Martin Stanek

IACR Cryptol. ePrint Arch., 2011

2010

On Designated Verifier Signature Schemes.

Michal Rjasko, Martin Stanek

IACR Cryptol. ePrint Arch., 2010

2008

Attacking LCCC Batch Verification of RSA Signatures.

Martin Stanek

Int. J. Netw. Secur., 2008

Average Degree in the Interval Graph of a Random Boolean Function.

Eduard Toman, Daniel Olejár, Martin Stanek

Comput. Informatics, 2008

2007

On Ciphertext Undetectability.

Peter Gazi, Martin Stanek

IACR Cryptol. ePrint Arch., 2007

On High-Rate Cryptographic Compression Functions.

Richard Ostertág, Martin Stanek

Comput. Artif. Intell., 2007

2006

Enforcing Policies in Content Manipulation Signature Schemes.

Martin Stanek

Int. J. Netw. Secur., 2006

Analysis of Greedy Algorithm for Vertex Covering of Random Graph by Cubes.

Eduard Toman, Martin Stanek

Comput. Artif. Intell., 2006

Analysis of Fast Blockcipher-Based Hash Functions.

Martin Stanek

Proceedings of the Computational Science and Its Applications, 2006

Unpuzzling Puzzle (analysis of a video encryption algorithm).

Martin Stanek, Lubica Staneková

Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 2006

2005

Fast Contract Signing with Batch Oblivious Transfer.

Lubica Staneková, Martin Stanek

Proceedings of the Communications and Multimedia Security, 2005

2004

Generating cryptographically strong Boolean functions using partial information.

Marta Simovcová, Martin Stanek

Period. Math. Hung., 2004

Efficient Simultaneous Contract Signing.

Lubica Liskova, Martin Stanek

Proceedings of the Security and Protection in Information Processing Systems, 2004

1999

Integrity Testing in WWW Environment.

Martin Stanek, Daniel Olejár

Proceedings of the Integrity and Internal Control in Information Systems, 1999

Weaknesses in EHA Authentication and Key Distribution Protocol.

Martin Stanek, Daniel Olejár

Proceedings of the Secure Information Networks: Communications and Multimedia Security, 1999

1998

On Cryptographic Properties of Random Boolean Functions.

Daniel Olejár, Martin Stanek

J. Univers. Comput. Sci., 1998