397 search results - page 11 / 80 » Pseudorandom Functions and Lattices |
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
We consider two of the most fundamental theorems in Cryptography. The first, due to H
SCN
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Lattice reduction is known to be a very powerful tool in modern cryptanalysis. In the literature, there are many lattice reduction algorithms that have been proposed with...
60
Voted
EUSFLAT
2007
14 years 11 months ago
2007
Lattice-valued entropy functions defined by a lattice-valued possibilistic distribution π on a space Ω are defined as the expected value (in the sense of Sugeno integral) of ...
ISCAS
2008
IEEE
15 years 3 months ago
2008
IEEE
— The lack of robust tamper-proofing techniques in security applications has provided attackers the ability to virtually circumvent mathematically strong cryptographic primitive...
ASIACRYPT
2007
Springer
15 years 3 months ago
2007
Springer
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...