Login
Register
Reset Password
Publish & Distribute
Publishing Solutions
Distribution Solutions
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Blog
Contact
Search
EUR
USD
GBP
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
Formalized Mathematics
Volume 27 (2019): Issue 1 (April 2019)
Open Access
Maximum Number of Steps Taken by Modular Exponentiation and Euclidean Algorithm
Hiroyuki Okazaki
Hiroyuki Okazaki
,
Koh-ichi Nagao
Koh-ichi Nagao
and
Yuichi Futa
Yuichi Futa
| May 16, 2019
Formalized Mathematics
Volume 27 (2019): Issue 1 (April 2019)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Published Online:
May 16, 2019
Page range:
87 - 91
Accepted:
Mar 11, 2019
DOI:
https://doi.org/10.2478/forma-2019-0009
Keywords
algorithms
,
power residues
,
Euclidean algorithm
© 2019 Hiroyuki Okazaki et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 Public License.
Hiroyuki Okazaki
Shinshu University,
Nagano, Japan
Koh-ichi Nagao
Kanto Gakuin University,
Kanagawa, Japan
Yuichi Futa
Tokyo University of Technology,
Tokyo, Japan