Journal of Cryptographic Engineering
Publisher: Springer Nature · ISSN 2190-8508,2190-8516 · 25 articles
-
Clone-device-less high-order template attacks on QC-MDPC
Post-Quantum Cryptosystems based on Quasi-Cyclic Moderate Density Parity Check (QC-MDPC) codes (e.g., BIKE) are efficient but vulnerable to side-channel leakage from Hamming weight computations. Our clone-device-less template attack...
-
Implementation and Performance Analysis of Homomorphic Signature Schemes
Homomorphic signatures allow to validate computation on signed data. Alice, holding a dataset $$\{m_1, \ldots , m_t \}$$ { m 1 , … , m t } uses her secret key $$\textsf{sk}$$ sk to sign these data and stores the authenticated dataset on...
-
An explainable semi-supervised self-training approach for hardware Trojan detection using LIME
The rapid proliferation of Internet of Things (IoT) and Artificial Intelligence (AI) applications has escalated the prominence of Hardware Trojans (HTs) as a profoundly menacing threat to Integrated Circuits (ICs). Recent research has...
-
Comments on “Montgomery inversion"
The constant-time Montgomery inversion algorithms proposed by Savaş and Koç are an important contribution to the field of side-channel resistant cryptography. Building upon their innovative work, this paper explores the behavior of...
-
Profiling side channel analysis with deep learning based on boosting algorithm
This paper proposes SCABoosting, a novel boosting framework for deep learning-based Side-Channel Analysis (SCA) that significantly enhances key recovery efficiency while maintaining computational lightweightness. Our method integrates...
-
SHIFT SNARE: uncovering secret keys in FALCON via single-trace analysis
This paper presents a ground-up approach to attack a novel single-trace side-channel vulnerability in FALCON, a lattice-based post-quantum digital signature protocol recently approved for standardization by NIST. We target the discrete...
-
Two-limb CRT Ring-LWE encryption with exact decryption and public re-randomization
Anonymity infrastructures such as mix networks, anonymous storage, and privacy-preserving replication rely on public re-randomization : any party holding only public information can transform a ciphertext into a fresh-looking encryption...
-
Efficient algorithms for
$$\mathbb {G}_2$$
G
2
subgroup membership testing on pairing-friendly curves
Subgroup membership testing serves as a crucial countermeasure against small subgroup attacks, thereby ensuring the security of pairing-based cryptographic protocols. Despite its vital importance, the expensive computational...
-
Design and analysis of efficient homogenous arbiter physical unclonable function using reversible logic
Physical Unclonable Functions (PUFs) are emerging security primitives designed to enhance the security of physical devices and overcome the challenges posed by conventional cryptographic algorithms. PUFs utilize logical operations to...
-
Countermeasures against side-channel attacks in FrodoKEM: an implementation study
FrodoKEM is a lattice-based Public-Key Encryption (PKE)/Key Encapsulation Mechanism (KEM) scheme selected as a third-round candidate in the National Institute of Standards and Technology (NIST) post-quantum cryptography standardization...
-
On timing side channels in “constant-time implementations”
Cryptographic software following sound, modern practices and adhering to recommendations for writing constant-time code (e.g., RFC 7748) may yet leak secret data via the most naïve kind of timing side channels when a “secure”...
-
Multi-microblaze based parallel implementation of elliptic curve digital signature algorithm for blockchain network
Nowadays, blockchain network is one of the most used solutions for the management of data communication in a secure way. In such a network, digital signature and verification are the most important tasks. This paper presents the FPGA...
-
Computing multi-scalar multiplication on memory-constrained devices
Multi-Scalar Multiplication is a critical operation in most pairing-based zero-knowledge proofs. In a lot of studies, memory limitations have often been reported to be the primary bottleneck preventing the calculation of larger MSMs. In...
-
BLCD: a balanced and low-power cell design family for secure applications
Providing a secure hardware infrastructure is a key challenge in implementing secure cryptographic algorithms. Even a robust algorithm with suitable key lengths is not effective against differential power analysis (DPA) attacks and can...
-
Ascending stepped cryptanalytic time-memory trade-off
The concept of time-memory trade-off was introduced in 1980 by Martin Hellman to conduct brute-force attacks against DES. The method consists of an intensive precomputation phase whose results are stored in tables, and subsequently used...
-
SpoofLearner: Inducing Deceptive Results in Deep Learning SCA via Low-Order Leakage
Recent breakthroughs in deep learning-based side-channel analysis (DLSCA) have demonstrated unprecedented cross-device cryptographic profiling capabilities, even against provably secure masking schemes. The evolving DLSCA paradigm is...
-
Faster
$$\text {GF}(2)[x]$$
GF
(
2
)
[
x
]
polynomial multiplication using SIMD instructions
In this work, we propose an optimized method for polynomial multiplication over $$\text {GF}(2)[x]$$ GF ( 2 ) [ x ] , targeting SIMD environments such as AVX2 and Neon . Polynomial multiplication is a core operation in code-based...
-
A fresh look on slow asymmetric crypto: accelerating WolfSSL on end-nodes processors
The rapid growth of the Internet of Things (IoT) emphasizes the need for secure data transmission between IoT devices and edge computing. Many IoT systems utilize asymmetric cryptography , particularly elliptic curve cryptography (ECC),...
-
First Fully Pipelined High Throughput FPGA Implementation and GPU Optimization of Wider Variant of AES
In response to the recent NIST call for a wider variant of the AES algorithm, we developed a fully pipelined, high-throughput FPGA implementation of the 256-bit block size AES, referred to as WAES-256. This design targets both 7th...
-
Cover chirp jamming: hybrid jamming–deception attack on FMCW radar and its countermeasure
The reliability of measurements is crucial for ensuring the safety of control systems that depend on such measurements. Frequency-modulated continuous-wave (FMCW) radar is an active sensor used to measure distance and speed. Security...
-
Netlist whisperer: extensive analysis of circuit leakage using LLMs
The emergence of Large Language Models (LLMs) has ushered in a new era in Artificial Intelligence, showcasing exceptional capabilities in understanding natural language and generating context-specific responses. Pre-trained on extensive...
-
Advancing training stability in unsupervised SEM image segmentation for IC layout extraction
This extended paper presents a novel approach towards unsupervised SEM image segmentation for IC layout extraction. Existing methods typically rely on supervised machine learning with manually labeled training data, requiring...
-
Implementations of FAST and AEZ on field programmable gate arrays for low level encryption of disks with 4096-byte sectors
A fixed length tweakable enciphering scheme (TES) is the appropriate cryptographic functionality for low level disk encryption. Research on TES over the last two decades have led to a number of proposals, some of which have been...
-
New lattice-based partial key exposure attacks on common prime RSA
In this paper, we focus on the common prime RSA variant and introduce a novel investigation into the partial key exposure attack targeting it for the first time. We explore the vulnerability of this RSA variant, which employs two primes...
-
Friendly primes for efficient modular arithmetic using the Polynomial Modular Number System
The Polynomial Modular Number System (PMNS) is a non-positional number system designed for modular arithmetic. Its efficiency, both in software and hardware, has been demonstrated for integers commonly used in Elliptic Curve...