all InfoSec news
Shannon Perfect Secrecy in a Discrete Hilbert Space. (arXiv:2302.07671v1 [quant-ph])
cs.CR updates on arXiv.org arxiv.org
The One-time-pad (OTP) was mathematically proven to be perfectly secure by
Shannon in 1949. We propose to extend the classical OTP from an n-bit finite
field to the entire symmetric group over the finite field. Within this context
the symmetric group can be represented by a discrete Hilbert sphere (DHS) over
an n-bit computational basis. Unlike the continuous Hilbert space defined over
a complex field in quantum computing, a DHS is defined over the finite field
GF(2). Within this DHS, …
computational computing context continuous defined dhs otp perfect quantum quantum computing secrecy space sphere symmetric