The entropy of keys derived from laser speckle
B. Skoric

TL;DR
This paper analyzes the entropy and reproducibility of laser speckle-based keys, introducing a statistical model to evaluate error rates and secure bit extraction limits in cryptographic applications.
Contribution
It provides a detailed statistical analysis of Gabor-filtered speckle patterns and models perturbations as random phase changes, offering insights into secure key extraction limits.
Findings
Computed second and fourth order statistics of Gabor coefficients.
Determined mutual information bounds for secure bit extraction.
Analyzed error rates in speckle-based cryptographic keys.
Abstract
Laser speckle has been proposed in a number of papers as a high-entropy source of unpredictable bits for use in security applications. Bit strings derived from speckle can be used for a variety of security purposes such as identification, authentication, anti-counterfeiting, secure key storage, random number generation and tamper protection. The choice of laser speckle as a source of random keys is quite natural, given the chaotic properties of speckle. However, this same chaotic behaviour also causes reproducibility problems. Cryptographic protocols require either zero noise or very low noise in their inputs; hence the issue of error rates is critical to applications of laser speckle in cryptography. Most of the literature uses an error reduction method based on Gabor filtering. Though the method is successful, it has not been thoroughly analysed. In this paper we present a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Media Forensic Detection · Chaos-based Image/Signal Encryption · Biometric Identification and Security
