Martin Stanek

Proceedings of the 24th Conference Information Technologies, 2024

Anomaly Detection in Certificate Transparency Logs.

[BibT_eX]

[DOI]

Richard Ostertág

Proceedings of the 24th Conference Information Technologies, 2024

2018

Insufficient properties of image encryption algorithms.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Secure by default - the case of TLS.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Weaknesses of Password Authentication Scheme Based on Geometric Hashing.

[BibT_eX]

[DOI]

Int. J. Netw. Secur., 2016

State recovery of RC4 and Spritz Revisited.

[BibT_eX]

[DOI]

Martin Gábris

IACR Cryptol. ePrint Arch., 2016

2014

Experimenting with Shuffle Block Cipher and SMT Solvers.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2014

Memory-only selection of dictionary PINs.

[BibT_eX]

[DOI]

CoRR, 2014

2013

How to choose a PIN - assessment of dictionary methods

[BibT_eX]

[DOI]

CoRR, 2013

Entropy Assessment of Windows OS Performance Counters.

[BibT_eX]

[DOI]

Richard Ostertág

CoRR, 2013

Analysis of dictionary methods for PIN selection.

[BibT_eX]

[DOI]

Comput. Secur., 2013

2012

A Note on Security Protocol for Multicast Communications.

[BibT_eX]

[DOI]

Int. J. Netw. Secur., 2012

Attacking Scrambled Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2012

Attacking M&M Collective Signature Scheme.

[BibT_eX]

[DOI]

Michal Rjasko

Fundam. Informaticae, 2012

2011

Threshold Encryption into Multiple Ciphertexts.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

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

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

2010

On Designated Verifier Signature Schemes.

[BibT_eX]

[DOI]

Michal Rjasko

IACR Cryptol. ePrint Arch., 2010

2008

Attacking LCCC Batch Verification of RSA Signatures.

[BibT_eX]

[DOI]

Int. J. Netw. Secur., 2008

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

[BibT_eX]

[DOI]

Eduard Toman

Comput. Informatics, 2008

2007

On Ciphertext Undetectability.

[BibT_eX]

[DOI]

Peter Gazi

IACR Cryptol. ePrint Arch., 2007

On High-Rate Cryptographic Compression Functions.

[BibT_eX]

[DOI]

Richard Ostertág

Comput. Artif. Intell., 2007

2006

Enforcing Policies in Content Manipulation Signature Schemes.

[BibT_eX]

[DOI]

Int. J. Netw. Secur., 2006

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

[BibT_eX]

[DOI]

Eduard Toman

Comput. Artif. Intell., 2006

Analysis of Fast Blockcipher-Based Hash Functions.

[BibT_eX]

[DOI]

Proceedings of the Computational Science and Its Applications, 2006

Unpuzzling Puzzle (analysis of a video encryption algorithm).

[BibT_eX]

[DOI]

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

2005

Fast Contract Signing with Batch Oblivious Transfer.

[BibT_eX]

[DOI]

Proceedings of the Communications and Multimedia Security, 2005

2004

Generating cryptographically strong Boolean functions using partial information.

[BibT_eX]

[DOI]

Marta Simovcová

Period. Math. Hung., 2004

Efficient Simultaneous Contract Signing.

[BibT_eX]

[DOI]

Lubica Liskova

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

1999

Integrity Testing in WWW Environment.

[BibT_eX]

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

Weaknesses in EHA Authentication and Key Distribution Protocol.

[BibT_eX]

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

1998

On Cryptographic Properties of Random Boolean Functions.

[BibT_eX]

[DOI]