[HTML][HTML] Post-quantum cryptosystems for Internet-of-Things: A survey on lattice-based algorithms
R Asif - IoT, 2021 - mdpi.com
The latest quantum computers have the ability to solve incredibly complex classical
cryptography equations particularly to decode the secret encrypted keys and making the …
cryptography equations particularly to decode the secret encrypted keys and making the …
A review of the present cryptographic arsenal to deal with post-quantum threats
The looming threat of quantum attacks on the digital infrastructure protected by conventional
cryptographic protocol has generated urgency in identifying and deploying …
cryptographic protocol has generated urgency in identifying and deploying …
Unif-NTT: A Unified Hardware Design of Forward and Inverse NTT for PQC Algorithms
Polynomial multiplications based on the number theoretic transform (NTT) are critical in
lattice-based post-quantum cryptography algorithms. Therefore, this paper presents a …
lattice-based post-quantum cryptography algorithms. Therefore, this paper presents a …
Signature based Merkle Hash Multiplication algorithm to secure the communication in IoT devices
Great extent of modernization in intelligent device automation and wireless sensor network
have encouraged the augmentation of IoTs to interconnect millions of actual devices to the …
have encouraged the augmentation of IoTs to interconnect millions of actual devices to the …
A versatile and flexible multiplier generator for large integer polynomials
This work presents a versatile and flexible generator of various large integer polynomial
multipliers to be used in hardware cryptocores. Flexibility is offered by allowing circuit …
multipliers to be used in hardware cryptocores. Flexibility is offered by allowing circuit …
An open-source library of large integer polynomial multipliers
Polynomial multiplication is a bottleneck in most of the public-key cryptography protocols,
including Elliptic-curve cryptography and several of the post-quantum cryptography …
including Elliptic-curve cryptography and several of the post-quantum cryptography …
Area-Efficient Realization of Binary Elliptic Curve Point Multiplication Processor for Cryptographic Applications
This paper proposes a novel hardware design for a compact crypto processor devoted to
elliptic-curve point multiplication over GF (2 233). We focus on minimizing hardware usage …
elliptic-curve point multiplication over GF (2 233). We focus on minimizing hardware usage …
Timing-attack-resistant acceleration of ntru round 3 encryption on resource-constrained embedded systems
The advent of quantum computing with high processing capabilities will enable brute force
attacks in short periods of time, threatening current secure communication channels. To …
attacks in short periods of time, threatening current secure communication channels. To …
Evaluation of hardware and software implementations for NIST finalist and fourth-round post-quantum cryptography KEMs
Quantum computer attacks could easily jeopardize the total security of currently employed
encryption systems. As a result, there is an ongoing collaborative effort to design post …
encryption systems. As a result, there is an ongoing collaborative effort to design post …
A survey of software implementations for the number theoretic transform
This survey summarizes the software implementation knowledge of the Number Theoretic
Transform (NTT)—a major subroutine of lattice-based cryptosystems. The NTT is a special …
Transform (NTT)—a major subroutine of lattice-based cryptosystems. The NTT is a special …