ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2604.26536v1· 20 results

cs.CRRecentApr 24, 2026

Horizontal SCA Attacks on Binary kP Algorithms using Chevallier-Mames Atomic Blocks

Gerald Isheanesu Matungamire, Alkistis Aikaterini Sigourou, Gerrit Schrock, Zoya Dyka +2 more

This paper demonstrates that standard binary kP algorithms, even when protected using Chevallier-Mames atomic blocks, remain vulnerable to single-trace Side-Channel Analysis (SCA) attacks.

View →
cs.CRcs.ARRecentMar 20, 2026

Case Study: Horizontal Side-Channel Analysis Attack against Elliptic Curve Scalar Multiplication Accelerator under Laser Illumination

Dmytro Petryk, Ievgen Kabin, Peter Langendoerfer, Zoya Dyka

The paper presents a combined Side-Channel Analysis (SCA) and laser illumination attack against an Elliptic Curve Scalar Multiplication accelerator, demonstrating that while laser illumination increas…

View →
quant-phcs.CRRecentMar 30, 2026

Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations

Ryan Babbush, Adam Zalcman, Craig Gidney, Michael Broughton +5 more

The paper estimates the quantum resources required to break 256-bit ECC cryptography and warns that fast-clock quantum computers could enable on-spend attacks on modern cryptocurrencies, necessitating…

View →
cs.CRRecentApr 23, 2026

ECCFROG522PP: An Enhanced 522 bit Weierstrass Elliptic Curve

Victor Duarte Melo

The paper introduces ECCFROG522PP, a 522-bit prime-field elliptic curve designed for high security, emphasizing deterministic generation and public reproducibility over performance.

View →
cs.CRRecentMay 3, 2026

Chain Reactions: How Nonce Collisions in ECDSA Compromise Polygon MEV Searchers

Yash Madhwal, Andrey Seoev, Raffaele Della Pietra, Anastasiia Smirnova +1 more

The paper reveals that predictable nonce reuse by Polygon MEV searchers creates a critical vulnerability in ECDSA signatures, allowing passive attackers to recover private keys using linear algebra.

View →
cs.ARcs.CRRecentJun 2, 2026

ZK-Flex: A Flexible and Scalable Framework for Accelerating Zero-Knowledge Proofs

Adiwena Putra, Cuong Manh Duong, Anh Quang Pham, Joo-Young Kim

The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…

View →
cs.ARcs.CRRecentJun 2, 2026

ZK-Flex: A Flexible and Scalable Framework for Accelerating Zero-Knowledge Proofs

Adiwena Putra, Cuong Manh Duong, Anh Quang Pham, Joo-Young Kim

The paper proposes ZK-Flex, a flexible software-hardware co-designed framework that significantly accelerates Zero-Knowledge Proof (ZKP) generation by efficiently handling diverse polynomial and ellip…

View →
eess.SYcs.CRRecentMar 24, 2026

Secure Two-Party Matrix Multiplication from Lattices and Its Application to Encrypted Control

Kaoru Teranishi

The paper proposes a provably secure, single-round two-party computation protocol for approximate matrix multiplication using lattice-based cryptography, demonstrated for secure control law implementa…

View →
cs.CRRecentJun 4, 2026

GCD: Garbled, Corrected, Demonstrandum -- Fixing and Proving Go's Extended GCD Implementation

Linard Arquint

This paper fixes two subtle bugs in Go's extended GCD implementation, which is critical for RSA key generation, and formally proves the correctness and termination of the corrected code.

View →
cs.CRRecentApr 21, 2026

Efficient Arithmetic-and-Comparison Homomorphic Encryption with Space Switching

Erwin Eko Wahyudi, Yan Solihin, Qian Lou

The paper proposes a novel space switching method to efficiently unify arithmetic and comparison operations within Fully Homomorphic Encryption (FHE) schemes, achieving significant performance improve…

View →
cs.CRRecentApr 16, 2026

