CSREASAM
2008
13 years 6 months ago
2008
Abstract--Packet Level Authentication (PLA) is a novel countermeasure against distributed denial-of-service attacks. Each packet sent across a network has a digital signature and p...
FDTC
2008
Springer
13 years 6 months ago
2008
Springer
Differential Fault Analysis (DFA) is a real threat for elliptic curve cryptosystems. This paper describes an elliptic curve cryptoprocessor unit resistant against fault injection....
ASIACRYPT
2008
Springer
13 years 6 months ago
2008
Springer
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
ANTS
2008
Springer
13 years 6 months ago
2008
Springer
Let K be a p-adic local field and E an elliptic curve defined over K. The component group of E is the group E(K)/E0(K), where E0(K) denotes the subgroup of points of good reduction...
CRYPTO
1995
Springer
13 years 8 months ago
1995
Springer
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be o...
AAECC
2003
Springer
13 years 8 months ago
2003
Springer
Abstract. We prove lower bounds on the degree of polynomials interpolating the Diffie
ENC
2004
IEEE
13 years 8 months ago
2004
IEEE
We present a hardware architecture for an Elliptic Curve Cryptography System performing the three basic cryptographic schemes: DH key generation, encryption and digital signature....
CHES
2004
Springer
13 years 8 months ago
2004
Springer
In the execution on a smart card, side channel attacks such as simple power analysis (SPA) and the differential power analysis (DPA) have become serious threat [15]. Side channel a...
ANTS
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Mazur proved that any element ξ of order three in the Shafarevich-Tate group of an elliptic curve E over a number field k can be made visible in an abelian surface A in...
ACISP
2007
Springer
13 years 8 months ago
2007
Springer
This paper presents a new approach to precompute all odd points [3]P, [5]P, . . . , [2k - 1]P, k 2 on an elliptic curve over Fp. Those points are required for the efficient evalua...