الفهرس Only 14 pages are availabe for public view
 |  | from | 130 |  |  |
| | | from | 130 | | |
Abstract
This thesis proposes a new encryption algorithm to countenneasure both simple side channel attacks and sign change fault attacks. The implementation of the proposed algorithm is presented and the efficiency and randomness of the implementation are measured. The two types of attacks are investigated separately. The literature of the subject is covered.
A simple side channel attack is based on power tracing of a sequence of addition and doubling operations to reveal the key. While sign change fault attacks is based on analyzing the errors that may occur during the cryptographic operation. The output of the cryptographic operation may be incorrect and therefore it could provide infonnation that may reveal the secret key.
The idea of the proposed algorithm is based on using simple side channel attacks and sign change fault attacks at the same time. This algorithm has proved to countenneasure both attacks.
In the frame of implementing the proposed algorithm, we presented the encryption and decryption processes. In the implementation of the encryption we proposed a well defmed step to convert the plaintext to a point on the elliptic curve then used the secret key to obtain the ciphertext. In the decryption process we also defined the steps to convert
. the ciphertext to a point on the elliptic curve and then convert this point to get the plaintext. We used the statistical tests to test the local randomness and security of the implemented algorithm. Results of applying the proposed algorithm on some practical cases are provided.