L Mérai - Designs, Codes and Cryptography, 2018 - Springer
For an elliptic curve EE over a finite field we define the point sequence (P_n)(P n) recursively by P_n= ϑ (P_ n-1)= ϑ^ n (P_0) P n= ϑ (P n-1)= ϑ n (P 0) with an endomorphism …
V Anupindi, L Mérai - Cryptography and Communications, 2022 - Springer
For a given hyperelliptic curve C over a finite field with Jacobian JC, we consider the hyperelliptic analogue of the congruential generator defined by W n= W n− 1+ D for n≥ 1 …
Secure pseudo-random number generators (PRNGs) have a lot of important applications in cryptography. In this paper, we analyze a new PRNG related to the elliptic curve power …
Pseudorandom sequences, that is, sequences which are generated with deterministic algorithms but look random, have many applications, for example in cryptography, in …