# Cryptographic One-way Function Based on Boson Sampling

## TL;DR

This paper introduces a new one-way function based on boson sampling, aiming to enhance cryptographic security against quantum attacks and exploring its potential for practical cryptographic applications.

## Contribution

It proposes a novel cryptographic one-way function utilizing coarse-grained boson sampling, bridging quantum sampling techniques with cryptographic primitives.

## Key findings

- The function's evaluation is feasible with classical and quantum computers.
- Boson sampling's complexity may provide a foundation for quantum-resistant cryptography.
- The work suggests boson sampling could extend beyond quantum supremacy to cryptographic use cases.

## Abstract

The quest for practical cryptographic primitives that are robust against quantum computers is of vital importance for the field of cryptography. Among the abundance of different cryptographic primitives one may consider, one-way functions stand out as fundamental building blocks of more complex cryptographic protocols, and they play a central role in modern asymmetric cryptography. We propose a mathematical one-way function, which relies on coarse-grained boson sampling. The evaluation and the inversion of the function are discussed in the context of classical and quantum computers. The present results suggest that the scope and power of boson sampling may go beyond the proof of quantum supremacy, and pave the way towards cryptographic applications.