Maximum Number of Steps Taken by Modular Exponentiation and Euclidean Algorithm

In this article we formalize in Mizar [1], [2] the maximum number of steps taken by some number theoretical algorithms, “right–to–left binary algorithm” for modular exponentiation and “Euclidean algorithm” [5]. For any natural numbers , , , “right–to–left binary algorithm” can calculate the natural...

Full description

Bibliographic Details

Published in:	Formalized mathematics Vol. 27; no. 1; pp. 87 - 91
Main Authors:	Okazaki, Hiroyuki, Nagao, Koh-ichi, Futa, Yuichi
Format:	Journal Article
Language:	English
Published:	Bialystok Sciendo 01.04.2019 De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Subjects:	03B35 11A05 11A15 68W40 Algorithms Euclidean algorithm power residues
ISSN:	1426-2630, 1898-9934
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!