Sciweavers

8 search results - page 2 / 2
» Cyclotomic Mapping Permutation Polynomials over Finite Field...
Sort
View
WSC
2000
13 years 7 months ago
A new class of linear feedback shift register generators
An efficient implementation of linear feedback shift register sequences with a given characteristic polynomial is obtained by a new method. It involves a polynomial linear congrue...
Pierre L'Ecuyer, François Panneton
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
13 years 5 months ago
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
Philippe Flajolet, Éric Fusy, Xavier Gourdo...
PKC
1998
Springer
123views Cryptology» more  PKC 1998»
13 years 9 months ago
Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
Jung Hee Cheon, Sung-Mo Park, Sangwoo Park, Daeho ...