Sciweavers

1064 search results - page 41 / 213
» Cryptography from Anonymity
Sort
View
IMA
2005
Springer
162views Cryptology» more  IMA 2005»
14 years 1 months ago
Pairing-Based Cryptography at High Security Levels
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...
Neal Koblitz, Alfred Menezes
CHES
2008
Springer
132views Cryptology» more  CHES 2008»
13 years 10 months ago
Light-Weight Instruction Set Extensions for Bit-Sliced Cryptography
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...
Philipp Grabher, Johann Großschädl, Dan...
AAECC
2006
Springer
132views Algorithms» more  AAECC 2006»
13 years 8 months ago
The Conjugacy Search Problem in Public Key Cryptography: Unnecessary and Insufficient
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 ...
Vladimir Shpilrain, Alexander Ushakov
CMA
2010
183views more  CMA 2010»
13 years 4 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
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...
Elisavet Konstantinou, Aristides Kontogeorgis
FCCM
2004
IEEE
118views VLSI» more  FCCM 2004»
13 years 11 months ago
Virtual Memory Window for a Portable Reconfigurable Cryptography Coprocessor
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...
Miljan Vuletic, Laura Pozzi, Paolo Ienne