Abstract
AbstractQuantum authentication of classical messages is discussed. We propose a non-interactive hybrid protocol reaching informationtheoretical security, even when an eavesdropper possesses infinite quantum and classical computer power. We show that, under certain conditions, a quantum computer can only distinguish a sequence of pseudo random bits from a truly sequence of random bits with an exponentially small probability. This suggests the use of such generator together with hash functions in order to provide an authentication scheme reaching a desirable level of security.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
