Master's Thesis from the year 2019 in the subject Computer Science - IT-Security, grade: A, , course: Computer Science and Engineering, language: English, abstract: Modular exponentiation has been the primary operation in most of the asymmetric cryptosystems. However, for large exponents which serves as the keys for encryption and decryption, conventional way to compute modular exponentiation is very time consuming. Hence, different binary methods based on bit wise "squaring-multiplication" operations is more widely used. However, these approaches are vulnerable to side-channel attacks, specially timing and power analysis attacks. Hence, these approaches are improved so that such attacks can be mitigated. Two processes have been designed based on "Multiply-Always" binary method which injects dummy multiplications so that the original multiplications can remain intact. The two processes are being invoked based on a random variable which generates either 0 or 1. With these randomized modular exponentiation, the proposed approach can resist simple and differential power analysis attacks to a large extent. The proposed approach has been implemented using conventional "squaring-multiplication" and "Montgomery-Ladder" methods. Further, the work has also been extended to CRT-RSA which is widely used for fast computation. The analysishas been done for different key sizes of 1024 bit, 1536 bit and 2048 bit RSA & CRT-RSA.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 64 pp. Englisch. Bestandsnummer des Verkäufers 9783389156117
Anzahl: 2 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Master's Thesis from the year 2019 in the subject Computer Science - IT-Security, grade: A, , course: Computer Science and Engineering, language: English, abstract: Modular exponentiation has been the primary operation in most of the asymmetric cryptosystems. However, for large exponents which serves as the keys for encryption and decryption, conventional way to compute modular exponentiation is very time consuming. Hence, different binary methods based on bit wise 'squaring-multiplication' operations is more widely used. However, these approaches are vulnerable to side-channel attacks, specially timing and power analysis attacks. Hence, these approaches are improved so that such attacks can be mitigated.Two processes have been designed based on 'Multiply-Always' binary method which injects dummy multiplications so that the original multiplications can remain intact. The two processes are being invoked based on a random variable which generates either 0 or 1. With these randomized modular exponentiation, the proposed approach can resist simple and differential power analysis attacks to a large extent. The proposed approach has been implemented using conventional 'squaring-multiplication' and 'Montgomery-Ladder' methods. Further, the work has also been extended to CRT-RSA which is widely used for fast computation. The analysishas been done for different key sizes of 1024 bit, 1536 bit and 2048 bit RSA & CRT-RSA.Books on Demand GmbH, Überseering 33, 22297 Hamburg 64 pp. Englisch. Bestandsnummer des Verkäufers 9783389156117
Anzahl: 1 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering. Bestandsnummer des Verkäufers 9783389156117
Anzahl: 1 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. An Improved Modular Exponentiation To Resist Power Analysis Attacks | Moushumi Barman | Taschenbuch | Englisch | 2025 | GRIN Verlag | EAN 9783389156117 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. Bestandsnummer des Verkäufers 134103513
Anzahl: 5 verfügbar