Laurent Imbert

IACR Cryptol. ePrint Arch., 2020

Improved divisor arithmetic on generic hyperelliptic curves.

[BibT_eX]

[DOI]

Sebastian Lindner

ACM Commun. Comput. Algebra, 2020

Balanced NUCOMP.

[BibT_eX]

[DOI]

Sebastian Lindner

Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2019

Side-channel Attacks on Blinded Scalar Multiplications Revisited.

[BibT_eX]

[DOI]

Thomas Roche

Victor Lomné

IACR Cryptol. ePrint Arch., 2019

Breaking Randomized Mixed-Radix Scalar Multiplication Algorithms.

[BibT_eX]

[DOI]

Jérémie Detrey

Proceedings of the Progress in Cryptology - LATINCRYPT 2019, 2019

2018

Randomized Mixed-Radix Scalar Multiplication.

[BibT_eX]

[DOI]

Eleonora Guerrini

Théo Winterhalter

IEEE Trans. Computers, 2018

Faster cofactorization with ECM using mixed representations.

[BibT_eX]

[DOI]

Cyril Bouvier

IACR Cryptol. ePrint Arch., 2018

2017

Encryption Switching Protocols Revisited: Switching modulo p.

[BibT_eX]

[DOI]

Guilhem Castagnos

Fabien Laguillaumie

IACR Cryptol. ePrint Arch., 2017

2015

Vertical and horizontal correlation attacks on RNS-based exponentiations.

[BibT_eX]

[DOI]

J. Cryptogr. Eng., 2015

Randomizing Scalar Multiplication Using Exact Covering Systems of Congruences.

[BibT_eX]

[DOI]

Eleonora Guerrini

Théo Winterhalter

IACR Cryptol. ePrint Arch., 2015

2014

On the Maximal Weight of (P, Q)-ary Chain Partitions With Bounded Parts.

[BibT_eX]

[DOI]

Filippo Disanto

Fabrice Philippe

Integers, 2014

Attacking Randomized Exponentiations Using Unsupervised Learning.

[BibT_eX]

[DOI]

Proceedings of the Constructive Side-Channel Analysis and Secure Design, 2014

2013

Empirical optimization of divisor arithmetic on hyperelliptic curves over F2m.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2013

Electromagnetic Analysis on RSA Algorithm Based on RNS.

[BibT_eX]

[DOI]

Proceedings of the 2013 Euromicro Conference on Digital System Design, 2013

Practical Analysis of RSA Countermeasures Against Side-Channel Electromagnetic Attacks.

[BibT_eX]

[DOI]

Proceedings of the Smart Card Research and Advanced Applications, 2013

Parallel Modular Multiplication on Multi-core Processors.

[BibT_eX]

[DOI]

Pascal Giorgi

Thomas Izard

Proceedings of the 21st IEEE Symposium on Computer Arithmetic, 2013

2011

Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems.

[BibT_eX]

[DOI]

Jithra Adikari

IEEE Trans. Computers, 2011

2010

Strictly chained (p, q)-ary partitions.

[BibT_eX]

[DOI]

Fabrice Philippe

Contributions Discret. Math., 2010

Fast ideal cubing in imaginary quadratic number and function fields.

[BibT_eX]

[DOI]

Arthur Schmidt

Adv. Math. Commun., 2010

2009

Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System.

[BibT_eX]

[DOI]

Valérie Berthé

Discret. Math. Theor. Comput. Sci., 2009

Accelerating Query-by-Humming on GPU.

[BibT_eX]

[DOI]

Proceedings of the 10th International Society for Music Information Retrieval Conference, 2009

Hybrid Binary-Ternary Joint Form and Its Application in Elliptic Curve Cryptography.

[BibT_eX]

[DOI]

Jithra Adikari

Proceedings of the 19th IEEE Symposium on Computer Arithmetic, 2009

2008

The double-base number system and its application to elliptic curve cryptography.

[BibT_eX]

[DOI]

Pradeep Kumar Mishra

Math. Comput., 2008

Hybrid Binary-Ternary Joint Sparse Form and its Application in Elliptic Curve Cryptography.

[BibT_eX]

[DOI]

Jithra Adikari

IACR Cryptol. ePrint Arch., 2008

The double-base number system in elliptic curve cryptography.

[BibT_eX]

[DOI]

Christophe Doche

Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008

Arithmexotiques.

[BibT_eX]

[DOI]

Nicolas Veyrat-Charvillon

, 2008

2007

Multi-mode operator for SHA-2 hash functions.

[BibT_eX]

[DOI]

J. Syst. Archit., 2007

Multiplication by a Constant is Sublinear.

[BibT_eX]

[DOI]

Andrew Zakaluzny

Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH-18 2007), 2007

2006

Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation.

[BibT_eX]

[DOI]

Christophe Nègre

IEEE Trans. Computers, 2006

Extended Double-Base Number System with applications to Elliptic Curve Cryptography.

[BibT_eX]

[DOI]

Christophe Doche

IACR Cryptol. ePrint Arch., 2006

2005

Fast Elliptic Curve Point Multiplication using Double-Base Chains.

[BibT_eX]

[DOI]

P. K. Mishra

IACR Cryptol. ePrint Arch., 2005

Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains.

[BibT_eX]

[DOI]

Pradeep Kumar Mishra

Proceedings of the Advances in Cryptology, 2005

A Fault-Tolerant Modulus Replication Complex FIR Filter.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE International Conference on Application-Specific Systems, 2005

Arithmetic Operations in the Polynomial Modular Number System.

[BibT_eX]

[DOI]

Thomas Plantard

Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH-17 2005), 2005

2004

A Full RNS Implementation of RSA.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2004

Parallel Montgomery Multiplication in GF(2k) using Trinomial Residue Arithmetic.

[BibT_eX]

[DOI]

Graham A. Jullien

IACR Cryptol. ePrint Arch., 2004

Modular Number Systems: Beyond the Mersenne Family.

[BibT_eX]

[DOI]

Thomas Plantard

Proceedings of the Selected Areas in Cryptography, 11th International Workshop, 2004

Leak Resistant Arithmetic.

[BibT_eX]

[DOI]

Proceedings of the Cryptographic Hardware and Embedded Systems, 2004

2003

Efficient Multiplication in GF(pk) for Elliptic Curve Cryptography.

[BibT_eX]

[DOI]

Proceedings of the 16th IEEE Symposium on Computer Arithmetic (Arith-16 2003), 2003

2002

Modular Multiplication in GF(pk) Using Lagrange Representation.

[BibT_eX]

[DOI]

Christophe Nègre

Proceedings of the Progress in Cryptology, 2002

2001

The Use of the Multi-Dimensional Logarithmic Number System in DSP Applications.

[BibT_eX]

[DOI]

Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 2001

2000

A Radix-10 BKM Algorithm for Computing Transcendentals on Pocket Computers.

[BibT_eX]

[DOI]