Cryptographical Properties of Ising Spin Systems

Abstract

The relation between Ising spin systems and public-key cryptography is investigated using methods of statistical physics. The insight gained from the analysis is used for devising a matrix-based cryptosystem whereby the ciphertext comprises products of the original message bits; these are selected by employing two predetermined randomly-constructed sparse matrices. The ciphertext is decrypted using methods of belief-propagation. The analyzed properties of the suggested cryptosystem show robustness against various attacks and competitive performance to modern cyptographical methods.

4 pages, 2 figures

References in corpus (2)

• Typical Performance of Gallager-type Error-Correcting Codes
• Error-Correcting Codes That Nearly Saturate Shannon's Bound

Cited by in corpus (14)

• Exact solutions for diluted spin glasses and optimization problems
• Applications of single-qubit rotations in quantum public-key cryptography
• Analysis of CDMA systems that are characterized by eigenvalue spectrum
• Phase Transitions in Quantum Pattern Recognition
• Random Graph Coloring - a Statistical Physics Approach
• Cavity approach for real variables on diluted graphs and application to synchronization in small-world lattices
• Cryptographic One-way Function Based on Boson Sampling
• Statistical mechanical analysis of sparse linear regression as a variable selection problem
• Quantum key distribution with post-processing driven by physical unclonable functions
• High-Capacity Quantum Associative Memories
• Analysis of common attacks in LDPCC-based public-key cryptosystems
• Analyticity of the energy in an Ising spin glass with correlated disorder
• Rate Distortion Theorem and the Multicritical Point of Spin Glass
• Complex and Non-Complex Phase Structures in Models of Spin Glasses and Information Processing