Fast Large Integer Modular Addition in GF(p) Using Novel Attribute-Based Representation

Fast Large Integer Modular Addition in GF(p) Using Novel Attribute-Based Representation

Addition is an essential operation in all cryptographic algorithms. Higher levels of security require larger key sizes and this becomes a limiting factor in GF(p) using large integers because of the carry propagation problem. We propose a novel and efficient attribute-based large integer representat...

Full description

Bibliographic Details
Main Authors: Bader Alhazmi, Fayez Gebali
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Prime fields <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">GF</italic>(<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">p</italic>)
large integer arithmetic
modular arithmetic
Kogge-Stone adder
number representation
post-quantum cryptography
Online Access:https://ieeexplore.ieee.org/document/8705212/

Internet

https://ieeexplore.ieee.org/document/8705212/

Similar Items