A one-way function from thermodynamics and applications to cryptography
type: Item
instance of: scholarly article
title: A one-way function from thermodynamics and applications to cryptography
zbMATH Open document ID: 1068.94015
author: Norbert Hungerbühler
author: Michael Struwe
published in: Elemente der Mathematik
publication date: 2004-09-22T00:00:00Z
review text: The authors propose a new construction for a one-way function. The function is based on the second principle of thermodynamics and on the heat flow equation. The function might be used as a cryptographically strong primitive, and as the authors have suggested it might be applied in various ways; for example, to construct key exchange or password verification algorithms. Moreover, the function can be implemented on quantum computers. So when the first quantum computer is built and all classical cryptosystems based on computationally hard problems (like factorization, see RSA) are broken, the proposed function still can be used. The idea of cryptosystems based on the differential (heat) equation is very original and uncommon. It is a little similar to the idea of applying chaos theory to the construction of ciphers, which has appeared recently, but only for symmetric cases. Both of the above ideas are based on continuous functions and have the same problem in implementation on contemporary ``discrete'' computers. The authors point out the difficulties of the practical implementation related to this discretization problem. But it looks like these problem can be easily overcome. The idea of constructing cryptographic primitives based on thermodynamics looks quite promising. But we have to look at both sides of usefulness in cryptosystems: security and efficiency. So there is still the question about the performance of primitives constructed in this manner. All aspects of the performance need to be considered, like speed and size of implementation, secure sizes of the keys, etc. To replace currently used public key cryptosystems (like RSA or Diffie-Hellman), we need both more secure and faster algorithms. Whether these will rely on primitives based on thermodynamics remains an open problem. Much more analysis and investigation in this matter are required.
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 80A05
Mathematics Subject Classification ID: 80A20
zbMATH DE Number: 2102320
zbMATH Keywords: cryptography
zbMATH Keywords: thermodynamics
zbMATH Keywords: one-way function
reviewed by: Jerzy August Gawinecki
MaRDI profile type: Publication
full work available at URL: s000170300008
OpenAlex ID: W1999980189
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Q3996272
cites work: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
cites work: Quantum cryptography using any two nonorthogonal states
cites work: Modern processing of cryptography. From RSA to Zero-knowledge
cites work: Q3995106
cites work: Rapid solution of problems by quantum computation
cites work: New directions in cryptography
cites work: Quantum cryptography based on Bell’s theorem
cites work: Q3792737
cites work: Algebraic aspects of cryptography. With an appendix on hyperelliptic curves by Alfred J. Menezes, Yi-Hong Wu, and Robert J. Zuccherato
cites work: Q4718481
cites work: Prime numbers and computer methods for factorization
cites work: Q4839149
cites work: Q4040312
cites work: Q3994378
DOI: 10.1007/S000170300008
description: scientific article; zbMATH DE number 2102320