Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.16108 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916625964335104 |
|---|---|
| author | Saito, Asaki Yamaguchi, Akihiro |
| author_facet | Saito, Asaki Yamaguchi, Akihiro |
| contents | The binary expansions of irrational algebraic numbers can serve as high-quality pseudorandom binary sequences. This study presents an efficient method for computing the exact binary expansions of real quadratic algebraic integers using Newton's method. To this end, we clarify conditions under which the first $N$ bits of the binary expansion of an irrational number match those of its upper rational approximation. Furthermore, we establish that the worst-case time complexity of generating a sequence of length $N$ with the proposed method is equivalent to the complexity of multiplying two $N$-bit integers, showing its efficiency compared to a previously proposed true orbit generator. We report the results of numerical experiments on computation time and memory usage, highlighting in particular that the proposed method successfully accelerates true orbit pseudorandom number generation. We also confirm that a generated pseudorandom sequence successfully passes all the statistical tests included in RabbitFile of TestU01. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_16108 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Accelerating true orbit pseudorandom number generation using Newton's method Saito, Asaki Yamaguchi, Akihiro Computation Number Theory The binary expansions of irrational algebraic numbers can serve as high-quality pseudorandom binary sequences. This study presents an efficient method for computing the exact binary expansions of real quadratic algebraic integers using Newton's method. To this end, we clarify conditions under which the first $N$ bits of the binary expansion of an irrational number match those of its upper rational approximation. Furthermore, we establish that the worst-case time complexity of generating a sequence of length $N$ with the proposed method is equivalent to the complexity of multiplying two $N$-bit integers, showing its efficiency compared to a previously proposed true orbit generator. We report the results of numerical experiments on computation time and memory usage, highlighting in particular that the proposed method successfully accelerates true orbit pseudorandom number generation. We also confirm that a generated pseudorandom sequence successfully passes all the statistical tests included in RabbitFile of TestU01. |
| title | Accelerating true orbit pseudorandom number generation using Newton's method |
| topic | Computation Number Theory |
| url | https://arxiv.org/abs/2502.16108 |