331 search results - page 3 / 67 » New Results on the Pseudorandomness of Some Blockcipher Cons... |
CRYPTO
2012
Springer
11 years 10 months ago
2012
Springer
Liskov, Rivest and Wagner formalized the tweakable blockcipher (TBC) primitive at CRYPTO’02. The typical recipe for instantiating a TBC is to start with a blockcipher, and then b...
FSE
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Bellare and Kohno introduced a formal framework for the study of related-key attacks against blockciphers. They established sufficient conditions (output-unpredictabilit...
CRYPTO
2001
Springer
14 years 10 days ago
2001
Springer
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other...
FOCS
1999
IEEE
14 years 4 days ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
EJC
2008
13 years 8 months ago
2008
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons)...