Window and Extended Window Methods for Addition Chain and Addition-Subtraction Chain (Special Section on Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
The addition chain (A-chain) and addition-subtraction chain (AS-chain) are efficient tools to calculate power M^e (or multiplication eM); where integer e is fixed and M is variable. Since the optimization problem to find the shortest A (or AS)-chain is NP-hard, many algorithms to get a sub-optimal A (or AS)-chain in polynomial time are proposed. In this paper, a window method for the AS-chain and an extended window method for the A-chain and AS-chain are proposed and their performances are theoretically evaluated by applying the theory of the optimal variable-to-fixed length code, i.e., Tunstall code, in data compression. It is shown by theory and simulation that the proposed algorithms are more efficient than other algorithms in practical cases in addition to the asymptotic case.
- 社団法人電子情報通信学会の論文
- 1998-01-25
著者
-
Kunihiro N
Univ. Electro‐communications Chofu‐shi Jpn
-
Kunihiro Noboru
Ntt Communication Science Laboratories
-
Yamamoto Hirosuke
The Faculty Of Electro-communications University Of Electro-communications
関連論文
- A Neuro-Based Optimization Algorithm for Three Dimensional Cylindric Puzzles (Special Section of Papers Selected from ITC-CSCC'96)
- A Neuro-Based Optimization Algorithm for Rectangular Puzzles(Special Section of Papers Selected from ITC-CSCC'97)
- A New Class of the Universal Representation for the Positive Integers
- Window and Extended Window Methods for Addition Chain and Addition-Subtraction Chain (Special Section on Cryptography and Information Security)
- Two Discrete Log Algorithms for Super-Anomalous Elliptic Curves and Their Applications(Special Section on Cryptography and Information Security)
- A Bitplane Tree Weighting Method for Lossless Compression of Gray Scale Images
- New Methods for Generating Short Addition Chains(Special Section on Cryptography and Information Security)