Michal Mikuš
Michal Mikuš has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Igor Semaev
Department of Informatics University of Bergen Norway
1 shared publication - Petr Savický
Institute of Computer Science Czech Academy of Sciences
1 shared publication
Latest Publications
- 1 December 2012
- Published by Walter de Gruyter GmbH in Tatra Mountains Mathematical Publications
- Vol. 53 (1) , 147-154
Experiments with the Plaintext Space in Gentry’S Somewhat Homomorphic Scheme
In this paper we propose an improvement of the implementation of the original Gentry-Halevi somewhat homomorphic scheme. We suggest to choose a bigger plaintext space, by changing the underlying ideal from I = (2) to I = (p) for some bigger prime p. Our analysis shows that bigger plaintext space will improve the homomorphic computation of the somewhat homomorphic scheme while it only slightly increases the complexity of the key generation procedure. The encryption and decryption functions have the same complexity. We provide also some experimental computations that support the analysis.
- 1 December 2012
- Published by Walter de Gruyter GmbH in Tatra Mountains Mathematical Publications
- Vol. 53 (1) , 147-154
Experiments with the Plaintext Space in Gentry’S Somewhat Homomorphic Scheme
In this paper we propose an improvement of the implementation of the original Gentry-Halevi somewhat homomorphic scheme. We suggest to choose a bigger plaintext space, by changing the underlying ideal from I = (2) to I = (p) for some bigger prime p. Our analysis shows that bigger plaintext space will improve the homomorphic computation of the somewhat homomorphic scheme while it only slightly increases the complexity of the key generation procedure. The encryption and decryption functions have the same complexity. We provide also some experimental computations that support the analysis.
- Open Access
- 1 December 2010
- Published by Walter de Gruyter GmbH in Tatra Mountains Mathematical Publications
- Vol. 47 (1) , 67-80
Remarks on Gödel’s code as a hash function
- 1 December 2010
- Published by Walter de Gruyter GmbH in Tatra Mountains Mathematical Publications
- Vol. 47 (1) , 67-80
Open AccessRemarks on Gödel’s code as a hash function
- 1 December 2010
- Published by Walter de Gruyter GmbH in Tatra Mountains Mathematical Publications
- Vol. 45 (1) , 107-136
Methods to solve algebraic equations in cryptanalysis
The goal of the present paper is a survey of methods to solve equation systems common in cryptanalysis. The methods depend on the equation representation and fall into three categories: Gröbner basis algorithms, SAT-solving methods and Agreeing-Gluing algorithms.
- 1 December 2010
- Published by Walter de Gruyter GmbH in Tatra Mountains Mathematical Publications
- Vol. 45 (1) , 107-136
Methods to solve algebraic equations in cryptanalysis
The goal of the present paper is a survey of methods to solve equation systems common in cryptanalysis. The methods depend on the equation representation and fall into three categories: Gröbner basis algorithms, SAT-solving methods and Agreeing-Gluing algorithms.