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

~ similar to 2604.13289v1· 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.CRRecentApr 17, 2026

Stringology Based Cryptology

Victor Kebande

This paper proposes Stringology-Based Cryptology (SBC), a novel approach that analyzes the structural properties of cryptographic outputs by treating them as symbolic sequences, offering complementary…

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

Public-Decay Homomorphic State Space Models for Private Sequence Inference

Luis Brito

The paper introduces public-decay Homomorphic State Space Models (HSSMs) that enable efficient, high-accuracy sequence inference directly on encrypted data, significantly outperforming existing encryp…

View →
cs.CRRecentApr 30, 2026

SBN Explorer: An Empirical Study of Cryptographic Boolean Networks

Arnaud Valence

The paper systematically explores a vast design space of cryptographic Boolean networks by formalizing six structural constraints, finding that optimal designs result from sparse, mutually compatible…

View →
cs.CRcs.AIcs.LGRecentMay 8, 2026

Seed Hijacking of LLM Sampling and Quantum Random Number Defense

Ziyang You, Xiaoke Yang, Zhanling Fan, Feng Guo +2 more

The paper introduces SeedHijack, a backdoor attack that manipulates the pseudorandom number generation process in LLMs to force specific token selections, and proposes a hardware quantum random number…

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 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.CRRecentMar 19, 2026

Impact of Differentials in SIMON32 Algorithm for Lightweight Security of Internet of Things

Jonathan Cook, Sabih ur Rehman, M. Arif Khan

The paper analyzes the differential properties of the SIMON32 cipher, identifying high-probability differentials to improve the efficiency and depth of cryptanalysis beyond current state-of-the-art me…

View →
quant-phcs.CRRecentMay 29, 2026

Software Platform for Hybrid Pseudo-Random Sequence Generation and Predictability Analysis Based on LFSR and Mersenne Twister

Ali Abdolrahimi Zarnagh, Ali Motazedifard

The paper introduces a software platform for generating and analyzing pseudo-random sequences (like LFSR and Mersenne Twister), demonstrating that while these classical generators are efficient, quant…

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.CRcs.SERecentApr 29, 2026

An Empirical Security Evaluation of LLM-Generated Cryptographic Rust Code

Mohamed Elsayed, Kenneth Fulton, Jeong Yang

This study empirically evaluates the cryptographic security of LLM-generated Rust code, finding that while general analysis tools are insufficient, a custom crypto-specific analyzer successfully ident…

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 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 →
cs.CRcs.AIRecentMay 29, 2026

A Protocol-Language Model for Network Intrusion (Without Deep Packet Inspection)

Vivek Kumar Sharma

The paper introduces PLM-NIDS, a novel intrusion detection system that models network flows as a language based solely on L3/L4 metadata, successfully detecting attacks by identifying deviations from…

View →
cs.CRcs.AIRecentMay 29, 2026

A Protocol-Language Model for Network Intrusion (Without Deep Packet Inspection)

Vivek Kumar Sharma

The paper introduces PLM-NIDS, a novel intrusion detection system that models network flows as a language based solely on L3/L4 metadata, successfully detecting attacks by identifying deviations from…

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.CRcs.CLRecentApr 28, 2026

The Surprising Universality of LLM Outputs: A Real-Time Verification Primitive

Alex Bogdan, Adrian de Valois-Franklin

The paper identifies a universal, statistically predictable distribution (Mandelbrot) governing LLM outputs, enabling a highly efficient, model-agnostic scoring primitive for provenance and quality as…

View →
cs.CRcs.AIcs.LGRecentMay 22, 2026

Adversarial Vulnerability Under Temporal Concept Drift: A Longitudinal Study of Android Malware Detection

Ahmed Sabbah, Mohammed Kharma, Radi Jarrar, Samer Zein +1 more

This study longitudinally evaluates the adversarial robustness of Android malware detection systems over a decade, finding that temporal separation significantly degrades robustness due to concept dri…

View →