الفهرس 
1 IntroductionOnly 14 pages are availabe for public view
 |  | from | 120 |  |  |
| | | from | 120 | | |
Abstract
Most advanced security systems depend on public-key schemes based either on
the factorization or discrete logarithm problem. Since both problems are famous
to be closely related, the main breakthrough in cryptanalysis catching one of those
problems could provide a large set of cryptosystems completely useless. McEliece
is a public-key cryptosystem based on error correcting codes. It has the ability
to resist quantum-computer attacks which can break dierent modern public key
cryptosystems such as RSA. Further more, its encryption and decryption are very
fast and have good characteristics for data parallel processing.
Nowadays, modern graphic processing units (GPUs) are available in almost all
hardware platforms.A GPU is a dedicated hardware for executing graphics on machines
such as personal computers, workstations, game consoles and embedded
systems. GPUs can comprise many compute cores which can process a huge data
in parallel.The operations of the McEliece encryption algorithm show good characteristics
for data parallel processing which makes the McEliece a good candidate to
benet from the high degree of parallelism available in modern graphics processing
units (GPUs).
In this thesis, dierent implementations of McEliece cryptosystem are explored
on NVIDIA GTX780 GPU using OpenCL framework. The implementation results
show that GPU is 331x faster than CPU when apply local memory with vector datatype
to encrypt 216 messages with the parameter set (k; n; t) = (1751; 2048; 30).