|
|
Acceleration of Data Compression Algorithms on Sony PS3 Platform
Breitenbacher, Dominik ; Jaroš, Jiří (referee) ; Šimek, Václav (advisor)
This paper presents the use of PlayStation 3 device for accelerating compression algorithms and tries to show the potencial of PlayStation 3 for use on these tasks. For a demonstration was selected compression method based on the Burrows-Wheeler transformation. The output of the transformation is further transformed by using the Move-To-Front transformation and subsequently encoded by the static Huffman encoding. The compression algorithm has been called PS3BWT. It performs compression by using each of tasks and tries to always use the maximum number of avaible processor units, so the compression is carried out as quickly as possible.
|
|
|
Parallelization of Integer Factorization from the View of RSA Breaking
Breitenbacher, Dominik ; Henzl, Martin (referee) ; Homoliak, Ivan (advisor)
This paper follows up the factorization of integers. Factorization is the most popular and used method for RSA cryptoanalysis. The SIQS was chosen as a factorization method that will be used in this paper. Although SIQS is the fastest method (up to 100 digits), it can't be effectively computed at polynomial time, so it's needed to look up for options, how to speed up the method as much as possible. One of the possible ways is paralelization. In this case OpenMP was used. Other possible way is optimalization. The goal of this paper is also to show, how easily is possible to use paralelizion and thanks to detailed analyzation the source codes one can reach relatively large speed up. Used method of iterative optimalization showed itself as a very effective tool. Using this method the implementation of SIQS achieved almost 100 multiplied speed up and at some parts of the code even more.
|
|
|
Acceleration of Data Compression Algorithms on Sony PS3 Platform
Breitenbacher, Dominik ; Jaroš, Jiří (referee) ; Šimek, Václav (advisor)
This paper presents the use of PlayStation 3 device for accelerating compression algorithms and tries to show the potencial of PlayStation 3 for use on these tasks. For a demonstration was selected compression method based on the Burrows-Wheeler transformation. The output of the transformation is further transformed by using the Move-To-Front transformation and subsequently encoded by the static Huffman encoding. The compression algorithm has been called PS3BWT. It performs compression by using each of tasks and tries to always use the maximum number of avaible processor units, so the compression is carried out as quickly as possible.
|
|
|
Parallelization of Integer Factorization from the View of RSA Breaking
Breitenbacher, Dominik ; Henzl, Martin (referee) ; Homoliak, Ivan (advisor)
This paper follows up the factorization of integers. Factorization is the most popular and used method for RSA cryptoanalysis. The SIQS was chosen as a factorization method that will be used in this paper. Although SIQS is the fastest method (up to 100 digits), it can't be effectively computed at polynomial time, so it's needed to look up for options, how to speed up the method as much as possible. One of the possible ways is paralelization. In this case OpenMP was used. Other possible way is optimalization. The goal of this paper is also to show, how easily is possible to use paralelizion and thanks to detailed analyzation the source codes one can reach relatively large speed up. Used method of iterative optimalization showed itself as a very effective tool. Using this method the implementation of SIQS achieved almost 100 multiplied speed up and at some parts of the code even more.
|
guest ::
