CryptoDB
Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2006-21848, title={Cryptanalysis of a homomorphic public-key cryptosystem over a finite group}, booktitle={IACR Eprint archive}, keywords={public-key cryptography /}, url={http://eprint.iacr.org/2006/357}, note={ s.blackburn@rhul.ac.uk 13444 received 20 Oct 2006, last revised 23 Oct 2006}, author={Su-Jeong Choi and Simon R. Blackburn and Peter R. Wild}, year=2006 }