Title :
Statistical properties of modular multiplication modulo a power of two
Author :
Rishakani, A. Mahmoodi ; Dehnavi, S.M. ; Shamsabad, M.R.M. ; Maimani, Hamidreza ; Pasha, Einollah
Abstract :
In this paper, we investigate statistical properties of modular multiplication modulo a power of two. In fact, we obtain the distribution of every single bit of modular multiplication. Moreover, we determine the distribution of modular multiplication as a vectorial Boolean function. Then, the joint distribution of modular multiplication component bits is discussed: an explicit formula in the case of two component bits is determined and for the joint distribution of any number of component bits we prove a theorem. As a result of this theorem, we calculate the joint distribution of any number of component bits of modular multiplication modulo a power of two with reasonable computational complexity.
Keywords :
Boolean functions; computational complexity; cryptography; statistical analysis; vectors; computational complexity; explicit formula; modular multiplication modulo; power-two modular multiplication component bits; statistical properties; vectorial Boolean function; Boolean functions; Ciphers; Educational institutions; Finite element methods; Joints; Vectors; Boolean function; Computational complexity; Joint distribution; Modular multiplication; Symmetric cipher; T-function;
Conference_Titel :
Information Security and Cryptology (ISCISC), 2012 9th International ISC Conference on
Conference_Location :
Tabriz
Print_ISBN :
978-1-4673-2387-1
DOI :
10.1109/ISCISC.2012.6408183