Mitchell A. Thornton

Jessie M. Henderson, Elena R. Henderson, Clayton A. Harper et al. · oxford

Physically unclonable functions (PUFs) identify integrated circuits using nonlinearly-related challenge-response pairs (CRPs). Ideally, the relationship between challenges and corresponding responses is unpredictable, even if a subset of CRPs is known. Previous work developed a photonic PUF offering improved security compared to non-optical counterparts. Here, we investigate this PUF's susceptibility to Multiple-Valued-Logic-based machine learning attacks. We find that approximately 1,000 CRPs are necessary to train models that predict response bits better than random chance. Given the significant challenge of acquiring a vast number of CRPs from a photonic PUF, our results demonstrate photonic PUF resilience against such attacks.

Clayton Harper, Mitchell Thornton, Eric Larson

Automatic modulation classification is a desired feature in many modern software-defined radios. In recent years, a number of convolutional deep learning architectures have been proposed for automatically classifying the modulation used on observed signal bursts. However, a comprehensive analysis of these differing architectures and importance of each design element has not been carried out. Thus it is unclear what tradeoffs the differing designs of these convolutional neural networks might have. In this research, we investigate numerous architectures for automatic modulation classification and perform a comprehensive ablation study to investigate the impacts of varying hyperparameters and design elements on automatic modulation classification performance. We show that a new state of the art in performance can be achieved using a subset of the studied design elements. In particular, we show that a combination of dilated convolutions, statistics pooling, and squeeze-and-excitation units results in the strongest performing classifier. We further investigate this best performer according to various other criteria, including short signal bursts, common misclassifications, and performance across differing modulation categories and modes.

Mitchell A. Thornton

We prove that temporal averaging over multiple observations can be replaced by algebraic group action on a single observation for second-order statistical estimation. A General Replacement Theorem establishes conditions under which a group-averaged estimator from one snapshot achieves equivalent subspace decomposition to multi-snapshot covariance estimation, and an Optimality Theorem proves that the symmetric group is universally optimal (yielding the KL transform). The framework unifies the DFT, DCT, and KLT as special cases of group-matched spectral transforms, with a closed-form double-commutator eigenvalue problem for polynomial-time optimal group selection. Five applications are demonstrated: MUSIC DOA estimation from a single snapshot, massive MIMO channel estimation with 64% throughput gain, single-pulse waveform classification at 90% accuracy, graph signal processing with non-Abelian groups, and a new algebraic analysis of transformer LLMs revealing that RoPE uses the wrong algebraic group for 70-80% of attention heads across five models (22,480 head observations), that the optimal group is content-dependent, and that spectral-concentration-based pruning improves perplexity at the 13B scale. All diagnostics require a single forward pass with no gradients or training.

Andrew Havard, Theodore Manikas, Eric C. Larson et al.

We propose a method to improve steganography by increasing the resilience of stego-media to discovery through steganalysis. Our approach enhances a class of steganographic approaches through the inclusion of a steganographic assistant convolutional neural network (SA-CNN). Previous research showed success in discovering the presence of hidden information within stego-images using trained neural networks as steganalyzers that are applied to stego-images. Our results show that such steganalyzers are less effective when SA-CNN is employed during the generation of a stego-image. We also explore the advantages and disadvantages of representing all the possible outputs of our SA-CNN within a smaller, discrete space, rather than a continuous space. Our SA-CNN enables certain classes of parametric steganographic algorithms to be customized based on characteristics of the cover media in which information is to be embedded. Thus, SA-CNN is adaptive in the sense that it enables the core steganographic algorithm to be especially configured for each particular instance of cover media. Experimental results are provided that employ a recent steganographic technique, S-UNIWARD, both with and without the use of SA-CNN. We then apply both sets of stego-images, those produced with and without SA-CNN, to an exmaple steganalyzer, Yedroudj-Net, and we compare the results. We believe that this approach for the integration of neural networks with hand-crafted algorithms increases the reliability and adaptability of steganographic algorithms.

Mitchell A. Thornton

We extend the algebraic diversity (AD) framework from classical signal processing to quantum measurement theory. The central result -- the Quantum Algebraic Diversity (QAD) Theorem -- establishes that a group-structured positive operator-valued measure (POVM) applied to a single copy of a quantum state produces a group-averaged density matrix estimator that recovers the spectral structure of the true density matrix, analogous to the classical result that a group-averaged outer product recovers covariance eigenstructure from a single observation. We establish a formal Classical-Quantum Duality Map connecting classical covariance estimation to quantum state tomography, and prove an Optimality Inheritance Theorem showing that classical group optimality transfers to quantum settings via the Born map. SIC-POVMs are identified as algebraic diversity with the Heisenberg-Weyl group, and mutually unbiased bases (MUBs) as algebraic diversity with the Clifford group, revealing the hierarchy $\mathrm{HW}(d) \subseteq \mathcal{C}(d) \subseteq S_d$ that mirrors the classical hierarchy $\mathbb{Z}_M \subseteq G_{\min} \subseteq S_M$. The double-commutator eigenvalue theorem provides polynomial-time adaptive POVM selection. A worked qubit example demonstrates that the group-averaged estimator from a single Pauli measurement recovers a full-rank approximation to a mixed qubit state, achieving fidelity 0.91 where standard single-basis tomography produces a rank-1 estimate with fidelity 0.71. Monte Carlo simulations on qudits of dimension $d = 2$ through $d = 13$ (200 random states per dimension) confirm that the Heisenberg-Weyl QAD estimator maintains fidelity above 0.90 across all dimensions from a single measurement outcome, while standard tomography fidelity degrades as $\sim 1/d$, with the improvement ratio scaling linearly with $d$ as predicted by the $O(d)$ copy reduction theorem.