On a Vernam cipher scheme based on elliptic curve L-functions

In this paper, we present a new Vernam-like cryptosystem based on the L-functions attached to elliptic curves. Actually, we show that for infinitely many elliptic curves, the coefficients of the L-series can be considered as a secure cryptographic cipher key when combined with linear and classical pseudo-random number generators. Hence, fast and widely known classical generators, like linear congruential generators, should be reintroduced into our list of cryptographic design choices.