Paper 2004/220

On Oleshchuk's Public Key Cryptosystem

Heiko Stamer and Friedrich Otto

Abstract

This paper revisits a public key cryptosystem which is based on finite Church-Rosser string-rewriting systems. We consider some ideas for cryptanalysis and discuss issues concerning practical usage. It turns out that without changing crucial details of key generation this cryptosystem does not offer acceptable cryptographic security. We also provide the source code of our rudimentary implementation, if someone would like to use it for further cryptanalysis.

Metadata
Available format(s)
PDF PS
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
cryptanalysisstring-rewriting systemsChurch-Rosser propertycompletion attack
Contact author(s)
stamer @ theory informatik uni-kassel de
History
2004-09-01: received
Short URL
https://ia.cr/2004/220
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2004/220,
      author = {Heiko Stamer and Friedrich Otto},
      title = {On Oleshchuk's Public Key Cryptosystem},
      howpublished = {Cryptology ePrint Archive, Paper 2004/220},
      year = {2004},
      note = {\url{https://eprint.iacr.org/2004/220}},
      url = {https://eprint.iacr.org/2004/220}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.