Write, autoreview, editor, reviewer
3,129
edits
Pseudo-Secret Random Qubit Generator (PSQRG): Difference between revisions
Pseudo-Secret Random Qubit Generator (PSQRG) (edit)
Revision as of 09:36, 11 October 2018
, 11 October 2018→Notations
(→Figure) |
|||
| Line 12: | Line 12: | ||
Figure | Figure | ||
*Notations | |||
* | **<math>f_k</math>, function for target register | ||
* | **<math>t_k</math>, trapdoor for function <math>f_k</math> | ||
* | **<math>U_{f_k}</math>, Unitary operated on the target register taking first register as control, used to compute output of the function in the target register | ||
*y, measurement outcome of the target register | **y, measurement outcome of the target register | ||
*x, x’, pre-image pair for a given measurement outcome y | **<math>x, x’</math>, pre-image pair for a given measurement outcome y | ||
* | **<math>x_i</math> value of qubit i for pre-image x | ||
* | **<math>x’_i</math> value of qubit i for pre-image x’ | ||
* | **<math>α_i</math>, Client’s measurement angles for qubit i in the control register | ||
* | **<math>b_i</math>, Server’s measurement outcome for qubit i in the control register | ||
* | **<math>\theta</math>, classical description of the hidden input state | ||
==Definitions (informal)== | ==Definitions (informal)== | ||
*''Quantum-Safe'' A protocol/function is quantum-safe (also known as post-quantum secure), if all its properties remain valid when the adversaries are quantum polynomial-time (QPT). | *''Quantum-Safe'' A protocol/function is quantum-safe (also known as post-quantum secure), if all its properties remain valid when the adversaries are quantum polynomial-time (QPT). | ||