Polynomial multiplication algorithms such as Toom-Cook and the Number Theoretic Transform are fundamental building blocks for lattice-based post-quantum cryptography. In this work we present correlation power-analysis-based side-channel analysis methodologies targeting every polynomial strategy all key encapsulation mechanisms in final round of NIST standardization procedure. We perform practical experiments on real measurements, demonstrating that our method allows to extract secret from...

Since the introduction of ring-learning with errors problem, number theoretic transform (NTT) based polynomial multiplication algorithm has been studied extensively. Due to its faster quasilinear time complexity, it preferred choice cryptographers realize cryptographic schemes. Compared NTT, Toom-Cook or Karatsuba algorithms, though being known for a long time, still have fledgling presence in context post-quantum cryptography.In this work, we observe that pre- and post-processing steps...

The NTRU cryptosystem is one of the main alternatives for practical implementations post-quantum, public-key cryptography. In this work, we analyze feasibility employing encryption scheme, NTRUEncrypt, in resource constrained devices such as those used Internet-of-Things endpoints. We present an analysis NTRUEncrypt's advantages over other cryptosystems use devices. describe four different NTRUEncrypt on ARM Cortex M0-based microcontroller, compare their results, and show that suitable...

The CCA-secure lattice-based post-quantum key encapsulation scheme Saber is a candidate in the NIST’s cryptography standardization process. In this paper, we study implementation aspects of resourceconstrained microcontrollers from ARM Cortex-M series which are very popular for realizing IoT applications. work, carefully optimize various parts speed and memory. We exploit digital signal processing instructions efficient memory access fast polynomial multiplication. also use Karatsuba...

We present a domain-specific co-processor to speed up Saber, post-quantum key encapsulation mechanism competing on the NIST Post-Quantum Cryptography standardization process. Contrary most lattice-based schemes, Saber doesn't use NTT-based polynomial multiplication. follow hardware-software co-design approach: execution is performed an ARM core and only computationally expensive operation, i.e., multiplication, offloaded obtain compact design. exploit idea of distributed computing at...

This paper describes two state-of-the-art and portable voice-based authentication language recognition systems. While the system allows secure access to a media center at home, can be used as previous step automatically transcribe translate recognized text from its original into another one. The most important advantage of developed systems is that they run on low cost embedded device, such Raspberry Pi (RPi), using only open-source projects, which makes it feasible replicate or include in...

Modern NVIDIA GPU architectures offer dot-product instructions (DP2A and DP4A), with the aim of accelerating machine learning scientific computing applications. These allow computation multiply-and-add in a single clock cycle, effectively achieving higher throughput compared to conventional 32-bit integer units. In this paper, we show that instruction can also be used accelerate matrix-multiplication polynomial convolution operations, which are widely post-quantum lattice-based cryptographic...

Cyber physical systems (CPSs) will be deployed for decades, thus they should secure against long-term attacks. Most CPSs adopt the datagram transport layer security (DTLS), as de facto protocol. By using public key cryptography (PKC) based on traditional RSA or elliptic-curves, DTLS establishes secured communication channels between multiple parties. However, foreseeable breakthrough of quantum computers represents a risk many PKC ecosystems. Traditional no longer considered secure....

In this paper, we introduce Scabbard, a suite of post-quantum keyencapsulation mechanisms. Our contains three different schemes Florete, Espada, and Sable based on the hardness module- or ring-learning with rounding problem. work, first show how latest advancements lattice-based cryptographycan be utilized to create new better even improve state-of-the-art cryptography. We put particular focus designing that can optimally exploit parallelism offered by certain hardware platforms are also...

The arrival of large-scale quantum computers will break the security assurances our current public-key cryptography. National Institute Standard & Technology (NIST) is currently running a multi-year-long standardization procedure to select quantum-safe or postquantum cryptographic schemes be used in future. Energy efficiency an important criterion selection process. This paper presents first Silicon verified ASIC implementation for Saber (LWR algorithm as proposed [1], [2]), NIST PQC Round 3...

Lattice-based cryptography is a novel approach to public key (PKC), of which the mathematical investigation (so far) resists attacks from quantum computers. By choosing module learning with errors (MLWE) algorithm as next standard, National Institute Standards and Technology (NIST) follows this approach. The multiplication polynomials central bottleneck in computation lattice-based cryptography. Because PKC mostly used establish common secret keys, focus on compact area, power, energy budget...

The CCA-secure lattice-based post-quantum key encapsulation scheme Saber is a candidate in the NIST’s cryptography standardization process. In this paper, we study implementation aspects of resourceconstrained microcontrollers from ARM Cortex-M series which are very popular for realizing IoT applications. work, carefully optimize various parts speed and memory. We exploit digital signal processing instructions efficient memory access fast polynomial multiplication. also use Karatsuba...

To mitigate cybersecurity breaches, secure communication is crucial for the Internet of Things (IoT) environment. Data integrity one most significant characteristics security, which can be achieved by employing cryptographic hash functions. In view demand from IoT applications, National Institute Standards and Technology (NIST) initiated a standardization process lightweight This work presents field-programmable gate array (FPGA) implementations carefully worked out optimizations four...

Recently, the construction of cryptographic schemes based on hard lattice problems has gained immense popularity. Apart from being quantum resistant, lattice-based cryptography allows a wide range variations in underlying problem. As can work different environments under operational constraints such as memory footprint, silicon area, efficiency, power requirement, etc., problem are very useful for designers to construct schemes. In this work, we explore various design choices and their...

High-degree, low-precision polynomial arithmetic is a fundamental computational primitive underlying structured lattice based cryptography. Its algorithmic properties and suitability for implementation on different compute platforms an active area of research, this article contributes to line work: Firstly, we present memory-efficiency performance improvements the Toom-Cook/Karatsuba multiplication strategy. Secondly, provide implementations those Arm® Cortex®-M4 CPU, as well newer...

Recently, the construction of cryptographic schemes based on hard lattice problems has gained immense popularity. Apart from being quantum resistant, lattice-based cryptography allows a wide range variations in underlying problem. As can work different environments under operational constraints such as memory footprint, silicon area, efficiency, power requirement, etc., problem are very useful for designers to construct schemes. In this work, we explore various design choices and their...

Large polynomial multiplications are crucial for Post-Quantum Cryptography standards like Module-Lattice-based Key Encapsulation Mechanism (ML-KEM) and Digital Signature (ML-DSA). These multiplications, being complex, often accelerated using the Number Theoretic Transform (NTT). This work presents a novel architecture of high-performance NTT accelerator capable performing both inverse operations single set hardware resources. The design makes use butterfly configuration unit to reduce...

Privacy preservation is a sensitive and important issue in this ever-growing highly-connected digital era. Functional encryption computation on encrypted data paradigm that allows users to retrieve the evaluation of function without revealing data, effectively protecting user's privacy. However, existing functional implementations are still very time-consuming for practical deployment, especially when applied machine learning applications involve huge amount data. In paper, we present...

The hard mathematical problems that assure the security of our current public-key cryptography (RSA, ECC) are broken if and when a quantum computer appears rendering them ineffective for use in era. Lattice based is novel approach to public key cryptography, which investigation (so far) resists attacks from computers. By choosing module learning with errors (MLWE) algorithm as next standard, National Institute Standard & Technology (NIST) follows this approach. multiplication polynomials...