1. Abadi, M., Burrows, M., Manasse, M.S., Wobber, T.: Moderately hard, memory-bound functions. ACM Trans. Internet Technol. 5(2), 299–327 (2005)
2. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., Pyle, R., Ganesan, R., Sandhu, R.S., Ashby, V. (eds.) CCS 1993, Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, USA, 3–5 November, 1993, pp. 62–73. ACM (1993)
3. Bernstein, R.L.: Multiplication by integer constants. Softw. Pract. Exper. 16(7), 641–652 (1986)
4. Lecture Notes in Computer Science;D Boneh,2000
5. Lecture Notes in Computer Science;O Ciobotaru,2012