Algorithmic Self-Assembly of DNA Tiles and its Application to Cryptanalysis
Olivier Pelletier, Andre Weimerskirch
Abstract
The early promises of DNA computing to deliver a massively parallel architecture well-suited to computationally hard problems have so far been largely unkept. Indeed, it is probably fair to say that only toy problems have been addressed experimentally. Recent experimental development on algorithmic self-assembly using DNA tiles seem to offer the most promising path toward a potentially useful application of the DNA computing concept. In this paper, we explore new geometries for algorithmic self-assembly, departing from those previously described in the literature. This enables us to carry out mathematical operations like binary multiplication or cyclic convolution product. We then show how to use the latter operation to implement an attack against the well-known public-key crypto system NTRU.
Create a lesson
Related papers
Inference-Engine Fingerprinting Attacks are Practical: Exploring Model-Driven Environmental Discovery, Exploitation, and Escape
Sarah Radway, Andrew Cheng, Vijay Janapa Reddi et al.
Weather Data Spoofing Attacks on Rain-Adaptive Millimeter-Wave Frequency Selection in V2X Communication Networks
Rasheed Bello, Idreez Yusuf, Justice Adjei Owusu et al.
Empirical Analysis of Randomness Quality in Differential Privacy Mechanisms
Cesare Gerolimetto Fabrello, Valeria Rossi, Alberto Trombetta et al.
Towards TEE-Certified DP: Verifiable Differentially Private Training on Legacy GPUs
Li Ge, Wenjie Qu, Weitao Feng et al.
Fingerprinting Multimodal Large Language Models
Chao Huang, Meng Tong, Kejiang Chen
The More It Says, the More You Pay: A Black-Box Audit of Provider-Side Token Inflation in LLM Services
Leilei Chen, Lan Zhang, Chen Tang et al.