Application of Euclid's algorithm to the computation of the inverse in modulo arithmetics
From MaRDI portal
Publication:1128755
DOI10.1016/S0165-1684(97)00187-4zbMath0957.11056OpenAlexW2039532831MaRDI QIDQ1128755
Publication date: 13 August 1998
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0165-1684(97)00187-4
Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)
This page was built for publication: Application of Euclid's algorithm to the computation of the inverse in modulo arithmetics