[PDF][PDF] Construction of pseudorandom binary sequences over elliptic curves using multiplicative characters
L Mérai - Publ. Math. Debrecen, 2012 - compalg.inf.elte.hu
Publ. Math. Debrecen, 2012•compalg.inf.elte.hu
… In this paper we extend this study by using general multiplicative characters over finite
field and sufficient conditions will be given to guarantee the good pseudorandom properties.
In Section 2 we summarize some basic facts about elliptic curves, in Section 3 we recall the
definition of pseudorandomness introduced in [10], and define the construction of the binary
sequence for general multiplicative characters. In Section 4 we prove that these sequences
have strong pseudorandom properties, and in Section 5 we give some conditions for the …
field and sufficient conditions will be given to guarantee the good pseudorandom properties.
In Section 2 we summarize some basic facts about elliptic curves, in Section 3 we recall the
definition of pseudorandomness introduced in [10], and define the construction of the binary
sequence for general multiplicative characters. In Section 4 we prove that these sequences
have strong pseudorandom properties, and in Section 5 we give some conditions for the …
Abstract
In this paper the randomness of binary sequences generated over elliptic curve is studied. The construction uses multiplicative characters and both the well-distribution and correlation measures are estimated.
compalg.inf.elte.hu
以上显示的是最相近的搜索结果。 查看全部搜索结果