Efficient generating random number sequence
| Autor: | Lin, Wen-Sheng, 林文勝 |
|---|---|
| Rok vydání: | 2015 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 103 The paper considers the problem of efficient generating random number sequence. We adopt the most popular and efficient approximate factoring method. We conduct an exhaustive search for the moduli 2, 3, …,541. The results indicate that the number of portable multipliers increases as the modulus increases. As the number of portable multipliers increases one, the first non-portable multiple increases 0.55471. As the square root of the modulus increases one, the average distance of the two consecutive portable multipliers increases 0.49618. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|