Tomáš Fabšič

Tomáš Fabšič

Auto-generated profile, based on publicly available information

Tomáš Fabšič

Slovak University of Technology in Bratislava

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 June 2017
Verified
Book Chapter
Closed access
PDF file
TFTomáš Fabšič
Tomáš Fabšič
VHViliam Hromada
Viliam Hromada
PSPaul Stankovski
Paul Stankovski
PZPavol Zajac
Pavol Zajac
QGQian Guo
Qian Guo
TJThomas Johansson
Thomas Johansson

1 September 2016 in Tatra Mountains Mathematical Publications
Verified
Journal Article
Open access
PDF file
TFTomáš Fabšič
Tomáš Fabšič
OGOndrej Gallo
Ondrej Gallo
VHViliam Hromada
Viliam Hromada
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 variant of the McEliece cryptosystem. We consider a naive implementation of the decryption algorithm in the QC-LDPC McEliece cryptosystem. We demonstrate that this implementation leaks information about positions of ones in the secret matrix Q. We argue that this leakage allows an attacker to completely recover the matrix Q. In addition, we note that the quasi-cyclic nature of the matrix Q allows to accelerate the attack significantly.

4 December 2021
Verified
Book Chapter
Closed access
PDF file
RARobert Abela
Robert Abela
CCChristian Colombo
Christian Colombo
PMPeter Malo
Peter Malo
PSPeter Sýs
Peter Sýs
TFTomáš Fabšič
Tomáš Fabšič
MVMark Vella
Mark Vella

11 July 2017 in Cryptography and Communications
Verified
Journal Article
Closed access
PDF file
TFTomáš Fabšič
Tomáš Fabšič
OGOtokar Grošek
Otokar Grošek
KNKarol Nemoga
Karol Nemoga
PZPavol Zajac
Pavol Zajac

1 September 2018 in Journal of Electrical Engineering
Verified
Journal Article
Open access
PDF file
OGOtokar Grošek
Otokar Grošek
TFTomáš Fabšič
Tomáš Fabšič
We study a method of computing multiplicative inverses in finite fields using long division. In the case of fields of a prime order p, we construct one fixed integer d(p) with the property that for any nonzero field element a, we can compute its inverse by dividing d(p) by a and by reducing the result modulo p. We show how to construct the smallest d(p) with this property. We demonstrate that a similar approach works in finite fields of a non-prime order, as well. However, we demonstrate that the studied method (in both cases) has worse asymptotic complexity than the extended Euclidean algorithm.

19 February 2024
Verified
Book Chapter
Closed access
PDF file
TFTomáš Fabšič
Tomáš Fabšič
OGOtokar Grošek
Otokar Grošek
VHViliam Hromada
Viliam Hromada
PZPavol Zajac
Pavol Zajac
PQC migration represents multiple challenges in education. We will need to educate our future cryptography researchers and engineers on new topics, introduce new challenges, and explain new cryptographic primitives. In the paper, we present our view on education challenges associated with the transition to post-quantum cryptography.