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

~ similar to 2603.19656v1· 20 results

quant-phcs.CRRecentMay 11, 2026

On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem

Zvika Brakerski, Henry Yuen

The paper establishes a strong connection between scalable pseudorandom unitaries (PRUs) and the unitary synthesis problem, proving that any such PRU construction must require a classical oracle of si…

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 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.DScs.CRmath.NTRecentMay 17, 2026

Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice

Ming-Xing Luo

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

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.DMcs.ITTheoreticalRecentJun 11, 2026

Entropic Generation of Binary Words

Olivier Bodini, Francis Durand

This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.

View →
cs.CRcond-mat.otherq-bio.OTRecentMar 17, 2026

Synchronized DNA sources for unconditionally secure cryptography

Sandra Jaudou, Hélène Gasnier, Elias Boudjella, Marc Canève +10 more

The paper introduces a DNA-based cryptographic primitive that uses shared, sequenced DNA molecules to generate a common binary mask for One-Time Pad (OTP) encryption, achieving unconditional security…

View →
cs.ARcs.MSRecentJun 3, 2026

GoldenFloat: A Phi-Derived Static-Split Floating-Point Family from GF4 to GF256 with a Lucas-Exact Integer Identity

Dmitrii Vasiliev

This paper presents a hardware-oriented description of GoldenFloat, a static-split floating-point family, and its concrete artefacts.

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.ITcs.CRRecentMay 22, 2026

On APN Exponents and the Differential and Boomerang Properties of Binomials in Characteristic 3

Namhun Koo, Soonhak Kwon, Minwoo Ko, Byunguk Kim

This paper systematically analyzes binomial functions over $\mathbb{F}_{p^n}$ in characteristic 3, providing a classification and rigorous proof of specific classes of exponents that yield extremely l…

View →
cs.CRcs.LGRecentMay 13, 2026

DiffusionHijack: Supply-Chain PRNG Backdoor Attack on Diffusion Models and Quantum Random Number Defense

Ziyang You, Liling Zheng, Xiaoke Yang, Xuxing Lu

The paper introduces DiffusionHijack, a supply-chain backdoor attack that compromises the PRNG used by diffusion models to deterministically control generated images, which is successfully mitigated b…

View →
cs.CRmath.NTRecentApr 6, 2026

Cryptanalysis of the Legendre Pseudorandom Function over Extension Fields

Daksh Pandey

This paper provides the first comprehensive cryptanalysis of the Legendre Pseudorandom Function over extension fields, demonstrating key recovery attacks under both passive and active threat models.

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.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.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 →
quant-phcs.CRphysics.opticsRecentApr 1, 2026

Engineering a Phase-Noise-Based Quantum Random Number Generator for Real-Time Secure Applications: Design, Validation, and Scalability

Anurag K. S. V., Shubham Chouhan, K. Srinivasan, G. Raghavan +1 more

The paper presents a high-speed, phase-noise-based Quantum Random Number Generator (QRNG) that achieves a post-processed generation rate of 1.0 Gbps, suitable for real-time secure applications.

View →
cs.CRmath.CORecentApr 13, 2026

How to reconstruct (anonymously) a secret cellular automaton

Luca Mariot, Federico Mazzone, Luca Manzoni, Alberto Leporati

This paper develops a new threshold secret sharing scheme for cellular automata (CA) that enables anonymous reconstruction of the secret CA rules, improving upon previous characterizations using Mutua…

View →
cs.CRRecentMay 19, 2026

High-Rate Public-Key Pseudorandom Codes for Edit Errors

Shengtang Huang, Xin Li, Songtao Mao, Zhaienhe Zhou

The paper constructs high-rate public-key pseudorandom codes (PRCs) robust against edit errors, providing the first such binary constructions under assumptions that yield Hamming-robust PRCs.

View →
cs.CRRecentMar 30, 2026

Differential Privacy for Symbolic Trajectories via the Permute-and-Flip Mechanism

Alexander Benvenuti, Huaiyuan Rao, Matthew Hale

The paper introduces a novel, efficient mechanism based on permute-and-flip for applying differential privacy to symbolic state trajectories, significantly reducing the computational overhead compared…

View →
cs.CRRecentMay 20, 2026

Graph Structure of Chebyshev Permutation Polynomials over Binary and Ternary Adic Rings

Xiaoxiong Lu, Yuling Dai, Chengqing Li

This paper characterizes the graph structure, including cycle and path lengths, of Chebyshev permutation polynomials over the ring $\mathbb{Z}_{2^{k_1}3^{k_2}}$, demonstrating strong regularities desp…

View →