MYCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
MYCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at ...
MYCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
MYCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
Klimov and Shamir proposed a new class of simple cryptographic primitives named T-functions. For two concrete proposals based on the squaring operation, a single word T-function an...
MYCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = k i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤ c + o(1) ¡ log n log log n ....
MYCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
MYCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
Recently, some collisions have been exposed for a variety of cryptographic hash functions [20,21] including some of the most widely used today. Many other hash functions using simi...