Work

Computational indistinguishability and boson sampling*

Year: 2022

Type: article

Abstract: 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.

Source: Physica Scripta

DOI: 10.1088/1402-4896/aca1ed

Author: Georgios M Nikolopoulos

Institutions: FORTH Institute of Electronic Structure and Laser, Foundation for Research and Technology Hellas

Language: English

Topic: Quantum Information and Cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,115

OpenAlex ID: W4308697803

FWCI:

Cites: 38

Cited by:

Related to: 10