The paper analyzes language generation and identification in the limit under bounded memory, showing that memory constraints significantly alter learnability, particularly affecting achievable density…

The paper proposes a novel set of combined cellular automaton (CA)-based pseudo-random number generators (PRNGs) that overcome the weak equidistribution issues of existing CA-based PRNGs, achieving ma…

This paper establishes a complexity hierarchy for shuffle operations used in card-based cryptography, classifying them by implementation difficulty and proving separations between these levels.

XMark introduces a novel multi-bit watermarking technique that reliably embeds binary messages into LLM-generated text while maintaining high text quality and robust performance even with limited toke…

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…

The paper proposes a unified, information-theoretic framework using universal hash functions to solve the bootstrapping of seedless QRNGs and to securely combine PQC and QKD keys against quantum adver…

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.

The paper presents a new worst-case to average-case reduction for the Learning Parity with Noise (LPN) problem, achieving hardness for inverse-polynomial noise rates previously unattainable.

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.

This paper develops provably undetectable and robust watermarking schemes for LLM outputs even when the per-token entropy is only constant, removing previous dependencies on high entropy rates or larg…

The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

The paper establishes that the existence of many-time secure uncloneable encryption (UCE) can be shown to follow from relatively weak assumptions, such as the existence of many-time secure symmetric k…

This paper presents a cryptanalytic attack demonstrating that a specific code-based Private Information Retrieval (PIR) scheme can be broken, allowing the server to efficiently determine the requested…

The paper quantifies the cost of privacy in language identification and generation using differentially private (DP) methods, finding that the cost is surprisingly mild, particularly absent under appr…

The paper proposes a generic, standard model construction for Anamorphic Key Encapsulation Mechanisms (AKEM) that achieves strong IND-CCA security, addressing a major gap in covert communication crypt…

The paper proposes a novel binomial multibit LLM watermarking scheme that encodes every bit of a payload at every token position, achieving superior message accuracy and robustness compared to existin…

This paper completely characterizes cyclic equalizability for two words over any finite alphabet by proving that the words must share the same Parikh vector.

The paper proposes Triumvir, a multi-modal ensemble architecture that significantly improves the classification of small, raw data fragments to distinguish between encrypted and compressed data, outpe…

The paper introduces an LLM-guided evolutionary workflow that successfully discovers and certifies a large number of novel bivariate quantum error-correcting codes, demonstrating the utility of LLMs i…

The paper proposes a novel method using random walks and equitable partitions to derive an inequality for the total variation distance of codes, generalizing existing bounds for finite abelian groups.