Abstract
In this letter, we derive two lower bounds for the number of terms in a double-base number system (DBNS), when the digit set is {1}. For a positive integer n, we show that the number of terms obtained from the greedy algorithm proposed by Dimitrov, Imbert, and Mishra [1] is Θ(log n/log log n). Also, we show that the number of terms in the shortest doublebase chain is Θ(log n).
| Original language | English |
|---|---|
| Pages (from-to) | 1310-1312 |
| Number of pages | 3 |
| Journal | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
| Volume | E98A |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 1 Jun 2015 |
| MoE publication type | A1 Journal article-refereed |
Keywords
- Analysis of algorithms
- Double-base chain
- Double-base number system
- Elliptic curve cryptography
- Number representation