-
New Quantum Cryptanalysis of Binary Elliptic Curves (Extended Version)
ePrint Report: New Quantum Cryptanalysis of Binary Elliptic Curves (Extended Version) Kyungbae Jang, Vikas Srivastava, Anubhab Baksi, Santanu Sarkar, Hwajeong Seo This paper improves upon the quantum circuits required for the Shor’s attack on binary elliptic curves. We present two types of quantum point addition, taking both qubit count and circuit depth into consideration. In…
-
Dynamically Available Common Subset
ePrint Report: Dynamically Available Common Subset Yuval Efron, Ertem Nusret Tas Internet-scale consensus protocols used by blockchains are designed to remain operational in the presence of unexpected temporary crash faults (the so-called sleepy model of consensus) — a critical feature for the latency-sensitive financial applications running on these systems. However, their leader-based architecture, where a…
-
A New Method for Solving Discrete Logarithm Based on Index Calculus
ePrint Report: A New Method for Solving Discrete Logarithm Based on Index Calculus Jianjun HU Index Calculus (IC) algorithm is the most effective probabilistic algorithm for solving discrete logarithms over finite fields of prime numbers, and it has been widely applied to cryptosystems based on elliptic curves. Since the IC algorithm was proposed in 1920,…
-
SPY-PMU: Side-Channel Profiling of Your Performance Monitoring Unit to Leak Remote User Activity
ePrint Report: SPY-PMU: Side-Channel Profiling of Your Performance Monitoring Unit to Leak Remote User Activity Md Kawser Bepary, Arunabho Basu, Sajeed Mohammad, Rakibul Hassan, Farimah Farahmandi, Mark Tehranipoor The Performance Monitoring Unit (PMU), a standard feature in all modern computing systems, presents significant security risks by leaking sensitive user activities through microarchitectural event data. This…
-
Wave Hello to Privacy: Efficient Mixed-Mode MPC using Wavelet Transforms
ePrint Report: Wave Hello to Privacy: Efficient Mixed-Mode MPC using Wavelet Transforms José Reis, Mehmet Ugurbil, Sameer Wagh, Ryan Henry, Miguel de Vega This paper introduces new protocols for secure multiparty computation (MPC) leveraging Discrete Wavelet Transforms (DWTs) for computing nonlinear functions over large domains. By employing DWTs, the protocols significantly reduce the overhead typically…
-
Leuvenshtein: Efficient FHE-based Edit Distance Computation with Single Bootstrap per Cell
ePrint Report: Leuvenshtein: Efficient FHE-based Edit Distance Computation with Single Bootstrap per Cell Wouter Legiest, Jan-Pieter D’Anvers, Bojan Spasic, Nam-Luc Tran, Ingrid Verbauwhede This paper presents a novel approach to calculating the Levenshtein (edit) distance within the framework of Fully Homomorphic Encryption (FHE), specifically targeting third-generation schemes like TFHE. Edit distance computations are essential in…
-
DL-SCADS: Deep Learning-Based Post-Silicon Side-Channel Analysis Using Decomposed Signal
ePrint Report: DL-SCADS: Deep Learning-Based Post-Silicon Side-Channel Analysis Using Decomposed Signal Dipayan Saha, Farimah Farahmandi Side-channel analysis (SCA) does not aim at the algorithm’s weaknesses but rather its implementations. The rise of machine learning (ML) and deep learning (DL) is giving adversaries advanced capabilities to perform stealthy attacks. In this paper, we propose DL-SCADS, a…
-
A Combinatorial Approach to IoT Data Security
ePrint Report: A Combinatorial Approach to IoT Data Security Anandarup Roy, Bimal Kumar Roy, Kouichi Sakurai, Suprita Talnikar This article explores the potential of Secret Sharing-Based Internet of Things (SBIoT) as a promising cryptographic element across diverse applications, including secure data storage in commercial cloud systems (Datachest), smart home environments (encompassing sensors, cameras, smart locks,…
-
Efficient CPA Attack on Hardware Implementation of ML-DSA in Post-Quantum Root of Trust
ePrint Report: Efficient CPA Attack on Hardware Implementation of ML-DSA in Post-Quantum Root of Trust Merve Karabulut, Reza Azarderakhsh Side-channel attacks (SCA) pose a significant threat to cryptographic implementations, including those designed to withstand the computational power of quantum computers. This paper introduces the first side-channel attack on an industry-grade post-quantum cryptography implementation, Adam’s Bridge.…
-
A Survey to Zero-Knowledge Interactive Verifiable Computing: Utilizing Randomness in Low-Degree Polynomials
ePrint Report: A Survey to Zero-Knowledge Interactive Verifiable Computing: Utilizing Randomness in Low-Degree Polynomials Angold Wang This survey provides a comprehensive examination of zero-knowledge interactive verifiable computing, emphasizing the utilization of randomnes in low-degree polynomials. We begin by tracing the evolution of general-purpose verifiable computing, starting with the foundational concepts of complexity theory developed in…