Conference on Algebra, Codes and Cryptology (A2C) in honor of Mamadou Sanghare,  

December 5-7,  2019.   

  

The conference website is under construction.     

Aim :  

The LACGAA group at Universite Cheikh Anta Diop de Dakar is hosting a conference to pay homage to professor Mamadou Sanghare for his contribution in the development of mathematics and his role in promoting excellence in STEM training in Senegal. The conference aims to provide a forum for researchers from all over the world  to present results and exchange ideas on topics in non-commutative algebra,  cryptology, coding theory and information security.  

Honorary  Chairs  

    1. Amin El Kaidy   
  1. Mamadou Sangharé     Cheikh Anta Diop University, Dakar, Senegal. 

 

General  Chair   

Cheikh Thiecoumba Gueye     Cheikh Anta Diop University, Dakar, Senegal 

 

Program  Chairs  

Edoardo Persichetti                Florida Atlantic University, USA 

Cheikh Thiecoumba Gueye    Cheikh Anta Diop University, Dakar, Senegal 

Pierre-Louis Cayrel                  St Etienne  University, france 

Johannes Buchmann               Darmstadt  university, Germany 

  

Local Organization Committee   

Leila Mesmoudi (Chair)        Cheikh Anta Diop University, Dakar, Senegal 

Amadou Tall (Co-Chair)         Cheikh Anta Diop University, Dakar, Senegal 

Oumar Diankha                       Cheikh Anta Diop University, Dakar, Senegal 

Ismaila Diouf                           Cheikh Anta Diop University, Dakar, Senegal 

Mamadou Barry                     Cheikh Anta Diop University, Dakar, Senegal 

Babacar Alassane Ndaw      Commission Nationale de Cryptologie, PR, Senegal 

Demba Sow                             Cheikh Anta Diop University, Dakar, Senegal 

Djiby Sow                                Cheikh Anta Diop University, Dakar, Senegal 

Ousmane Ndiaye                     Cheikh Anta Diop University, Dakar, Senegal 

Alassane Diouf                       Cheikh Anta Diop University, Dakar, Senegal 

Anta Niane Gueye                    Cheikh Anta Diop University, Dakar, Senegal 

Moustapha Sokhna                  Cheikh Anta Diop University, Dakar, Senegal 

Cherif Deme                              Alioune Diop University, Mbambey, Senegal 

Mouhamed Ben Maaouia           Gaston Berger University, St Louis, Senegal 

Sidy Demba Toure                   Cheikh Anta Diop University, Dakar, Senegal 

A completer 

Program Committee   

(A grouper par specialisation ALGEBRA / CODING THEORY / CRYPTOGRAPHY) 

Abderrahmane Nitaj (Caen), abderrahmane.nitaj@unicaen.fr 

