|
|
Quantum and Post-quantum Cryptography
Krivulčík, Andrej ; Ricci, Sara (oponent) ; Hajný, Jan (vedoucí práce)
With advances in quantum computing comes the threat of breaking the algorithms that are used in everyday communication. With this, an industry of post-quantum cryptography has emerged that develops algorithms resistant to quantum computers. The aim of this thesis is to study methods for combining and using keys established by quantum and post-quantum algorithms in such a way that if one of the given algorithms is broken the resulting hybrid key will still be secure. The resulting key is then used in encrypting the file using AES--256 which is sent between clients.
|
|
|
Slow DoS attacks generator
Krivulčík, Andrej ; Zeman, Václav (oponent) ; Sikora, Marek (vedoucí práce)
The work is focused on Slow DoS attacks and generating them. There are compared 3 most popular web servers and their defensive modules against this type of attacks. Closed are described network model TCP/IP, protocol HTTP (Hypertext Transfer Protocol), each DoS attack, Slow GET, Slow POST or Slow Read and also flood attacks. Afterwards the attack generator is described, with its functionality.
|
|
|
An Implementation of Lattice-based Proof-of-Work on Blockchain
Krivulčík, A. ; Ricci, S.
Cryptocurrencies and blockchain are skyrocketing in recent years. They rely on Proof-of-Work (PoW) mechanisms for generating a new transaction and turn this process into ”work” (i.e., puzzles) where miners are paid for. With the advent of quantum computers, also PoW starts to migrate to post-quantum cryptographic alternatives. To the best of our knowledge, we present the first implementation of a lattice-based PoW based on the Shortest Vector Problem (SVP). By implementing in Python 3 and with the use of the NumPy library, we wrote a software that uses this concept on an artificial blockchain and demonstrates its real-world use. Even if this proposal has drawbacks on GPU optimisation and storage requirements, it shows its potential in use. The experimental results show that by balancing the size and generated range of a given matrix and vector, we can easily manipulate the time required to solve SVP challenge.
|
|
|
Quantum and Post-quantum Cryptography
Krivulčík, Andrej ; Ricci, Sara (oponent) ; Hajný, Jan (vedoucí práce)
With advances in quantum computing comes the threat of breaking the algorithms that are used in everyday communication. With this, an industry of post-quantum cryptography has emerged that develops algorithms resistant to quantum computers. The aim of this thesis is to study methods for combining and using keys established by quantum and post-quantum algorithms in such a way that if one of the given algorithms is broken the resulting hybrid key will still be secure. The resulting key is then used in encrypting the file using AES--256 which is sent between clients.
|
|
|
Slow DoS attacks generator
Krivulčík, Andrej ; Zeman, Václav (oponent) ; Sikora, Marek (vedoucí práce)
The work is focused on Slow DoS attacks and generating them. There are compared 3 most popular web servers and their defensive modules against this type of attacks. Closed are described network model TCP/IP, protocol HTTP (Hypertext Transfer Protocol), each DoS attack, Slow GET, Slow POST or Slow Read and also flood attacks. Afterwards the attack generator is described, with its functionality.
|
host ::
RSS.