default search action
Martin Stanek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Richard Ostertág, Martin Stanek:
Anomaly Detection in Certificate Transparency Logs. ITAT 2024: 190-196 - [c8]Martin Stanek:
Revisiting Monte Carlo Strength Evaluation. ITAT 2024: 197-202 - [e1]Lucie Ciencialová, Martin Holena, Róbert Jajcay, Tatiana Jajcayová, Martin Macaj, Frantisek Mráz, Richard Ostertág, Dana Pardubská, Martin Plátek, Martin Stanek:
Proceedings of the 24th Conference Information Technologies - Applications and Theory (ITAT 2024), Drienica, Slovakia, September 20-24, 2024. CEUR Workshop Proceedings 3792, CEUR-WS.org 2024 [contents] - [i18]Richard Ostertág, Martin Stanek:
Anomaly Detection in Certificate Transparency Logs. CoRR abs/2405.05206 (2024) - [i17]Martin Stanek:
Revisiting Monte Carlo Strength Evaluation. CoRR abs/2408.00124 (2024)
2010 – 2019
- 2018
- [i16]Martin Stanek:
Insufficient properties of image encryption algorithms. CoRR abs/1809.08661 (2018) - 2017
- [i15]Martin Stanek:
Secure by default - the case of TLS. CoRR abs/1708.07569 (2017) - 2016
- [j11]Martin Stanek:
Weaknesses of Password Authentication Scheme Based on Geometric Hashing. Int. J. Netw. Secur. 18(4): 798-801 (2016) - [i14]Martin Gábris, Martin Stanek:
State recovery of RC4 and Spritz Revisited. IACR Cryptol. ePrint Arch. 2016: 337 (2016) - 2014
- [i13]Martin Stanek:
Memory-only selection of dictionary PINs. CoRR abs/1404.1716 (2014) - [i12]Martin Stanek:
Weaknesses of Password Authentication Scheme Based on Geometric Hashing. IACR Cryptol. ePrint Arch. 2014: 286 (2014) - [i11]Martin Stanek:
Experimenting with Shuffle Block Cipher and SMT Solvers. IACR Cryptol. ePrint Arch. 2014: 919 (2014) - 2013
- [j10]Lubica Staneková, Martin Stanek:
Analysis of dictionary methods for PIN selection. Comput. Secur. 39: 289-298 (2013) - [i10]Lubica Staneková, Martin Stanek:
How to choose a PIN - assessment of dictionary methods. CoRR abs/1302.2656 (2013) - [i9]Richard Ostertág, Martin Stanek:
Entropy Assessment of Windows OS Performance Counters. CoRR abs/1311.3139 (2013) - 2012
- [j9]Michal Rjasko, Martin Stanek:
Attacking M&M Collective Signature Scheme. Fundam. Informaticae 114(3-4): 319-323 (2012) - [j8]Martin Stanek:
A Note on Security Protocol for Multicast Communications. Int. J. Netw. Secur. 14(1): 59-60 (2012) - [i8]Martin Stanek:
Attacking Scrambled Burrows-Wheeler Transform. IACR Cryptol. ePrint Arch. 2012: 149 (2012) - 2011
- [c7]Martin Stanek:
Threshold Encryption into Multiple Ciphertexts. FPS 2011: 62-72 - [i7]Martin Stanek:
Extending Baby-step Giant-step algorithm for FACTOR problem. IACR Cryptol. ePrint Arch. 2011: 59 (2011) - [i6]Martin Stanek:
Threshold Encryption into Multiple Ciphertexts. IACR Cryptol. ePrint Arch. 2011: 107 (2011) - 2010
- [i5]Michal Rjasko, Martin Stanek:
On Designated Verifier Signature Schemes. IACR Cryptol. ePrint Arch. 2010: 191 (2010) - [i4]Michal Rjasko, Martin Stanek:
Attacking M&M Collective Signature Scheme. IACR Cryptol. ePrint Arch. 2010: 308 (2010)
2000 – 2009
- 2008
- [j7]Eduard Toman, Daniel Olejár, Martin Stanek:
Average Degree in the Interval Graph of a Random Boolean Function. Comput. Informatics 27(4): 627-638 (2008) - [j6]Martin Stanek:
Attacking LCCC Batch Verification of RSA Signatures. Int. J. Netw. Secur. 6(2): 238-240 (2008) - 2007
- [j5]Richard Ostertág, Martin Stanek:
On High-Rate Cryptographic Compression Functions. Comput. Artif. Intell. 26(1): 77-87 (2007) - [i3]Peter Gazi, Martin Stanek:
On Ciphertext Undetectability. IACR Cryptol. ePrint Arch. 2007: 388 (2007) - 2006
- [j4]Eduard Toman, Martin Stanek:
Analysis of Greedy Algorithm for Vertex Covering of Random Graph by Cubes. Comput. Artif. Intell. 25(5): 393-404 (2006) - [j3]Martin Stanek:
Enforcing Policies in Content Manipulation Signature Schemes. Int. J. Netw. Secur. 3(1): 65-72 (2006) - [c6]Martin Stanek, Lubica Staneková:
Unpuzzling Puzzle (analysis of a video encryption algorithm). AINA (2) 2006: 20-24 - [c5]Martin Stanek:
Analysis of Fast Blockcipher-Based Hash Functions. ICCSA (3) 2006: 426-435 - [i2]Martin Stanek:
Attacking LCCC Batch Verification of RSA Signatures. IACR Cryptol. ePrint Arch. 2006: 111 (2006) - 2005
- [c4]Lubica Staneková, Martin Stanek:
Fast Contract Signing with Batch Oblivious Transfer. Communications and Multimedia Security 2005: 1-10 - [i1]Richard Ostertág, Martin Stanek:
On High-Rate Cryptographic Compression Functions. IACR Cryptol. ePrint Arch. 2005: 152 (2005) - 2004
- [j2]Marta Simovcová, Martin Stanek:
Generating cryptographically strong Boolean functions using partial information. Period. Math. Hung. 49(1): 119-130 (2004) - [c3]Lubica Liskova, Martin Stanek:
Efficient Simultaneous Contract Signing. SEC 2004: 441-456
1990 – 1999
- 1999
- [c2]Martin Stanek, Daniel Olejár:
Weaknesses in EHA Authentication and Key Distribution Protocol. Communications and Multimedia Security 1999: 87-95 - [c1]Martin Stanek, Daniel Olejár:
Integrity Testing in WWW Environment. IICIS 1999: 111-120 - 1998
- [j1]Daniel Olejár, Martin Stanek:
On Cryptographic Properties of Random Boolean Functions. J. Univers. Comput. Sci. 4(8): 705-717 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: