RC5 (Block Ciphers Block Ciphers)

Time Complexity

$O(n)$

Space Complexity

$O(k+rw)$? bits

(Requires additional O(k/w)-length array of O(w)-size words (temporary working array) and O(r)-length array of O(w)-size words, as key-independent pseudorandom array.)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1994

Reference

https://link.springer.com/chapter/10.1007/3-540-60590-8_7