Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Winnen Laura"'
Publikováno v:
Journal of Mathematical Cryptology, Vol 9, Iss 3, Pp 139-150 (2015)
We consider the generic design of compression functions based on two n-bit permutations and XOR-based mixing functions. It is known that any such function mapping n+α${n+\alpha }$ to α bits, with 1≤α≤n${1\le \alpha \le n}$, can achieve at most
Externí odkaz:
https://doaj.org/article/fb2c816b966d42039aa0e8dabb48acbe
