Quantum hashing for finite abelian groups
- 作者: Vasiliev A.1
-
隶属关系:
- Institute of Computational Mathematics and Information Technologies
- 期: 卷 37, 编号 6 (2016)
- 页面: 753-757
- 栏目: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/198491
- DOI: https://doi.org/10.1134/S1995080216060184
- ID: 198491
如何引用文章
详细
We propose a generalization of the quantum hashing technique based on the notion of small-bias sets. These sets have proved useful in different areas of computer science, and here their properties give an optimal construction for succinct quantum presentation of elements of any finite abelian group, which can be used in various computational and cryptographic scenarios. We consider two special cases of the proposed quantum hashing which turn out to be the known quantum fingerprinting schemas.
作者简介
A. Vasiliev
Institute of Computational Mathematics and Information Technologies
编辑信件的主要联系方式.
Email: alexander.ksu@gmail.com
俄罗斯联邦, Kremlevskaya ul. 35, Kazan, Tatarstan, 420008