Jebelean-Weber's algorithm without spurious factors

DOI10.1016/j.ipl.2007.01.004zbMath1184.68665OpenAlexW2098721176MaRDI QIDQ846018

Sidi Mohamed Sedjelmaci

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.01.004

zbMATH Keywords

algorithmsanalysis of algorithmsnumber theoryinteger greatest common divisor (GCD)extended GCD algorithmparallel GCD algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (2)

An extended Jebelean^ WeberNSedjelmaci GCD algorithm ⋮ The k -ary Montgomery modular inverse over nonbinary computers

Cites Work

• Fast computation of continued fraction expansions.
• Parallel implementation of the accelerated integer GCD algorithm
• Two Fast GCD Algorithms
• Half-GCD and fast rational recovery
• Algorithmic Number Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Jebelean-Weber's algorithm without spurious factors