Bernstein-Yang constant-time GCD computation and modular inversion algorithm – Cem Ayar – Yaşar Üniversitesi
Search

Bernstein-Yang constant-time GCD computation and modular inversion algorithm – Cem Ayar

one-cikan-duyuru

.Title: Bernstein-Yang constant-time GCD computation and modular inversion algorithm
Speaker: Cem Ayar (M. Sc. candidate)
Date: May 31, 2019, Friday
Time: 14:00-15:00
Venue: U109
Abstract: Nowadays, GCD computation and modular inversion are the basic mathematical calculation algorithms for cryptography.The attackers who exploit some of the vulnerabilities (timing attacks, cache attacks, etc.) that are used to accelerate these algorithms can break these cryptographic algorithms. A method used against this is to use an algorithm which can perform these calculations on a constant-time. The aim of this presentation is the introduction of an GCD computation and modular inversion algorithm faster than the other algorithms that has been published a month ago.