The Role of Non-Positional Arithmetic on Efficient Emerging Cryptographic Algorithms

Number representation systems establish ways in which numbers are mapped to computer architectures, and how operations over the numbers are translated into computer instructions. The efficiency of public-key cryptography is strongly affected by the used number representations, as these systems are c...

Full description

Bibliographic Details
Main Authors: Paulo Martins, Leonel Sousa
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9045953/
id doaj-2301cedb8610424a98175e74422ceba2
record_format Article
spelling doaj-2301cedb8610424a98175e74422ceba22021-03-30T02:39:00ZengIEEEIEEE Access2169-35362020-01-018595335954910.1109/ACCESS.2020.29830209045953The Role of Non-Positional Arithmetic on Efficient Emerging Cryptographic AlgorithmsPaulo Martins0Leonel Sousa1https://orcid.org/0000-0002-8066-221XINESC-ID, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, PortugalINESC-ID, Instituto Superior Técnico, Universidade de Lisboa, Lisbon, PortugalNumber representation systems establish ways in which numbers are mapped to computer architectures, and how operations over the numbers are translated into computer instructions. The efficiency of public-key cryptography is strongly affected by the used number representations, as these systems are constructed from mathematically inspired problems to ensure security, and thus rely on operations over large integers. In this paper, unconventional representations systems, including the Residue Number System (RNS) and stochastic number representations, are systematically reviewed. Homomorphic representations, which allow for parties to operate on data without having access to their plaintext representation, are also considered. The main goal of this survey is to introduce the reader to key aspects of non-traditional number representations that may be exploited for public-key cryptography, without delving too much into the details. Examples of the methods and algorithms herein surveyed include subquadratic modular multiplication for isogeny-based cryptography, the acceleration of Goldreich-Goldwasser-Halevi (GGH) decryption by an order of magnitude, the improvement of the Direct Anonymous Attestation (DAA) protocol both in terms of storage requirements and the time taken to execute it, and efficient algorithm-hiding Fully Homomorphic Encryption (FHE). The implementation of this type of systems in both sequential and parallel platforms is analysed, and their performance is compared with traditional approaches. We hope this work sows the seed of further research on the application of non-positional number arithmetic to other cryptographic use-cases.https://ieeexplore.ieee.org/document/9045953/Homomorphic encryptionLattice-based cryptographymodular arithmeticresidue number system (RNS)stochastic computing
collection DOAJ
language English
format Article
sources DOAJ
author Paulo Martins
Leonel Sousa
spellingShingle Paulo Martins
Leonel Sousa
The Role of Non-Positional Arithmetic on Efficient Emerging Cryptographic Algorithms
IEEE Access
Homomorphic encryption
Lattice-based cryptography
modular arithmetic
residue number system (RNS)
stochastic computing
author_facet Paulo Martins
Leonel Sousa
author_sort Paulo Martins
title The Role of Non-Positional Arithmetic on Efficient Emerging Cryptographic Algorithms
title_short The Role of Non-Positional Arithmetic on Efficient Emerging Cryptographic Algorithms
title_full The Role of Non-Positional Arithmetic on Efficient Emerging Cryptographic Algorithms
title_fullStr The Role of Non-Positional Arithmetic on Efficient Emerging Cryptographic Algorithms
title_full_unstemmed The Role of Non-Positional Arithmetic on Efficient Emerging Cryptographic Algorithms
title_sort role of non-positional arithmetic on efficient emerging cryptographic algorithms
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2020-01-01
description Number representation systems establish ways in which numbers are mapped to computer architectures, and how operations over the numbers are translated into computer instructions. The efficiency of public-key cryptography is strongly affected by the used number representations, as these systems are constructed from mathematically inspired problems to ensure security, and thus rely on operations over large integers. In this paper, unconventional representations systems, including the Residue Number System (RNS) and stochastic number representations, are systematically reviewed. Homomorphic representations, which allow for parties to operate on data without having access to their plaintext representation, are also considered. The main goal of this survey is to introduce the reader to key aspects of non-traditional number representations that may be exploited for public-key cryptography, without delving too much into the details. Examples of the methods and algorithms herein surveyed include subquadratic modular multiplication for isogeny-based cryptography, the acceleration of Goldreich-Goldwasser-Halevi (GGH) decryption by an order of magnitude, the improvement of the Direct Anonymous Attestation (DAA) protocol both in terms of storage requirements and the time taken to execute it, and efficient algorithm-hiding Fully Homomorphic Encryption (FHE). The implementation of this type of systems in both sequential and parallel platforms is analysed, and their performance is compared with traditional approaches. We hope this work sows the seed of further research on the application of non-positional number arithmetic to other cryptographic use-cases.
topic Homomorphic encryption
Lattice-based cryptography
modular arithmetic
residue number system (RNS)
stochastic computing
url https://ieeexplore.ieee.org/document/9045953/
work_keys_str_mv AT paulomartins theroleofnonpositionalarithmeticonefficientemergingcryptographicalgorithms
AT leonelsousa theroleofnonpositionalarithmeticonefficientemergingcryptographicalgorithms
AT paulomartins roleofnonpositionalarithmeticonefficientemergingcryptographicalgorithms
AT leonelsousa roleofnonpositionalarithmeticonefficientemergingcryptographicalgorithms
_version_ 1724184812701351936