Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
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 . The paper presents a heuristic method for recovering the secret key from t...
Main Authors: | Choi Su-Jeong, Blackburn Simon R., Wild Peter R. |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2007-12-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc.2007.017 |
Similar Items
-
Resolution Adaptative Network for Cryptanalysis of Asymmetric Cryptosystems
by: Fan Wang, et al.
Published: (2020-01-01) -
About Cryptanalysis of One Fully Homomorphic Cryptosystem Based on Factorization Problem
by: Alina Viktorovna Trepacheva
Published: (2015-12-01) -
Cryptanalysis of the MST3 public key cryptosystem
by: Blackburn Simon R., et al.
Published: (2009-12-01) -
On the Cryptanalysis of a Latin Cubes-Based Image Cryptosystem
by: Rong Huang, et al.
Published: (2021-02-01) -
The discrete logarithm problem modulo one: cryptanalysing the Ariffin–Abu cryptosystem
by: Blackburn Simon R.
Published: (2010-10-01)