Skip to main content
placeholder image

Babai round-off CVP method in RNS: application to latice based cryptographic protocols

Conference Paper


Abstract


  • Lattice based cryptography is claimed as a serious candidate for post quantum cryptography, it recently became an essential tool of modern cryptography. Nevertheless, if lattice based cryptography has made theoretical progresses, its chances to be adopted in practice are still low due to the cost of the computation. If some approaches like RSA and ECC have been

    strongly optimized - in particular their core arithmetic operations, the modular multiplication and/or the modular exponentiation - lattice based cryptography has not been arithmetically improved. This paper proposes to fill the gap with a new approach using Residue Number Systems, RNS, for one of the core arithmetic operation of lattice based cryptography: namely solving the Closest Vector Problem (CVP).

UOW Authors


  •   Bajard, Jean-Claude (external author)
  •   Eynard, Julien (external author)
  •   Merkiche, Nabil (external author)
  •   Plantard, Thomas

Publication Date


  • 2015

Citation


  • Bajard, J., Eynard, J., Merkiche, N. & Plantard, T. (2015). Babai round-off CVP method in RNS: application to latice based cryptographic protocols. Proceedings of the 14th International Symposium on Integrated Circuits (ISIC) (pp. 440-443). United States: IEEE.

Scopus Eid


  • 2-s2.0-84924310109

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/5192

Start Page


  • 440

End Page


  • 443

Abstract


  • Lattice based cryptography is claimed as a serious candidate for post quantum cryptography, it recently became an essential tool of modern cryptography. Nevertheless, if lattice based cryptography has made theoretical progresses, its chances to be adopted in practice are still low due to the cost of the computation. If some approaches like RSA and ECC have been

    strongly optimized - in particular their core arithmetic operations, the modular multiplication and/or the modular exponentiation - lattice based cryptography has not been arithmetically improved. This paper proposes to fill the gap with a new approach using Residue Number Systems, RNS, for one of the core arithmetic operation of lattice based cryptography: namely solving the Closest Vector Problem (CVP).

UOW Authors


  •   Bajard, Jean-Claude (external author)
  •   Eynard, Julien (external author)
  •   Merkiche, Nabil (external author)
  •   Plantard, Thomas

Publication Date


  • 2015

Citation


  • Bajard, J., Eynard, J., Merkiche, N. & Plantard, T. (2015). Babai round-off CVP method in RNS: application to latice based cryptographic protocols. Proceedings of the 14th International Symposium on Integrated Circuits (ISIC) (pp. 440-443). United States: IEEE.

Scopus Eid


  • 2-s2.0-84924310109

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/5192

Start Page


  • 440

End Page


  • 443