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

~ similar to 2603.18455v1· 20 results

cs.CRRecentApr 10, 2026

Stringology-Based Cryptanalysis for EChaCha20 Stream Cipher

Victor Kebande

The paper applies Stringology-Based Cryptanalysis (SBC) using KMP and Boyer-Moore algorithms to analyze EChaCha20, confirming that the cipher maintains strong pseudorandomness and exhibits rapid diffu…

View →
cs.CRRecentMay 16, 2026

Simple Power Analysis on Post-Quantum Code Based Cryptosystems

Konstantinos Spalas

This paper demonstrates that Simple Power Analysis (SPA) can successfully extract secret session key bits from post-quantum cryptosystems, specifically during the key decapsulation phase, using only a…

View →
cs.CRRecentMay 26, 2026

Analyzing Linear Layers in Related-Differential Cryptanalysis

Yogesh Kumar, Akshay Ankush Yadav, Susanta Samanta

The paper systematically investigates the conditions under which linear layers in AES-like ciphers avoid related-differential structures, proving that the MDS property is necessary and identifying spe…

View →
cs.CRRecentMar 20, 2026

From Precise to Random: A Systematic Differential Fault Analysis of the Lightweight Block Cipher Lilliput

Peipei Xie, Siwei Chen, Zejun Xiang, Shasha Zhang +1 more

This paper systematically performs a differential fault analysis (DFA) on the lightweight block cipher Lilliput, demonstrating that it is significantly vulnerable to practical fault attacks even under…

View →
cs.CRRecentMay 6, 2026

A Pragmatic Comparison of Cryptographic Computation Technologies for Machine Learning

Marcus Taubert, Adam Skuta, Thomas Loruenser

This paper provides a comparative analysis and benchmarking of Secure Multi-Party Computation (SMPC) and Fully Homomorphic Encryption (FHE) for machine learning, finding that the optimal choice depend…

View →
cs.CRcs.ITRecentMar 24, 2026

Canonical Byte-String Encoding for Finite-Ring Cryptosystems

Kyrylo Riabov, Serhii Kryvyi

The paper introduces the base-m length codec, a canonical and robust encoding scheme that maps byte strings to lists of residues modulo m, essential for finite-ring cryptosystems.

View →
cs.CRRecentMay 5, 2026

Quantum-Resistant Networks: A Review of Primitives, Protocols and Best Practices

Elisa Bertino, Ramana Kompella, Ashish Kundu, Cristina Nita-Rotaru +2 more

This paper provides a comprehensive, system-level taxonomy for designing quantum-resistant network architectures, moving beyond simple protocol substitutions to address key distribution and management…

View →
cs.CRRecentApr 14, 2026

Neural Stringology Based Cryptanalysis of EChaCha20

Victor Kebande

The paper introduces a Neural Stringology Cryptanalysis (NSC) framework that uses machine learning to detect subtle structural patterns in stream cipher keystreams, demonstrating its potential for eva…

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.CRcs.LGRecentMay 10, 2026

Privacy-Preserving Distributed Learning in IoT Systems: A Unified Threat Model and Evaluation Framework

John Cartmell, Alexander Williams

This paper introduces a unified threat model and evaluation framework to systematically compare privacy-preserving techniques for distributed learning in IoT systems, highlighting the trade-off betwee…

View →
cs.CRcs.DCRecentApr 27, 2026

Network Impact of Post-Quantum Certificate Chain sizes on Time to First Byte in TLS Deployments

Matthew Chou, Phuong Cao

This paper quantifies the latency impact of increasing certificate chain sizes required by Post-Quantum Cryptography (PQC) on TLS Time to First Byte (TTFB), finding that Merkle Tree Certificates (MTC)…

View →
cs.CRcs.LGRecentMar 31, 2026

Deep Learning-Assisted Improved Differential Fault Attacks on Lightweight Stream Ciphers

Kok Ping Lim, Dongyang Jia, Iftekhar Salam

This paper demonstrates the successful application of deep learning-assisted differential fault attacks to three lightweight stream ciphers, achieving high fault location identification accuracies and…

View →
cs.CRRecentMar 19, 2026

Performance Testing of ChaCha20-Poly1305 for Internet of Things and Industrial Control System Devices

Kristján Orri Ragnarsson, Jacky Mallett

This paper evaluates the performance overhead of implementing ChaCha20-Poly1305 encryption on low-cost edge devices, demonstrating that the added latency remains well within the strict requirements of…

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 18, 2026

Structural Analysis of Cryptographic Sequences using Stringology-Based Fingerprinting

Victor Kebande

The paper introduces a stringology-based fingerprinting (SBF) framework to structurally analyze cryptographic sequences, demonstrating that pattern analysis can reveal measurable structural signatures…

View →
cs.CRquant-phRecentMay 16, 2026

quantum-safe: Bridging the Post-Quantum Production Gap with a Hybrid-by-Default Python Cryptography Library

Animesh Shaw

The paper introduces 'quantum-safe,' a Python library that addresses the remaining 'production gap' in post-quantum cryptography (PQC) by providing robust, easy-to-use hybrid implementations and compr…

View →
cs.CRRecentMar 30, 2026

Cryptanalysis of a Lightweight RFID Authentication Protocol Based on a Variable Matrix Encryption Algorithm

Hongjun Wu

This paper demonstrates that a proposed lightweight RFID authentication protocol is structurally insecure and susceptible to a multi-session algebraic attack, enabling full compromise of the secret ke…

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.CRcs.LGRecentApr 14, 2026

Evaluating Differential Privacy Against Membership Inference in Federated Learning: Insights from the NIST Genomics Red Team Challenge

Gustavo de Carvalho Bertoli

This paper empirically evaluates the effectiveness of Differential Privacy (DP) against Membership Inference Attacks (MIAs) in Federated Learning, demonstrating that a stacking attack strategy can det…

View →
cs.CRRecentJun 1, 2026

I-(OT)^2: A Client-optimal Oblivious Transfer Protocol for IoT Devices

Elia Onofri, Andrea Ciccotelli, Roberto Di Pietro

The paper introduces $I$-$(OT)^2$, a novel base 1-out-of-2 Oblivious Transfer (OT) protocol designed to minimize computation and interaction for resource-constrained IoT devices.

View →