16430 search results - page 645 / 3286 » On Computable Tree Functions |
202
click to vote
ACISP
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. We present two (related) dedicated hash functions that deliberately borrow heavily from the block ciphers that appeared in the final stages of the AES process. We explor...
135
click to vote
SIPS
2007
IEEE
16 years 1 months ago
2007
IEEE
A hardware ef cient approach is introduced for elementary function evaluations in certain structured matrix computations. It is a comprehensive approach that utilizes lookup table...
169
click to vote
ICICS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. In a paper published in FSE 2007, a way of obtaining nearcollisions and in theory also collisions for the FORK-256 hash function was presented [8]. The paper contained ex...
228
click to vote
HYBRID
2010
Springer
16 years 9 days ago
2010
Springer
Exponential stability of switched linear systems under both arbitrary and proper switching is studied through two suitably defined families of functions called the strong and the...
171
click to vote
ISLPED
1996
ACM
15 years 11 months ago
1996
ACM
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...