Paper 2006/357

Cryptanalysis of a homomorphic public-key cryptosystem over a finite group

Su-Jeong Choi, Simon R. Blackburn, and Peter R. Wild

Abstract

The paper cryptanalyses a public-key cryptosystem recently proposed by Grigoriev and Ponomarenko, which encrypts an element from a fixed finite group defined in terms of generators and relations to produce a ciphertext from SL(2, Z). The paper presents a heuristic method for recovering the secret key from the public key, and so this cryptosystem should not be used in practice.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
s blackburn @ rhul ac uk
History
2006-10-23: last of 2 revisions
2006-10-23: received
See all versions
Short URL
https://ia.cr/2006/357
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2006/357,
      author = {Su-Jeong Choi and Simon R.  Blackburn and Peter R.  Wild},
      title = {Cryptanalysis of a homomorphic public-key cryptosystem over a finite group},
      howpublished = {Cryptology ePrint Archive, Paper 2006/357},
      year = {2006},
      note = {\url{https://eprint.iacr.org/2006/357}},
      url = {https://eprint.iacr.org/2006/357}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.