Desempenho de Implementações MPI de Redes Reversíveis usando Comunicação Unilateral e Tipos de Dados Derivados

• Matheus Liberato IFSP
• Carlos Henrique Costa Ribeiro ITA
• Jairo Panetta ITA

DOI: https://doi.org/10.5753/eradsp.2018.13597

Abstract

Due to a growing demand of protecting information, new cryptographic algorithms have been developed, such as those based on random reversible networks. The performance of MPI implementations of these algorithms is dominated by the amount of communication between processes, due to the structure of network connections. This paper investigates how to use One-Sided Communication and Derived Datatypes to speed-up such implementations.

References

Anghelescu, P. (2011). Encryption algorithm using programmable cellular automata. In 2011 World Congress on Internet Security (WorldCIS-2011), pages 233–239.

Erdos, P. and Renyi, A. (1960). On the evolution of random graphs. In PUBLICATION OF THE MATHEMATICAL INSTITUTE OF THE HUNGARIAN ACADEMY OF SCIENCES, pages 17–61.

Forum, M. P. (2015). Mpi: A message-passing interface standard. Technical report, MPI Forum, Knoxville, TN, USA.

Gutowitz, H. (1993). Cryptography with Dynamical Systems, pages 237–274. Springer Netherlands, Dordrecht.

Macêdo, H. B. d. (2014). Redes complexas e autômatos celulares aplicados à criptografia. PhD thesis, Instituto Tecnológico de Aeronáutica

Pacheco, P. (2011). An Introduction to Parallel Programming. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1st edition

Roy, S., Nandi, S., Dansana, J., and Pattnaik, P. K. (2014). Application of cellular automata in symmetric key cryptography. In 2014 International Conference on Communication and Signal Processing, pages 572–576.

Tomassini, M. and Perrenoud, M. (2001). Cryptography with cellular automata. Applied Soft Computing, 1(2):151 – 160.

Wolfram, S. (1984). Cellular automata as models of complexity. Nature, 311(5985):419–424.