Ayoub Otmani, ( Ayoub.Otmani@univ-rouen.fr 

Azizi Abdel Malick (Mohammed I University, Morocco. 

Consuelo Martínez  López ( 

Daouda Sangare, dsangare@yahoo.fr 

Edgar Martinez Moro (Univ  de Valladolid), edgar.martinez@uva.es 

El Mamoun  Souidi (Univ Mohammed V), emsouidi@gmail.com  

Efim Zelmanov (UC San Diego),   

Irene Marquez (Univ de La Laguna) ,  imarquec@ull.edu.es 

Ivan Shestakov (Univ Sao Polo) 

JUAN ANTONIO LOPEZ RAMOS <jlopez@ual.es> 

Kaoutit Laiaichi, kaoutit@ugr.es  

Kenza Guenda (univ of Victoria)  

Mercedes Molina (univ Malaga), msilesm@uma.es 

Nadia Boudi (), nadia_boudi@hotmail.com  

Nouzha El Yacoubi, nelyacoubi4@gmail.com  

Patrick Solé (Telecom Paris Tech), patrick.sole@telecom-paristech.fr 

Pierre Loidreau (univ Rennes), pierre.loidreau@univ-rennes1.fr  

Said Elhajji    elhajji.said@gmail.com  

Saliou Touré, pr_stoure@yahoo.fr  

Sylvain Guilley (Telecom Paris Tech), sylvain.guilley@secure-ic.com 

Thierry Berger (univ Limoge ), thierry.berger@unilim.fr  

Vyacheslav Futorny vfutorny@gmail.com 

 

Not yet confirmed : 

Phillipe Gaborit (univ Limoge)  

Sihem Mesnager (univ  Paris 8) sihem.mesnager@univ-paris8.fr  

Nicolas Sendrier (INRIA Paris) nicolas.sendrier@inria.fr  

 

Not Yet Contacted 

Rafael Misoczki (Intel California) rafael.misoczki@intel.com  

Jean-Pierre Tillich (INRIA Paris) jean-pierre.tillich@inria.fr  

Pascal Véron (univ Toulon) veron@univ-tln.fr  

Claude Carlet ( à contacter) 

To complete  

Invited Speakers :   

  • Non-Commutative Algebra   

 

Ken Goodearl (California university, Santa Barbara, USA) 

Title: 

Author: 

ABSTRACT: 

 

 

Ivan Shestakov  (University of Sao Paulo  ivan.shestakov@gmail.com) 

 

Title:  Speciality problem for Malcev algebras. 

Author : Ivan Shestakov 

ABSTRACT : 

A Malcev algebra is an algebra that satisfies the identities 

 

xx=0,    J(xy,z,x)=J(x,y,z)x, 

 

where J(x,y,z)=(xy)z+(yz)x+(zx)y.  

 

Clearly, any Lie algebra is a Malcev algebra.  

If A is an alternative algebra then it forms a Malcev algebra A^{-} with respect to the commutator multiplication [a,b]=ab-ba. 

The most known examples of  non-Lie Malcev algebras is the algebra O^{-} for an octonion algebra O and its subalgebra sl(O) consisting of octonions with zero trace.  

Every simple non-Lie Malcev algebra is isomorphic to sl(O). 

 

The problem of speciality, formulated by A.I.Malcev in 1955, asks whether any Malcev algebra is isomorphic to a subalgebra of A^{-} for certain alternative algebra A.  

In other words, it asks whether an analogue of the celebrated Poincare-Bikhoff-Witt theorem is true for Malcev algebras.   

We show that the answer to this problem is negative, by constructing a Malcev algebra which is not embeddable  into  an algebra A^{-} for any alternative algebra A. 

 

 

  • Codes and Cryptology   

 

Consuelo Martínez  López chelo@orion.ciencias.uniovi.es 

 

Title:  AROUND GROUP CODES 

Author:  Consuelo Martínez  López 

ABSTRACT 

Given a group G, a G-code over a field F can be identified with a (left, right or two-sided) ideal  in the ring group FG.  If we do not want to specify the group G we simply speak of group codes. 

The first widely studied group codes were cyclic codes, that is, C-codes for a cyclic group C.  Soon after, abelian group codes, that is, A-codes for a finite abelian group A, were considered. 

The next natural step is to consider group codes over arbitrary groups, not necessarily abelian. 

Since the same code can be considered as G-code and H-code for two different groups G and H, the first question that arises is:  Is there every group code and abelian group code? 

An affirmative answer to this question would make meaningless the study of non abelian group codes.  Why use non abelian groups, clearly more complicated that the abelian ones if we can get everything with abelian groups? 

However the answer to this question is negative.  Our research group found the first examples of group codes that are not abelian group codes.  And later we could construct, using a non-abelian group, a code with better parameters than any code that can be constructed using an abelian group of the same order.  This example makes meaningful the study of non-abelian group codes. 

 

 

Claude Carlet  

Title:  Boolean functions for homomorphic-friendly stream ciphers  

Author: Claude Carlet  

ABSTRACT:  

The proliferation of small embedded devices having growing but limited computing (and data storage) facilities, and the development of cloud services with extensive storage and computing means, have recently raised new privacy concerns because of  the outsourcing of data processing. This has led to a need for symmetric cryptosystems suited for hybrid symmetric-FHE encryption protocols. Recent ciphers well suited for such use are the FLIP  stream cipher and his recent modification. The introduction of such stream ciphers has in its turn posed new problems on the Boolean functions to be used as filter functions in them. We recall the state of the art in this matter and present further studies. 

  

  • Information Security  

 

 Sylvain Guilley  (Telecom Paris Tech: sylvain.guilley@secure-ic.com) 

 

Titre : Detecting cache-timing vulnerabilities in post-quantum cryptography algorithms 

Authors : Sylvain Guilley

Abstract : When implemented on real systems, cryptographic algorithms are vulnerable to attacks observing their execution behavior, such as cache-timing attacks. Designing protected implementations must be done with knowledge and validation tools as early as possible in the development cycle. In this article we propose a methodology to assess the robustness of the candidates for the NIST post-quantum standardization project to cache-timing attacks. To this end we have developed a dedicated vulnerability research tool. It performs a static analysis with tainting propagation of sensitive variables across the source code and detects leakage patterns. We use it to assess the security of the NIST post-quantum cryptography project submissions. Our results show that more than 80% of the analyzed implementations have at least one potential flaw, and three submissions total more than 1000 reported flaws each. Finally, this comprehensive study of the competitors security allows us to identify the most frequent weaknesses. 

 

Sponsoring   

 

  

TIMELINE 

Debut Fevrier 2019, 

Submission starts 

————————————–  

Debut Avril 2019
Submission deadline
________________________________________
Mi Mai 2019
??? Hand out to referees
________________________________________
Fin Juin 2019 

Referees report
________________________________________
Fin Juillet 2019
Paper notification
________________________________________
Debut Septembre 2019
Final version due
________________________________________
December -5-7, 2019
Conference

Fermer le menu