The Mixed Binary Euclid Algorithm

We present a new GCD algorithm for two integers that combines both the Euclidean and the binary gcd approaches. We give its worst case time analysis and we prove that its bit-time complexity is still O ( n 2 ) for two n-bit integers in the worst case. Our preliminar experiments show a potential spee...

Full description

Bibliographic Details

Published in:	Electronic notes in discrete mathematics Vol. 35; pp. 169 - 176
Main Author:	Sedjelmaci, Sidi Mohamed
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.12.2009
Subjects:	Algorithms Greatest common divisor (GCD) Parallel Complexity Greatest common divisor (GCD) Algorithms Parallel Complexity
ISSN:	1571-0653, 1571-0653
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!