Sciweavers

47 search results - page 8 / 10
» Novel Precomputation Schemes for Elliptic Curve Cryptosystem...
Sort
View
EUROCRYPT
2010
Springer
14 years 8 days ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
PKC
2004
Springer
158views Cryptology» more  PKC 2004»
14 years 25 days ago
Faster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius Endomorphism
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...
Roberto Maria Avanzi, Mathieu Ciet, Francesco Sica
ICC
2007
IEEE
269views Communications» more  ICC 2007»
14 years 1 months ago
A Routing-Driven Key Management Scheme for Heterogeneous Sensor Networks
–The many-to-one traffic pattern dominates in sensor networks, where a large number of sensor nodes send data to one sink. A sensor node may only communicate with a small portion...
Xiaojiang Du, Yang Xiao, Song Ci, Mohsen Guizani, ...
TC
2008
13 years 7 months ago
Cryptanalysis with COPACOBANA
Cryptanalysis of ciphers usually involves massive computations. The security parameters of cryptographic algorithms are commonly chosen so that attacks are infeasible with availabl...
Tim Güneysu, Timo Kasper, Martin Novotn&yacut...
CHES
2008
Springer
134views Cryptology» more  CHES 2008»
13 years 9 months ago
Ultra High Performance ECC over NIST Primes on Commercial FPGAs
Elliptic Curve Cryptosystems (ECC) have gained increasing acceptance in practice due to their significantly smaller bit size of the operands compared to other public-key cryptosyst...
Tim Güneysu, Christof Paar