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

Su-Jeong Choi; Simon R.  Blackburn; Peter R.  Wild

Paper 2006/357 Original: eprint.iacr.org/2006/357 ↗

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

Su-Jeong Choi

Simon R. Blackburn

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: Preprint.
History: 2006-10-23: last updated; 2006-10-23: published
Short URL: https://ia.cr/2006/357
License: https://creativecommons.org/licenses/by/4.0/

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},
      url = {https://eprint.iacr.org/2006/357}
}