Sciweavers

2967 search results - page 384 / 594
» Cryptology
Sort
View
EUROCRYPT
2011
Springer
14 years 9 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
EUROCRYPT
2011
Springer
14 years 9 months ago
Semi-homomorphic Encryption and Multiparty Computation
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
Rikke Bendlin, Ivan Damgård, Claudio Orlandi...
FSE
2011
Springer
264views Cryptology» more  FSE 2011»
14 years 9 months ago
An Improved Algebraic Attack on Hamsi-256
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
Itai Dinur, Adi Shamir
FSE
2011
Springer
263views Cryptology» more  FSE 2011»
14 years 9 months ago
Practical Near-Collisions on the Compression Function of BMW
Abstract. Blue Midnight Wish (BMW) is one of the fastest SHA-3 candidates in the second round of the competition. In this paper we study the compression function of BMW and we obta...
Gaëtan Leurent, Søren S. Thomsen
PKC
2011
Springer
197views Cryptology» more  PKC 2011»
14 years 9 months ago
Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
We investigate the security of a generalization of HFE (multivariate and odd-characteristic variants). First, we propose an improved version of the basic Kipnis-Shamir key recovery...
Luk Bettale, Jean-Charles Faugère, Ludovic ...