Sciweavers

4340 search results - page 245 / 868
» Formal Methods and Cryptography
Sort
View
160
Voted
CHES
2007
Springer
328views Cryptology» more  CHES 2007»
15 years 11 months ago
High-Speed True Random Number Generation with Logic Gates Only
It is shown that the amount of true randomness produced by the recently introduced Galois and Fibonacci ring oscillators can be evaluated experimentally by restarting the oscillato...
Markus Dichtl, Jovan Dj. Golic
149
Voted
FSE
2007
Springer
192views Cryptology» more  FSE 2007»
15 years 11 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...
136
Voted
PAIRING
2007
Springer
113views Cryptology» more  PAIRING 2007»
15 years 11 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
136
Voted
PAIRING
2007
Springer
108views Cryptology» more  PAIRING 2007»
15 years 11 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
PAIRING
2007
Springer
15 years 11 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