Articles in International Journals and Conferences

  • 2017
  1. Abdoul Aziz Ciss and Dustin Moody. Arithmetic Progressions on Conics. Journal of Integer Sequences, 20 (2), 3, 2017.
  • 2016
  1. Abdoul Aziz Ciss and Emmanuel Fouotsa. Faster Ate Pairing Computation on Selmer’s Model of Elliptic Curves. To appear in Groups, Complexity, Cryptography
  • 2015
  1. Abdoul Aziz Ciss. Trends in Elliptic Curves Cryptography, IMHOTEP: African Journal of Pure and Applied Mathematics 2 (1), 1-12.
  2. Nadia El Mrabet and Emmanuel Fouotsa. Failure of the Point Blinding Countermeasure against Fault Attack in Pairing-Based Cryptography , in Codes, Cryptology and Information Security, LNCS Vol 9084 PP 259-273 Springer.(2015)
  3. Pierre-Louis Cayrel, Cheikh Thiécoumba Gueye, Ousmane Ndiaye, Robert Niebuhr. Critical attacks in code-based cryptography, International Journal of Information and Coding Theory (IJICOT), Vol. 3, No. 2, 2015 DOI: 10.1504/IJICOT.2015.072639
  4. J-M Couveignes and Tony Ezome. Computing functions on Jacobians and their quotients.  LMS J. Comput. Math. 18(2015), no. 1, 555–577.
  5. Ayoub Otmani, Hervé Talé Kalachi. Square Code Attack on a Modified Sidelnikov Cryptosystem. Codes, Cryptology, and Information Security .Volume 9084 of the series Lecture Notes in Computer Science-Springer pp 173-183
  6. Hortense Boudjou, Abdoul Aziz Ciss, Djiby Sow and Kolyang. Multi-sources randomness extractors in nite fields and in elliptic curves, In proceeding of the CRI’2015
  • 2014
  1. Pierre-Louis Cayrel, Mohammed Meziani, Ousmane Ndiaye and Quentin Santos. Efficient Software Implementations of Code-based Hash Functions and Stream-Ciphers, International Workshop on the Arithmetic of Finite Fields in Gebze, Turkey. September 26-28, 2014. DOI :
  2. Alassane Diouf and Ousmane Ndiaye. Idempotent, Zero Divisors and Nilpotent Elements of the Quaternion and Octonion rings over  F_p^r, JPANTA Volume 8, Issues 1-2, Pages 17-32 (September & December 2014)
  3. Sylvain Duquesne, Nadia El Mrabet, Emmanuel Fouotsa. Efficient computation of pairings on Jacobi quartic elliptic curves. J. Mathematical Cryptology 8(4): 331-362 (2014)
  • 2013

  1. Jean-Marc Couveignes, Tony Ezome and Reynald Lercier. A faster pseudo-primality test. Rendiconti del Circolo Matematico di Palermo, Second Series, pages 261–278, 2012.
  2. Tony Ezome and Reynald Lercier. Elliptic Periods and Primality Proving. Journal of Number Theory, Volume 133, Issue 1: pp. 343-368, 2013.
  3. Tony Ezome. Tests de primalité et de pseudo-primalité. Publications Mathématiques de Besançon, pages 89-106, 2013.
  4. Oumar Diao and Emmanuel FouotsaArithmetic of level four theta model of elliptic curvesIn Afrika Mathematika (Springer) (DOI) 10.1007/s13370-013-0203-1(2013).
  5. Sylvain Duquesne and Emmanuel Fouotsa. Tate pairing computation on Jacobi’s elliptic curves. In Michel Abdalla and Tanja Lange, editors, Pairing-Based Cryptolography Pairing 2012, volume 7708 of Lecture Notes in Computer Science, pages 254-269. Springer Berlin Hiedelberg, 2013.
  6. Abdoul Aziz Ciss, AY Cheikh. A Factoring and Discrete Logarithm based CryptosystemInternational Journal of Contemporary Mathematical Sciences 8 (11), 511-517. 2013
  7. Abdoul Aziz Ciss, D Sow. Randomness Extraction in finite fields, International Journal of Algebra 7 (9), 409-420. 2013