2967 search results - page 209 / 594 » Cryptology |
169
click to vote
CUZA
2010
15 years 4 months ago
2010
In this paper, we describe a symbolic synthesis method which given an algebraic expression that specifies a bitstream function f, constructs a (minimal) Mealy machine that realise...
294
click to vote
CODCRY
2011
Springer
14 years 10 months ago
2011
Springer
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
245
click to vote
PKC
2011
Springer
14 years 10 months ago
2011
Springer
Bos, Kaihara, Kleinjung, Lenstra, and Montgomery recently showed that ECDLPs on the 112-bit secp112r1 curve can be solved in an expected time of 65 years on a PlayStation 3. This p...
223
click to vote
CANS
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. In this paper we analyze the recently proposed light-weight block cipher PRINTCipher. Applying algebraic methods and SAT-solving we are able to break 8 rounds of PRINTCip...
179
click to vote
CRYPTO
2011
Springer
14 years 7 months ago
2011
Springer
We prove that Tandem-DM, one of the two “classical” schemes for turning a blockcipher of 2n-bit key into a double block length hash function, has birthday-type collision resist...