- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Optimal addition chain classified by Hamming weight
-
- Kunihiro Noboru
- NTT Communication Science Laboratories
-
- Yamamoto Hirosuke
- Department of Mathematical Engineering and Information Physics, University of Tokyo
Bibliographic Information
- Other Title
-
- Hamming weightに応じた最適なaddition chainについて
Search this article
Description
The addition chain is an efficient tool to calculate powers of integers. Many algorithms to attain a sub-optimal addition chain are proposed. Since these algorithms are considered mainly for average cases, the cases that the binary sequence of exponents have unbalanced numbers of 0 and 1 have not been discussed. In this report we classify optimal algorithms based on Hamming weight of exponents. Especially we propose Run-rength method, which is effective for the case that the number of 1 is much larger than the number of 0.
Journal
-
- Technical report of IEICE. SST
-
Technical report of IEICE. SST 96 (590), 127-132, 1997-03-18
The Institute of Electronics, Information and Communication Engineers
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1571698602293925120
-
- NII Article ID
- 110003291040
-
- NII Book ID
- AN10345990
-
- ISSN
- 09135685
-
- Text Lang
- ja
-
- Data Source
-
- CiNii Articles
