Κατεύθυνση Εφαρμοσμένα Μαθηματικά
Library of the School of Science

2019-01-11

2019

Giannopoulos Theodoros

Νικόλαος Μπάρδης, Αναπληρωτής Καθηγητής Στρατιωτικής Σχολής Ευελπίδων

Ασφαλής και Αποδοτική Υλοποίηση της Αριθμητικής Υπολοίπων στον RSA σε ΙοΤ Εφαρμογές

Greek

Secure and Effective Implementation of RSA Modular Arithmetic Operations for Iot Applications

In this thesis, the mathematical calculations of then non symmetric algorithms RSA are analyzed. The commonly used problems from number theory, such as the factorization problem, the discrete logarithm problem and the discrete logarithm problem for elliptic curves, on which public key cryptography is based are illustrated. In addition, the mathematic background of modular arithmetic is analyzed as well as the most common problems while implementing it on applications in Internet of Things (IoT) as well as in Cloud. The most commonly used ways of identification and authorization using modular arithmetic are also presented, while using low-end hardware, with limited computational power. Last but not least, a full analysis and comparison of the security level of all the above is presented.

Science

Boolean Algebra, Algebra, Blockchain, RSA, Identification, Authentication

No

0

Yes

22

66

File access is restricted only to the intranet of UoA.

https://pergamos.lib.uoa.gr/uoa/dl/object/2838887