KFU. Card publication. Computing quantum hashing in the model of quantum branching programs

KAZAN
FEDERAL UNIVERSITY

- RUS
- 中文
- ES

COMPUTING QUANTUM HASHING IN THE MODEL OF QUANTUM BRANCHING PROGRAMS

Form of presentation

Articles in international journals and collections

Year of publication

2018

Язык

английский

Authors, employees of KFU

Ablaev Marat Faridovich, author

Ablaev Farid Mansurovich, author

Vasilev Aleksandr Valerevich, author

Bibliographic description in the original language

Ablayev F, Ablayev M, Vasiliev A., Computing quantum hashing in the model of quantum branching programs//AIP Conference Proceedings. - 2018. - Vol.1936, Is.. - Art. № 020020.

Annotation

AIP Conference Proceedings 1936, 020020 (2018); https://doi.org/10.1063/1.5025458

Keywords

quantum cryptography, quantum hashing

The name of the journal

AIP Conference Proceedings

URL

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85043689774&doi=10.1063%2f1.5025458&partnerID=40&md5=7603e95ca4f127b6ef36520757c3f25f

Please use this ID to quote from or refer to the card

https://repository.kpfu.ru/eng/?p_id=177615&p_lang=2

Full metadata record

Field DC	Value	Language
dc.contributor.author	Ablaev Marat Faridovich	ru_RU
dc.contributor.author	Ablaev Farid Mansurovich	ru_RU
dc.contributor.author	Vasilev Aleksandr Valerevich	ru_RU
dc.date.accessioned	2018-01-01T00:00:00Z	ru_RU
dc.date.available	2018-01-01T00:00:00Z	ru_RU
dc.date.issued	2018	ru_RU
dc.identifier.citation	Ablayev F, Ablayev M, Vasiliev A., Computing quantum hashing in the model of quantum branching programs//AIP Conference Proceedings. - 2018. - Vol.1936, Is.. - Art. № 020020.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/eng/?p_id=177615&p_lang=2	ru_RU
dc.description.abstract	AIP Conference Proceedings	ru_RU
dc.description.abstract	AIP Conference Proceedings 1936, 020020 (2018); https://doi.org/10.1063/1.5025458	ru_RU
dc.description.abstract	We investigate the branching program complexity of quantum hashing. We consider a quantum hash function that maps elements of a finite field into quantum states. We require that this function is preimage-resistant and collision-resistant. We consider two complexity measures for Quantum Branching Programs (QBP): a number of qubits and a number of compu-tational steps. We show that the quantum hash function can be computed efficiently. Moreover, we prove that such QBP construction is optimal. That is, we prove lower bounds that match the constructed quantum hash function computation.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	quantum cryptography	ru_RU
dc.subject	quantum hashing	ru_RU
dc.title	Computing quantum hashing in the model of quantum branching programs	ru_RU
dc.type	Articles in international journals and collections	ru_RU