Sciweavers

1769 search results - page 172 / 354
» Cryptography
Sort
View
131
Voted
FSE
2007
Springer
192views Cryptology» more  FSE 2007»
15 years 9 months ago
Algebraic Cryptanalysis of 58-Round SHA-1
In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article5 is to sophisticate and improve Wang’s attack by using algebraic tech...
Makoto Sugita, Mitsuru Kawazoe, Ludovic Perret, Hi...
125
Voted
PAIRING
2007
Springer
113views Cryptology» more  PAIRING 2007»
15 years 9 months ago
Implementing Cryptographic Pairings over Barreto-Naehrig Curves
In this paper we describe an efficient implementation of the Tate and Ate pairings using Barreto-Naehrig pairing-friendly curves, on both a standard 32-bit PC and on a 32-bit smart...
Augusto Jun Devegili, Michael Scott, Ricardo Dahab
122
Voted
PAIRING
2007
Springer
108views Cryptology» more  PAIRING 2007»
15 years 9 months ago
Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...
David Freeman
107
Voted
PAIRING
2007
Springer
15 years 9 months ago
Remarks on Cheon's Algorithms for Pairing-Related Problems
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
Shunji Kozaki, Taketeru Kutsuma, Kazuto Matsuo
129
Voted
PET
2007
Springer
15 years 9 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