The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.

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…

This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…

The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.

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…

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…

This paper proves several properties about Extended Frege proof systems and circuit equivalence.

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…

This book provides a compact, derivation-oriented mathematical primer that connects major families of generative AI models, showing their underlying structural relationships.

The paper introduces a method to efficiently detect 'essential' constraints in Boolean MinCSPs, significantly reducing the search space for solving these problems and providing a dichotomy theorem for…

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 presents a novel technology that uses zero-knowledge proofs to formally verify a software system's correctness against a public specification without revealing the system's internal details.

The paper provides a constructive, intuitionistically valid proof of Rice's Theorem and the Halting Problem undecidability by reducing the problem to the undecidability of Hilbert's Tenth Problem (MRD…

The paper establishes a unified framework for timed opacity by introducing a universal observation model and defining evolution-based timed opacity, proving its relationship to existing opacity defini…

This paper analyzes memory poisoning attacks targeting multi-agent systems (MAS) powered by LLMs, proposing mitigation strategies across various memory types, especially focusing on secure design prin…

The paper provides a unified algebraic framework to determine the formal language expressivity of recurrent neural language models, resolving conflicts in existing literature by linking expressivity t…

This survey establishes persistent, writable memory as an independent security problem for LLM agents, proposing a comprehensive framework for 'mnemonic sovereignty' to govern the entire memory lifecy…

This paper presents an algorithmic framework for exhaustively generating and tabulating knot and link diagrams on the thickened torus.

This paper synthesizes expert knowledge from a workshop to provide a comprehensive framework and best-practice guidelines for developing high-quality reinforcement learning environments for autonomous…

The paper analyzes the algorithmic complexity of finding collisions in single-layer binary neural networks, establishing that the collision resistance depends critically on the activation function's t…