Structural Dependency Analysis for Masked NTT Hardware: Scalable Pre-Silicon Verification of Post-Quantum Cryptographic Accelerators

Ray Iskander, Khaled Kirah

The paper introduces a four-stage structural dependency analysis hierarchy that enables scalable, sound first-order masking verification for large, production-level post-quantum cryptographic accelera…

View →
cs.CRRecentJun 1, 2026

The Unicity Execution Layer

Ahto Buldas, Dirk Draheim, Mike Gault, Risto Laanoja +2 more

The paper introduces the Unicity Execution Layer, a secure, modular component that enables trustless off-chain transactions while guaranteeing double-spending prevention and enhancing user privacy.

View →
cs.CRRecentMay 22, 2026

Microbenchmarking Cloud Cryptographic Workloads for Privacy-Preserving Healthcare IoT

Jeremiah L. Webb, Laxima Niure Kandel, Deepti Gupta, Lavanya Elluri

This paper conducts an extensive microbenchmark study to characterize the performance of core cryptographic workloads across various cloud services, architectures, and programming languages, identifyi…

View →
cs.CRcs.ARcs.PFRecentMar 19, 2026

Benchmarking NIST-Standardised ML-KEM and ML-DSA on ARM Cortex-M0+: Performance, Memory, and Energy on the RP2040

Rojin Chhetri

This paper provides the first systematic, isolated benchmarks of NIST-standardized post-quantum cryptography (ML-KEM and ML-DSA) on the highly constrained ARM Cortex-M0+ processor, showing performance…

View →
cs.CRRecentApr 4, 2026

Partial Number Theoretic Transform Masking in Post-Quantum Cryptography (PQC) Hardware: A Security Margin Analysis

Ray Iskander, Khaled Kirah

The paper analyzes the security of a partially masked hardware accelerator for Number Theoretic Transform (NTT) in PQC, demonstrating that the claimed security margins are significantly overestimated…

View →
cs.ARcs.CLcs.CRRecentApr 20, 2026

Enabling AI ASICs for Zero Knowledge Proof

Jianming Tong, Jingtian Dang, Simon Langowski, Tianhao Huang +5 more

The paper introduces MORPH, a framework that reformulates Zero-Knowledge Proof (ZKP) computations to efficiently utilize AI ASICs like TPUs, achieving up to 10x higher throughput on NTT.

View →
cs.ARcs.CRRecentMay 29, 2026

HE^2: A Communication-Light Heterogeneous Architecture for Efficient Fully Homomorphic Encryption

Shangyi Shi, Husheng Han, Zhaoxuan Kan, Yinghao Yang +7 more

The paper proposes $HE^2$, a novel communication-light heterogeneous accelerator architecture that significantly improves the efficiency of Fully Homomorphic Encryption (FHE) by optimizing dataflow an…

View →
cs.ARcs.CRRecentMay 29, 2026

HE^2: A Communication-Light Heterogeneous Architecture for Efficient Fully Homomorphic Encryption

Shangyi Shi, Husheng Han, Zhaoxuan Kan, Yinghao Yang +7 more

The paper proposes $HE^2$, a novel communication-light heterogeneous accelerator architecture that significantly improves the efficiency of Fully Homomorphic Encryption (FHE) by optimizing dataflow an…

View →
cs.DCcs.AIcs.CRRecentMay 21, 2026

Secure and Parallel Determinant Computation for Large-Scale Matrices in Edge Environments

Prajwal Panth

The paper proposes a Secure Parallel Determinant Computation (SPDC) framework that enables efficient, privacy-preserving, and scalable matrix determinant calculation across multiple untrusted edge ser…

View →
cs.CRRecentMay 15, 2026

Beyond Controlled Noise: Achieving Symmetric FHE through Dynamic Position Shifting

Mostefa Kara

The paper proposes a novel symmetric Fully Homomorphic Encryption (FHE) scheme that manages noise growth and computational overhead by fragmenting the plaintext and using a dual-regulator system for m…

View →