Papers related to the 2026 IEEE International Symposium on Circuits and Systems
Published:
We recently presented two contributions at the 2026 IEEE International Symposium on Circuits and Systems (ISCAS) in Shangai. These contributions are a natural continuation of our works about time-space trade-offs in quantum cryptosystems (I’ve talked about this research topic in a couple of blog posts, se e.g. here). In this case we focused on two complementary aspects of the quantum version of the “Hellman construction” proposed last year at the same conference in London (cf., this post and this paper)
- A paper about a unified framework for cryptographyc search based on quantum walks and grover’s algorithm
- A paper about the impossibility of heaving multiplicative resource scaling in cryptographic search under the previous unified model.
More materials (including the code) are available here and here
