Utilisateur·rice

Alexis • Bonnecaze
Professeur (PR) • Affiliation : Aix-Marseille Université (AMU)
Site : Luminy • Bureau : 107 • Etage du bureau : 1 •

Responsable du groupe AGLR (depuis 2018).

Groupe(s) scientifiques(s) de l'utilisateur :

Rechercher mots clef :
    Self-orthogonal codes Secondary 16 A10 Non-unital rings Finite field Merkle tree Data structure Authenticated dictionary

Thématiques scientifiques :
  • Cryptography
  • Algebraic geometry (null and positive characteristic)
  • Discrete mathematics

Publications HAL

2020/10 - THE BUILD-UP CONSTRUCTION OVER A COMMUTATIVE NON-UNITAL RING

2020/08 - Multiplication in finite fields with Chudnovsky-type algorithms on the projective line

2020/07 - Optimization of the scalar complexity of Chudnovsky$^2$ multiplication algorithms in finite fields

2020/06 - Blind Transfer of Personal Data Achieving Privacy

2020/04 - Quasi Type IV codes over a non-unital ring

2020/01 - The build-up construction of quasi self-dual codes over a non-unital ring

2020/01 - Type IV codes over a non-unital ring

2020/01 Proyecciones : Revista de Matemática - Quasi Self-dual Codes over Non-Unital Rings of Order Six

2020/01 Mathematics - A New Secret Sharing Scheme Based on Polynomials over Finite Fields

2020/01 Proyecciones : Revista de Matemática - Type IV codes over a non-local non-unital ring

2019/09 - Une formation d'ingénieurs dédiée à des personnes en situation de handicap

2019/06 - On the scalar complexity of Chudnovsky multiplication algorithm in finite fields

2019/04 - CONSTRUCTION OF ASYMMETRIC CHUDNOVSKY ALGORITHMS WITHOUT DERIVATED EVALUATION FOR MULTIPLICATION IN FINITE FIELDS

2017/11 Mathematics of Computation - Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm

2017/07 Comptes Rendus Mathématique - On the construction of the asymmetric Chudnovsky multiplication algorithm in finite fields without derivated evaluation

2017/01 IACR Transactions on Symmetric Cryptology - Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3

2016/11 - On The Effective Construction of Asymmetric Chudnovsky Multiplication Algorithms in Finite Fields Without Derivated Evaluation

2016/01 Comptes rendus de l'Académie des sciences. Série I, Mathématique - Effective arithmetic in finite fields based on Chudnovsky's multiplication algorithm

2016/01 Journal of Algebra and Its Applications - On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields

2015/01 Computers and Security - New models for efficient authenticated dictionaries

2014/06 - Authenticated Dictionary Based on Frequency

2014/01 - Authenticated dictionary based on frequency

2013/01 Designs, Codes and Cryptography - AES Side-Channel Countermeasure using Random Tower Field Constructions

2011/01 International Journal On Advances in Networks and Services - Unifom Generators and Combinatorial Design

2007/11 Annals of Telecommunications - annales des télécommunications - Threshold signature for distributed time stamping scheme

2006/06 Annals of Telecommunications - annales des télécommunications - Secure time-stamping schemes: a distributed point of view

2003/09 IEEE Transactions on Information Theory - Cubic self-dual binary codes

2003/08 Discrete Mathematics - Splitting the shadow

2001/10 Discrete Mathematics - Tricolore 3-designs in Type III codes

1999/05 IEEE Transactions on Information Theory - Decoding of cyclic codes over F/sub 2/+uF/sub 2


Retour en haut 

Secured By miniOrange