How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
IEEE Transactions on Computers
A pseudo-random bit generator based on elliptic logarithms
Proceedings on Advances in cryptology---CRYPTO '86
A VLSI Architecture for Fast Inversion in GF(2/sup m/)
IEEE Transactions on Computers
Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields
IEEE Transactions on Computers
A Fast Algorithm for Multiplicative Inversion in GF(2m) Using Normal Basis
IEEE Transactions on Computers
Elliptic Curve Public Key Cryptosystems
Elliptic Curve Public Key Cryptosystems
Generic implementations of elliptic curve cryptography using partial reduction
Proceedings of the 9th ACM conference on Computer and communications security
Weierstraß Elliptic Curves and Side-Channel Attacks
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Low Complexity Word-Level Sequential Normal Basis Multipliers
IEEE Transactions on Computers
Low-complexity versatile finite field multiplier in normal basis
EURASIP Journal on Applied Signal Processing
Encryption System with Variable Number of Registers
Computers and Electrical Engineering
Vulnerability of two multiple-key agreement protocols
Computers and Electrical Engineering
| Hi-index | 0.00 |
In this paper, implementation and analysis of three different versions of pseudorandom bit generators (PRBG) based on elliptic curves over prime and binary fields is presented. Implementations are carried out so that the algorithms could be compared in terms of time complexity and sequences could be compared in terms of periodicity, since the periodicity of all the generated streams are not available in literature. Based on the results of implementation and analysis, the pseudorandom bit generators (PRBG) most suitable for software and hardware realisations of stream cipher are identified. The software implementations of PRBG are carried out using Mathematica and the implementations in VHDL are done using the Altera Quartus IIv6.0 simulation software. The Montgomery's point multiplication method has also been discussed and implemented for comparison with the conventional point multiplication algorithm. Together with this, faster software algorithms for field inversion and point counting are discussed.