| On the Scalar Complexity of Chudnovsky 2 Multiplication Algorithm in Finite Fields. | 0 | 0.34 | 2019 |
| Asymptotic Analysis Of Plausible Tree Hash Modes For Sha-3 | 0 | 0.34 | 2017 |
| Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm. | 0 | 0.34 | 2017 |
| On Plausible Tree Hash Modes for SHA-3. | 1 | 0.41 | 2016 |
| New models for efficient authenticated dictionaries | 1 | 0.39 | 2015 |
| On Chudnovsky-Based Arithmetic Algorithms in Finite Fields | 0 | 0.34 | 2015 |
| AES side-channel countermeasure using random tower field constructions | 6 | 0.51 | 2013 |
| Collecting Data while Preserving Individuals' Privacy: A Case Study. | 0 | 0.34 | 2012 |
| Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model | 1 | 0.36 | 2009 |
| On Key Distribution in MANETs | 0 | 0.34 | 2009 |
| A Secure Round-Based Timestamping Scheme with Absolute Timestamps (Short Paper) | 1 | 0.37 | 2008 |
| Signtiming scheme based on aggregate signature | 1 | 0.37 | 2008 |
| Apport de la cryptographie elliptique dans le vote électronique | 0 | 0.34 | 2008 |
| Threshold signature for distributed time stamping scheme. | 2 | 0.40 | 2007 |
| Etude des systèmes d'horodatage | 1 | 0.39 | 2007 |
| Secure time-stamping schemes: a distributed point of view. | 7 | 0.60 | 2006 |
| Broadcasting in Hypercubes in the Circuit Switched Model | 4 | 0.47 | 2000 |
| Niemeier lattices and Type II codes over Z4 | 5 | 0.85 | 1999 |
| Jacobi Polynomials, Type II Codes, and Designs | 3 | 0.88 | 1999 |
| Decoding of cyclic codes over F2 + µF2 | 0 | 0.34 | 1999 |
| Correction to 'Quanternary Quadratic Residue Codes and Unimodular Lattices | 0 | 0.34 | 1995 |
| Quaternary constructions of formally self-dual binary codes and unimodular lattices | 3 | 2.18 | 1993 |
