Redesigned the Architecture of Extended-Euclidean Algorithm for Modular Multiplicative Inverse and Jacobi Symbol

Author(s):  
Dongmuanthang Phiamphu ◽  
Prabir Saha
2016 ◽  
Vol 100 (547) ◽  
pp. 147-149
Author(s):  
Paul Levrie ◽  
Rudi Penne

2019 ◽  
Vol 16 ◽  
pp. 8317-8321
Author(s):  
Waleed Eltayeb Ahmed

This paper presents how the steps that used to determine a multiplicative inverse by method based on the Euclidean algorithm, can be used to find a greatest common divisor for polynomials in the Galois field (2^n ).


Sign in / Sign up

Export Citation Format

Share Document