A general method for to decompose modular multiplicative inverse operators over Group of units

DOI10.4067/S0716-09172018000200265zbMath1444.11005OpenAlexW2805701840WikidataQ129755637 ScholiaQ129755637MaRDI QIDQ3295207

Luis A. Cortés-Vega

Publication date: 8 July 2020

Published in: Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4067/s0716-09172018000200265

zbMATH Keywords

group of unitsChinese remainder theoremBezout's theoremdecomposition lawsalgorithmic functional techniquemodular multiplicative inverse operator

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (1)

Fractal mathematical over extended finite fields Fp[x/(f(x))]

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Congruences in \({\mathbb{Z}}^ n\), finite Abelian groups and the Chinese remainder theorem
• Number theory in science and communication. With applications in cryptography, physics, digital information, computing, and self-similarity.
• Residue-to-binary converters based on new Chinese remainder theorems
• Modular Multiplication Without Trial Division
• A Nonlinear Congruential Pseudorandom Number Generator with Power of Two Modulus
• The Montgomery inverse and its applications
• On Calculating Multiplicative Inverses Modulo $2^{m}$
• The Montgomery modular inverse-revisited
• GCD-Free Algorithms for Computing Modular Inverses
• On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers

This page was built for publication: A general method for to decompose modular multiplicative inverse operators over Group of units