Otokar Grosek

Viliam Hromada

IEEE Trans. Inf. Theory, May, 2023

2022

A Note on the Maximum Size of a Prefix Code.

[BibT_eX]

[DOI]

Viliam Hromada

IEEE Access, 2022

2021

A Cipher Based on Prefix Codes.

[BibT_eX]

[DOI]

Viliam Hromada

Sensors, 2021

2020

Diplomatic Ciphers Used by Slovak Attaché During the WW2.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Historical Cryptology, 2020

2019

Remarks on breaking the Vigenère autokey cipher.

[BibT_eX]

[DOI]

Tomás Fabsic

Cryptologia, 2019

Cryptology in the Slovak State During WWII.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Conference on Historical Cryptology, 2019

2018

On generating invertible circulant binary matrices with a prescribed number of ones.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2018

2017

On a mnemonic construction of permutations.

[BibT_eX]

[DOI]

J. Math. Cryptol., 2017

2014

A new approach towards the Golomb-Welch conjecture.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

2013

Coprime solutions to ax≡b (mod n).

[BibT_eX]

[DOI]

Stefan Porubský

J. Math. Cryptol., 2013

2012

On quasigroups with few associative triples.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2012

Towards a Solution of the Golomb-Welch Conjecture ?

[BibT_eX]

[DOI]

CoRR, 2012

2009

Automated Cryptanalysis of Classical Ciphers.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Artificial Intelligence (3 Volumes), 2009

Automated Cryptanalysis.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Artificial Intelligence (3 Volumes), 2009

On complexity of round transformations.

[BibT_eX]

[DOI]

Discret. Math., 2009

A new matrix test for randomness.

[BibT_eX]

[DOI]

Milan Vojvoda

Róbert Krchnavý

Computing, 2009

2004

On Non-Polynomial Latin Squares.

[BibT_eX]

[DOI]

Tran van Trung

Des. Codes Cryptogr., 2004

2003

Extremal Generalized S-Boxes.

[BibT_eX]

[DOI]

Ladislav Satko

Karol Nemoga

Comput. Artif. Intell., 2003

Semigroup of Matrices over GF{2<sup>s</sup>} and its Relation to AES.

[BibT_eX]

[DOI]