The security of modern cryptography relies on the quality of random numbers, used as secret keys, private keys, and ephemeral and initializing variables. The research in the last 3 decades have established the foundations of cryptographic randomness, in terms of its entropy under the different measures and its complexity as methods of representation and underlying mathematical functions. While the definition of mathematical randomness and properties of ideal random number generators are well understood, creating hardware and software realization of deterministic, hybrid and true random number generators on resource-restricted hardware remains to be a challenging problem. We are working on new methods of building random number generators that are cryptographically strong however requiring minimal resources in terms of speed, space and power.

• M. Stipcevic and Ç. K. Koç. True Random Number Generators. Open Problems in Mathematics and Computational Science, Ç. K. Koç, editor, pages 275-315, Springer, December 2014.   pdf
• İ. Çiçek, A. E. Pusane, and G. Dündar. A novel dual entropy core true random number generator. Journal of Analog Integrated Circuits and Signal Processing, Vol. 81, No. 1, pages 61-70, 2014.

→   Homomorphic Encryption