Sciweavers

5 search results - page 1 / 1
» How Secure Are Elliptic Curves over Composite Extension Fiel...
Sort
View
EUROCRYPT
2001
Springer
13 years 9 months ago
How Secure Are Elliptic Curves over Composite Extension Fields?
We compare the method of Weil descent for solving the ECDLP, over extensions fields of composite degree in characteristic two, against the standard method of parallelised Pollard ...
Nigel P. Smart
INDOCRYPT
2001
Springer
13 years 9 months ago
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
In this paper, the authors analyze the Gaudry–Hess–Smart (GHS) Weil descent attack on the elliptic curve discrete logarithm problem (ECDLP) for elliptic curves defined over c...
Markus Maurer, Alfred Menezes, Edlyn Teske
IJSN
2006
76views more  IJSN 2006»
13 years 4 months ago
Elliptic curve cryptography-based access control in sensor networks
: Access control in sensor networks is used to authorise and grant users the right to access the network and data collected by sensors. Different users have different access right ...
Haodong Wang, Bo Sheng, Qun Li
ACISP
2005
Springer
13 years 6 months ago
Redundant Trinomials for Finite Fields of Characteristic 2
Abstract. In this article we introduce redundant trinomials to represent elements of finite fields of characteristic 2. This paper develops applications to cryptography, especial...
Christophe Doche
ASIACRYPT
2005
Springer
13 years 10 months ago
Spreading Alerts Quietly and the Subgroup Escape Problem
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
James Aspnes, Zoë Diamadi, Kristian Gjø...