{"ID":2860236,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.04085","arxiv_id":"2510.04085","title":"Gluing Random Unitaries with Inverses and Applications to Strong Pseudorandom Unitaries","abstract":"Gluing theorem for random unitaries [Schuster, Haferkamp, Huang, QIP 2025] have found numerous applications, including designing low depth random unitaries [Schuster, Haferkamp, Huang, QIP 2025], random unitaries in ${\\sf QAC0}$ [Foxman, Parham, Vasconcelos, Yuen'25] and generically shortening the key length of pseudorandom unitaries [Ananth, Bostanci, Gulati, Lin EUROCRYPT'25]. We present an alternate method of combining Haar random unitaries from the gluing lemma from [Schuster, Haferkamp, Huang, QIP 2025] that is secure against adversaries with inverse query access to the joined unitary. As a consequence, we show for the first time that strong pseudorandom unitaries can generically have their length extended, and can be constructed using only $O(n^{1/c})$ bits of randomness, for any constant $c$, if any family of strong pseudorandom unitaries exists.","short_abstract":"Gluing theorem for random unitaries [Schuster, Haferkamp, Huang, QIP 2025] have found numerous applications, including designing low depth random unitaries [Schuster, Haferkamp, Huang, QIP 2025], random unitaries in ${\\sf QAC0}$ [Foxman, Parham, Vasconcelos, Yuen'25] and generically shortening the key length of pseudor...","url_abs":"https://arxiv.org/abs/2510.04085","url_pdf":"https://arxiv.org/pdf/2510.04085v1","authors":"[\"Prabhanjan Ananth\",\"John Bostanci\",\"Aditya Gulati\",\"Yao-Ting Lin\"]","published":"2025-10-05T08:11:33Z","proceeding":"cs.CR","tasks":"[\"cs.CR\",\"quant-ph\"]","methods":"[]","has_code":false}