arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2211.04420quant-phcs.CCcs.CRcs.ITmath.IT
收藏

计算不可测性与玻色子采样

Computational indistinguishability and boson sampling

Georgios M. Nikolopoulos

摘要:

我们引入了一个计算问题,区分一个理想的粗粒度玻色子采样器的输出和一个真正的随机数生成器的输出,作为加密方案的资源,这是安全的计算上无界的对手。此外,我们定义了一个密码设置的实现,这样的计划,包括消息加密和身份验证,以及实体认证。

英文摘要:

We introduce a computational problem of distinguishing between the output of an ideal coarse-grained boson sampler and the output of a true random number generator, as a resource for cryptographic schemes, which are secure against computationally unbounded adversaries. Moreover, we define a cryptographic setting for the implementation of such schemes, including message encryption and authentication, as well as entity authentication.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