Jean-Claude Bajard

Sylvain Duquesne

J. Cryptogr. Eng., 2021

Generating Residue Number System Bases.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE Symposium on Computer Arithmetic, 2021

2020

Improving the Efficiency of SVM Classification With FHE.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2020

An asymptotically faster version of FV supported on HPR.

[BibT_eX]

[DOI]

Proceedings of the 27th IEEE Symposium on Computer Arithmetic, 2020

2019

Resilience of Randomized RNS Arithmetic with Respect to Side-Channel Leaks of Cryptographic Computation.

[BibT_eX]

[DOI]

Jérôme Courtois

Lokman A. Abbas-Turki

IEEE Trans. Computers, 2019

Note on the noise growth of the RNS variants of the BFV scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

An HPR variant of the FV scheme: Computationally Cheaper, Asymptotically Faster.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

HyPoRes: An Hybrid Representation System for ECC.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE Symposium on Computer Arithmetic, 2019

2018

Montgomery reduction within the context of residue number system arithmetic.

[BibT_eX]

[DOI]

Julien Eynard

Nabil Merkiche

J. Cryptogr. Eng., 2018

Evaluation of Resilience of randomized RNS implementation.

[BibT_eX]

[DOI]

Jérôme Courtois

Lokman A. Abbas-Turki

IACR Cryptol. ePrint Arch., 2018

2017

Arithmetical Improvement of the Round-Off for Cryptosystems in High-Dimensional Lattices.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2017

Efficient reductions in cyclotomic rings - Application to R-LWE based FHE schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Efficient Reductions in Cyclotomic Rings - Application to Ring-LWE Based FHE Schemes.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography - SAC 2017, 2017

2016

A Full RNS Variant of FV like Somewhat Homomorphic Encryption Schemes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Multi-fault Attack Detection for RNS Cryptographic Architecture.

[BibT_eX]

[DOI]

Julien Eynard

Nabil Merkiche

Proceedings of the 23nd IEEE Symposium on Computer Arithmetic, 2016

2015

Programmable RNS lattice-based parallel cryptographic decryption.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Application-specific Systems, 2015

RNS Arithmetic Approach in Lattice-Based Cryptography: Accelerating the "Rounding-off" Core Procedure.

[BibT_eX]

[DOI]

Proceedings of the 22nd IEEE Symposium on Computer Arithmetic, 2015

2014

Double Level Montgomery Cox-Rower Architecture, New Bounds.

[BibT_eX]

[DOI]

Nabil Merkiche

IACR Cryptol. ePrint Arch., 2014

Babaï round-off CVP method in RNS: Application to lattice based cryptographic protocols.

[BibT_eX]

[DOI]

Proceedings of the 2014 International Symposium on Integrated Circuits (ISIC), 2014

2013

Fault Detection in RNS Montgomery Modular Multiplication.

[BibT_eX]

[DOI]

Julien Eynard

Filippo Gandino

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

2012

An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2012

RNS-Based Elliptic Curve Point Multiplication for Massive Parallel Architectures.

[BibT_eX]

[DOI]

Samuel Antao

Leonel Sousa

Comput. J., 2012

2011

A General Approach for Improving RNS Montgomery Exponentiation Using Pre-processing.

[BibT_eX]

[DOI]

Proceedings of the 20th IEEE Symposium on Computer Arithmetic, 2011

2010

Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation.

[BibT_eX]

[DOI]

Christophe Nègre

IEEE Trans. Computers, 2010

A New Security Model for Authenticated Key Agreement.

[BibT_eX]

[DOI]

Augustin P. Sarr

Philippe Elbaz-Vincent

IACR Cryptol. ePrint Arch., 2010

Combining leak-resistant arithmetic for elliptic curves defined over Fp and RNS representation.

[BibT_eX]

[DOI]

Sylvain Duquesne

Milos D. Ercegovac

IACR Cryptol. ePrint Arch., 2010

Elliptic Curve point multiplication on GPUs.

[BibT_eX]

[DOI]

Samuel Antao

Leonel Sousa

Proceedings of the 21st IEEE International Conference on Application-specific Systems Architectures and Processors, 2010

2009

A Secure and Efficient Authenticated Diffie - Hellman Protocol.

[BibT_eX]

[DOI]

Augustin P. Sarr

Philippe Elbaz-Vincent

IACR Cryptol. ePrint Arch., 2009

Selected RNS Bases for Modular Multiplication.

[BibT_eX]

[DOI]

Marcelo E. Kaihara

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

2006

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

[BibT_eX]

[DOI]

Christophe Nègre

IEEE Trans. Computers, 2006

A Parallel and Secure Architecture for Asymmetric Cryptography.

[BibT_eX]

Proceedings of the 2nd International Workshop on Reconfigurable Communication-centric Systems-on-Chip, 2006

A Leak Resistant Architecture Against Side Channel Attacks.

[BibT_eX]

[DOI]

Proceedings of the 2006 International Conference on Field Programmable Logic and Applications (FPL), 2006

2005

Arithmetic Operations in the Polynomial Modular Number System.

[BibT_eX]

[DOI]

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]

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

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Modular Multiplication and Base Extensions in Residue Number Systems.

[BibT_eX]

[DOI]

Peter Kornerup

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

1999

Foreword: Real Numbers and Computers.

[BibT_eX]

[DOI]

Christiane Frougny

Jean-Michel Muller

Theor. Comput. Sci., 1999

1998

A New Euclidean Division Algorithm for Residue Number Systems.

[BibT_eX]

[DOI]

Jean-Michel Muller

J. VLSI Signal Process., 1998

An RNS Montgomery Modular Multiplication Algorithm.

[BibT_eX]

[DOI]

Peter Kornerup

IEEE Trans. Computers, 1998

1997

An IWS Montgomery Modular Multiplication Algorithm.

[BibT_eX]

[DOI]

Peter Kornerup

Proceedings of the 13th Symposium on Computer Arithmetic (ARITH-13 '97), 1997

1996

Forword to the Special Issue on Real Numbers and Computers.

[BibT_eX]

Theor. Comput. Sci., 1996

1995

Introduction to the Special Issue: "Real Numbers and Computers".

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1995

1994

BKM: A New Hardware Algorithm for Complex Elementary Functions.

[BibT_eX]

[DOI]