1064 search results - page 41 / 213 » Cryptography from Anonymity |
170
Voted
IMA
2005
Springer
15 years 9 months ago
2005
Springer
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...
117
click to vote
CHES
2008
Springer
15 years 5 months ago
2008
Springer
Bit-slicing is a non-conventional implementation technique for cryptographic software where an n-bit processor is considered as a collection of n 1-bit execution units operating in...
115
click to vote
AAECC
2006
Springer
15 years 3 months ago
2006
Springer
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. This problem is in the core of several recently suggested public key ...
144
click to vote
CMA
2010
15 years 9 days ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
139
Voted
FCCM
2004
IEEE
15 years 7 months ago
2004
IEEE
Reconfigurable System-on-Chip (SoC) platforms that incorporate hard-core processors surrounded by large amounts of FPGA are today commodities: the reconfigurable logic is often us...