hamidreza maimani - Academia.edu (original) (raw)
Uploads
Papers by hamidreza maimani
In this paper, we investigate some statistical properties of multiplication mod 2 for cryptograph... more In this paper, we investigate some statistical properties of multiplication mod 2 for cryptographic use. For this purpose, we introduce a family of T-functions similar to modular multiplication, which we call M-functions. We obtain the probability distribution of M-functions as vectorial Boolean functions. At first, we determine the joint probability distribution of arbitrary number of the output of an M-function component bits. Then, we obtain the probability distribution of the component Boolean functions of combination of a linear transformation with an M-function. After that, using a new measure for computing the imbalance of maps, we show that the restriction of the output of an M-function to its upper bits is asymptotically balanced.
Applied Mathematics and Computation
Abstract The watching system, as a generalization of identifying code, has been defined by Auger ... more Abstract The watching system, as a generalization of identifying code, has been defined by Auger in 2010. The identifying code has been used to wireless networks and it has been also applied to locate objects in the sensor networks. On the other hand, the graph product is employed in most of the mathematic branches such as network design to study the structure of network elements. In this paper, we give some upper bounds for the watching number of well-know product graphs.
Bulletin of the Iranian Mathematical Society
2015 12th International Iranian Society of Cryptology Conference on Information Security and Cryptology (ISCISC), 2015
Rendiconti del Seminario Matematico della Università di Padova, 2015
Pacific Journal of Mathematics, 2011
2014 11th International ISC Conference on Information Security and Cryptology, 2014
In this paper, we investigate some statistical properties of multiplication mod 2 for cryptograph... more In this paper, we investigate some statistical properties of multiplication mod 2 for cryptographic use. For this purpose, we introduce a family of T-functions similar to modular multiplication, which we call M-functions. We obtain the probability distribution of M-functions as vectorial Boolean functions. At first, we determine the joint probability distribution of arbitrary number of the output of an M-function component bits. Then, we obtain the probability distribution of the component Boolean functions of combination of a linear transformation with an M-function. After that, using a new measure for computing the imbalance of maps, we show that the restriction of the output of an M-function to its upper bits is asymptotically balanced.
Applied Mathematics and Computation
Abstract The watching system, as a generalization of identifying code, has been defined by Auger ... more Abstract The watching system, as a generalization of identifying code, has been defined by Auger in 2010. The identifying code has been used to wireless networks and it has been also applied to locate objects in the sensor networks. On the other hand, the graph product is employed in most of the mathematic branches such as network design to study the structure of network elements. In this paper, we give some upper bounds for the watching number of well-know product graphs.
Bulletin of the Iranian Mathematical Society
2015 12th International Iranian Society of Cryptology Conference on Information Security and Cryptology (ISCISC), 2015
Rendiconti del Seminario Matematico della Università di Padova, 2015
Pacific Journal of Mathematics, 2011
2014 11th International ISC Conference on Information Security and Cryptology, 2014