Sciweavers

45 search results - page 8 / 9
» Implementing Cryptographic Pairings on Smartcards
Sort
View
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
13 years 9 months ago
Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shi...
JSS
2011
106views more  JSS 2011»
12 years 10 months ago
A family of implementation-friendly BN elliptic curves
For the last decade, elliptic curve cryptography has gained increasing interest in industry and in the academic community. This is especially due to the high level of security it p...
C. C. F. Pereira Geovandro, Marcos A. Simplí...
CCS
2005
ACM
14 years 1 months ago
A model and architecture for pseudo-random generation with applications to /dev/random
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...
Boaz Barak, Shai Halevi
EUROPKI
2005
Springer
14 years 1 months ago
A Multipurpose Delegation Proxy for WWW Credentials
Credentials like passwords or cryptographic key pairs are a means to prove one’s identity to a web server. A practical problem in this context is the question of how a user can t...
Tobias Straub, Thilo-Alexander Ginkel, Johannes Bu...
SIGCOMM
2012
ACM
11 years 10 months ago
MultiNet: usable and secure WiFi device association
This demo presents MultiNet, a novel method for joining devices to a domestic Wi-Fi network. MultiNet dynamically reconfigures the network to accept each device, rather than con...
Anthony Brown, Richard Mortier, Tom Rodden