948 search results - page 130 / 190 » Attacking cryptographic schemes based on |
ICISC
2007
13 years 9 months ago
2007
In the 80’s Matsumoto and Imai [8] proposed public key cryptosystems based on the difficulty of solving systems of polynomials in several variables. Although these first schemes...
ASIACRYPT
2011
Springer
12 years 8 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
MYCRYPT
2005
Springer
14 years 1 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 ....
JCST
2008
13 years 8 months ago
2008
Current techniques for transforming unforgeable signature schemes (the forged message has never been signed) to strongly unforgeable ones (the forged message could have been signed...
ACSAC
2002
IEEE
14 years 1 months ago
2002
IEEE
Large-scale distributed systems present numerous security problems not present in local systems. In this paper we present a general security architecture for a large-scale object-...