Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Viliam Hromada"'
Autor:
Viliam Hromada, Otokar Grosek
Publikováno v:
IEEE Access, Vol 10, Pp 125955-125962 (2022)
In the presented paper, we investigate the problem of finding the maximum possible cardinality of a dictionary of a prefix code for a string of a given length. Namely, we present a sharp proof of the cardinality of such a dictionary using results fro
Externí odkaz:
https://doaj.org/article/ecbe264f7b81457780c31119e969bd9e
Publikováno v:
Sensors, Vol 21, Iss 18, p 6236 (2021)
A prefix code, a P-code, is a code where no codeword is a prefix of another codeword. In this paper, a symmetric cipher based on prefix codes is proposed. The simplicity of the design makes this cipher usable for Internet of Things applications. Our
Externí odkaz:
https://doaj.org/article/7d75d84af4bc4385be6e6937a617dcb5
Autor:
Viliam Hromada, Pethő Tibor
Publikováno v:
International Journal of Electronics and Telecommunications, Vol vol. 64, Iss No 2 (2018)
This paper deals with the phase-shift fault analysis of stream cipher Grain v1. We assume that the attacker is able to desynchronize the linear and nonlinear registers of the cipher during the keystream generation phase by either forcing one of the r
Externí odkaz:
https://doaj.org/article/23dcb275e72f43dc8bd7aae223766058
Autor:
Viliam Hromada, Daniela Lescinska
Publikováno v:
Publicationes Mathematicae Debrecen. 100:567-582
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a06adeb143d4205191257c6989af4a9
https://doi.org/10.5486/pmd.2022.suppl.2
https://doi.org/10.5486/pmd.2022.suppl.2
In this paper, we investigate the maximum size of a minimal dictionary of a binary prefix-code string. We develop exact formulas for the maximum number of codewords of a minimal dictionary, which belongs to a binary string of some length. Further, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c4f4c866b4654860468d0ee847c63a2
https://doi.org/10.36227/techrxiv.19866205
https://doi.org/10.36227/techrxiv.19866205
Publikováno v:
Sensors, Vol 21, Iss 6236, p 6236 (2021)
Sensors
Volume 21
Issue 18
Sensors (Basel, Switzerland)
Sensors
Volume 21
Issue 18
Sensors (Basel, Switzerland)
A prefix code, a P-code, is a code where no codeword is a prefix of another codeword. In this paper, a symmetric cipher based on prefix codes is proposed. The simplicity of the design makes this cipher usable for Internet of Things applications. Our
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7811154525c92e8fe34886c8b4009cdf
https://www.mdpi.com/1424-8220/21/18/6236
https://www.mdpi.com/1424-8220/21/18/6236
Autor:
Robert Abela, Christian Colombo, Peter Malo, Peter Sýs, Tomáš Fabšič, Ondrej Gallo, Viliam Hromada, Mark Vella
Publikováno v:
Security and Trust Management ISBN: 9783030918583
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::099839adae52c2dab8aa457d148d6995
https://doi.org/10.1007/978-3-030-91859-0_6
https://doi.org/10.1007/978-3-030-91859-0_6
Publikováno v:
Tatra Mountains Mathematical Publications. 67:85-92
It is known that a naive implementation of the decryption algorithm in the McEliece cryptosystem allows an attacker to recover the secret matrix P by measuring the power consumption. We demonstrate that a similar threat is present in the QC-LDPC vari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f82cb167fcd03b78ede581e77c11efd0
https://doi.org/10.1515/tmmp-2016-0032
https://doi.org/10.1515/tmmp-2016-0032
Autor:
Viliam Hromada, Otokar Grošek
Publikováno v:
Tatra Mountains Mathematical Publications. 67:93-98
In this paper we study equivalence classes of binary vectors with regards to their rotation by using an algebraic approach based on the theory of linear feedback shift registers. We state the necessary and sufficient condition for existence of an equ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::596f442f07cd0d917d17dea9c0b01e0e
https://doi.org/10.1515/tmmp-2016-0033
https://doi.org/10.1515/tmmp-2016-0033
Publikováno v:
Tatra Mountains Mathematical Publications. 64:187-203
In this paper we study large scale distributed algebraic attacks with SAT solvers in a specific scenarios. We are interested in the complexity of finding low entropy keys with the help of SAT solvers. Moreover, we examine how to efficiently distribut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::559aeec92b611cca4c5d1c7dbf6b8db5
https://doi.org/10.1515/tmmp-2015-0048
https://doi.org/10.1515/tmmp-2015-0048