Sciweavers

1116 search results - page 126 / 224
» Key Agreement Using Statically Keyed Authenticators
Sort
View
ISCAS
2008
IEEE
154views Hardware» more  ISCAS 2008»
14 years 2 months ago
A 6.3nJ/op low energy 160-bit modulo-multiplier for elliptic curve cryptography processor
— A low energy modulo-multiplier is proposed for elliptic curve cryptography (ECC) processor, especially for authentication in mobile device or key encryption in embedded health-...
Hyejung Kim, Yongsang Kim, Hoi-Jun Yoo
PET
2007
Springer
14 years 2 months ago
Pairing-Based Onion Routing
Abstract. This paper presents a novel use of pairing-based cryptography to improve circuit construction in onion routing anonymity networks. Instead of iteratively and interactivel...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg
CCS
2010
ACM
13 years 5 months ago
Developing security protocols by refinement
We propose a development method for security protocols based on stepwise refinement. Our refinement strategy guides sformation of abstract security goals into protocols that are s...
Christoph Sprenger, David A. Basin
IACR
2011
139views more  IACR 2011»
12 years 7 months ago
SGCM: The Sophie Germain Counter Mode
Abstract. Sophie Germain Counter Mode (SGCM) is an authenticated encryption mode of operation, to be used with 128-bit block ciphers such as AES. SGCM is a variant of the NIST stan...
Markku-Juhani O. Saarinen
JUCS
2007
120views more  JUCS 2007»
13 years 7 months ago
Compile-time Computation of Polytime Functions
: We investigate the computational power of C++ compilers. In particular, it is known that any partial recursive function can be computed at compile time, using the template mechan...
Emanuele Covino, Giovanni Pani, Daniele Scrimieri