Petr Svenda
Petr Svenda
Associate Professor of Computer Science, Masaryk University
Verified email at - Homepage
Cited by
Cited by
The return of coppersmith's attack: Practical factorization of widely used rsa moduli
M Nemec, M Sys, P Svenda, D Klinec, V Matyas
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
The {Million-Key}{Question—Investigating} the Origins of {RSA} Public Keys
P Švenda, M Nemec, P Sekan, R Kvašňovský, D Formánek, D Komárek, ...
25th USENIX Security Symposium (USENIX Security 16), 893-910, 2016
Towards true random number generation in mobile environments
J Bouda, J Krhovjak, V Matyas, P Svenda
Nordic Conference on Secure IT Systems, 179-189, 2009
A touch of evil: High-assurance cryptographic hardware from untrusted components
V Mavroudis, A Cerulli, P Svenda, D Cvrcek, D Klinec, G Danezis
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
Smart dust security–key infection revisited
D Cvrcek, P Svenda
Electronic Notes in Theoretical Computer Science 157 (3), 11-25, 2006
Measuring popularity of cryptographic libraries in internet-wide scans
M Nemec, D Klinec, P Svenda, P Sekan, V Matyas
Proceedings of the 33rd Annual Computer Security Applications Conference …, 2017
Evolutionary design of secrecy amplification protocols for wireless sensor networks
P Švenda, L Sekanina, V Matyáš
Proceedings of the second ACM conference on Wireless network security, 225-236, 2009
Minerva: The curse of ECDSA nonces: Systematic analysis of lattice attacks on noisy leakage of bit-length of ECDSA nonces
J Jancar, V Sedlacek, P Svenda, M Sys
IACR Transactions on Cryptographic Hardware and Embedded Systems, 281-308, 2020
The sources of randomness in mobile devices
J Krhovják, P Švenda, V Matyáš
Proceedings of the 12th Nordic Workshop on Secure IT Systems. NordSec, 2007
Two improvements of random key predistribution for wireless sensor networks
J Kůr, V Matyáš, P Švenda
International Conference on Security and Privacy in Communication Systems, 61-75, 2012
Autorizace elektronických transakcí a autentizace dat i uživatelů
VV Matyáš, J Krhovják, V Lorenc, M Kumpošt, Z Říha, V Holer, K Malinka, ...
Masarykova univerzita, 2008
Constructing empirical tests of randomness
VM Marek Sys, Petr Svenda, Martin Ukrop
SECRYPT 2014 Proceedings of the 11th International Conference on Security …, 2014
The Efficient Randomness Testing using Boolean Functions.
M Sýs, D Klinec, P Svenda
SECRYPT, 92-103, 2017
A new approach to secrecy amplification in partially compromised networks
R Ošťádal, P Švenda, V Matyáš
International Conference on Security, Privacy, and Applied Cryptography …, 2014
Towards cryptographic function distinguishers with evolutionary circuits
P Svenda, M Ukrop, V Matyáš
2013 International Conference on Security and Cryptography (SECRYPT), 1-12, 2013
The Future of Identity in the Information Society: 4th IFIP WG 9.2, 9.6, 11.6, 11.7/FIDIS International Summer School, Brno, Czech Republic, September 1-7, 2008, Revised …
V Matyáš, S Fischer-Hübner, D Cvrcek, P Švenda
Springer, 2009
Booltest: The fast randomness testing strategy based on Boolean functions with application to DES, 3-DES, MD5, MD6 and SHA-256
M Sýs, D Klinec, K Kubíček, P Švenda
International Conference on E-Business and Telecommunications, 123-149, 2017
Basic comparison of Modes for Authenticated-Encryption (IAPM, XCBC, OCB, CCM, EAX, CWC, GCM, PCFB, CS)
P Švenda
URL https://www. fi. muni. cz/~ xsvenda/docs/AE_comparison_ ipics04. pdf 35, 2016
On secrecy amplification protocols
R Ošťádal, P Švenda, V Matyáš
IFIP International Conference on Information Security Theory and Practice, 3-19, 2015
Secure logging of retained data for an anonymity service
S Köpsell, P Švenda
IFIP PrimeLife International Summer School on Privacy and Identity …, 2009
The system can't perform the operation now. Try again later.
Articles 1–20