Diophantine equations are used in cryptosystems, since they play a significant role in cryptography, particularly in the realm of public-key cryptography. The complexity and computational difficulty
Alexander Rahn, Eldar Sultanow, Max Henkel, Sourangshu Ghosh et Idriss J. Aberkane – MDPI
– Alexander Rahn, Eldar Sultanow and Idriss J. Aberkane on arXiv, Cornwell University
Idriss J. Aberkane August 15, 2017 Abstract We investigate recurrent behaviors of the 1 (3x + 1) action (« Syr ») over the binary tree. The original
Proceedings CIEAEM 58 –SRNI, Czech Republic, July 9-15, 2006 “Quaderni di Ricerca in Didattica (Matematica)”, Supplemento n. 2, 2009. G.R.I.M. (Department of Mathematics, University of
CIEAEM 57 – Italie – Italy Oral presentations Piazza Armerina, July 23-29, 2005 Abstract We aim to develop a new way of teaching mathematics by
© Idriss J. Aberkane | Tous droits réservés.
