Elliptic Curve Pseudorandom Bit Generator with Maximum Period Sequences
| Autor: | Alexandr A. Kuznetsov, Yurii Gorbenko, Anastasiia Kiian Anastasiia Kiian, Yuliia V. Ulianovska, Tetiana Kuznetsova |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | International Journal of Computing. :494-505 |
| ISSN: | 2312-5381 1727-6209 |
| Popis: | Pseudo-random number generator is an important mechanism for cryptographic information protection. It can be used independently to generate special data or as the most important element of security of other mechanisms for cryptographic information protection. The application of transformations in a group of points of elliptic and hypereliptic curves is an important direction for the designing of cryptographically stable pseudo-random sequences generators. This approach allows us to build the resistant cryptographic algorithms in which the problem of finding a private key is associated with solving the discrete logarithm problem. This paper proposes a method for generating pseudo-random sequences of the maximum period using transformations on the elliptic curves. The maximum sequence period is provided by the use of recurrent transformations with the sequential formation of the elements of the point group of the elliptic curve. In this case, the problem of finding a private key is reduced to solving a theoretically complex discrete logarithm problem. The article also describes the block diagram of the device for generating pseudo-random sequences and the scheme for generating internal states of the generator. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|