Skip to main content
Have a personal or library account? Click to login
Maximum Number of Steps Taken by Modular Exponentiation and Euclidean Algorithm Cover

Maximum Number of Steps Taken by Modular Exponentiation and Euclidean Algorithm

Formalized Mathematics
Volume 27 (2019): Issue 1 (April 2019)
By: Hiroyuki Okazaki,  Koh-ichi Nagao and  Yuichi Futa  
Open Access
|May 2019
Authors

Authors

Hiroyuki Okazaki

Shinshu University, Nagano, Japan

Koh-ichi Nagao

Kanto Gakuin University, Kanagawa, Japan

Yuichi Futa

Tokyo University of Technology, Tokyo, Japan
DOI: https://doi.org/10.2478/forma-2019-0009 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 87 - 91
Accepted on: Mar 11, 2019
Published on: May 16, 2019
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Keywords:
algorithms,
power residues,
Euclidean algorithm
Related subjects:
Mathematics,
General mathematics,
Computer sciences,
Computer sciences, other

© 2019 Hiroyuki Okazaki, Koh-ichi Nagao, Yuichi Futa, published by University of Białystok
This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 License.

Volume 27 (2019): Issue 1 (April 2019)
Previous article