Polynomial Code based Quantum Authentication

Revision as of 02:43, 18 June 2019 by Shraddha (talk | contribs) (Created page with "The [https://arxiv.org/pdf/quant-ph/0205128.pdf example protocol] provides a non-interactive scheme for the sender to encrypt as well as Authentication of Quantum Messages|a...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

The example protocol provides a non-interactive scheme for the sender to encrypt as well as authenticate quantum messages. It was the first protocol designed to achieve the task of authentication for quantum states.

Assumptions

  • The sender and the receiver share a classical key drawn from a probability distribution.

Outline

Notations

Properties

Pseudo Code

Further Information

References

contributed by Shraddha Singh