Sciweavers

ASIACRYPT
2008
Springer
13 years 10 months ago
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
Mathias Herrmann, Alexander May
ASIACRYPT
2008
Springer
13 years 10 months ago
Twisted Edwards Curves Revisited
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
Hüseyin Hisil, Kenneth Koon-Ho Wong, Gary Car...
ASIACRYPT
2008
Springer
13 years 10 months ago
On the Security of HB# against a Man-in-the-Middle Attack
Khaled Ouafi, Raphael Overbeck, Serge Vaudenay
AFRICACRYPT
2008
Springer
13 years 10 months ago
Differential Cryptanalysis of Reduced-Round PRESENT
: In this paper, we have presented flaws in differential cryptanalysis of reduced round variant of PRESENT given by M.Wang in [3] [4] for 80 bits key length and we have shown that ...
Meiqin Wang
AFRICACRYPT
2008
Springer
13 years 10 months ago
How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
Jean-Philippe Aumasson, Raphael C.-W. Phan
AFRICACRYPT
2008
Springer
13 years 10 months ago
An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees
Proof-of-work schemes are economic measures to deter denial-of-service attacks: service requesters compute moderately hard functions the results of which are easy to check by the ...
Fabien Coelho
AFRICACRYPT
2008
Springer
13 years 10 months ago
Yet Another Attack on Vest
Pascal Delaunay, Antoine Joux
ACNS
2008
Springer
94views Cryptology» more  ACNS 2008»
13 years 10 months ago
An Authentication Scheme Based on the Twisted Conjugacy Problem
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. The alleged computational hardness of this problem in some groups was...
Vladimir Shpilrain, Alexander Ushakov
ACNS
2008
Springer
96views Cryptology» more  ACNS 2008»
13 years 10 months ago
Efficient Device Pairing Using "Human-Comparable" Synchronized Audiovisual Patterns
Abstract. "Pairing" is referred to as the operation of achieving authenticated key agreement between two human-operated devices over a short- or medium-range wireless com...
Ramnath Prasad, Nitesh Saxena
FSE
2009
Springer
148views Cryptology» more  FSE 2009»
13 years 11 months ago
Cryptanalysis of the LAKE Hash Family
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitiv...
Alex Biryukov, Praveen Gauravaram, Jian Guo, Dmitr...