A Proposal of a New Public Key Cryptosystem Using Matrices over a Ring

2000 ◽  
pp. 41-48 ◽  
Author(s):  
Heajoung Yoo ◽  
Seokhie Hong ◽  
Sangjin Lee ◽  
Jongin Lim ◽  
Okyeon Yi ◽  
...  
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem ◽  
New Public

Research on a New Public Key Cryptosystem as Secure as Integer Factorization

2011 ◽  
Vol 30 (6) ◽  
pp. 1450-1452 ◽  
Author(s):  
Zheng-tao Jiang ◽  
Jing-liang Zhang ◽  
Yu-min Wang
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem ◽  
Integer Factorization ◽  
New Public

scholarly journals Undirected Complete Graph to Design New Public Key Cryptosystem

2021 ◽  
Vol 1897 (1) ◽  
pp. 012045
Author(s):  
Karrar Taher R. Aljamaly ◽  
Ruma Kareem K. Ajeena
Keyword(s):  
Complete Graph ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
New Public

New public-key cryptosystem

1990 ◽  
Vol 21 (1) ◽  
pp. 205-215
Author(s):  
SAAD M. KALlPHA ◽  
JAFAR WADI ABDUL SADA ◽  
HUSSAIN ALI HUSSAIN
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem ◽  
New Public

scholarly journals A new public key cryptosystem based on Edwards curves

2019 ◽  
Vol 61 (1-2) ◽  
pp. 431-450
Author(s):  
Maher Boudabra ◽  
Abderrahmane Nitaj
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem ◽  
Edwards Curves ◽  
New Public

scholarly journals New public-key cryptosystem based on the morphism of polynomials problem

2016 ◽  
Vol 21 (3) ◽  
pp. 302-311 ◽  
Author(s):  
Houzhen Wang ◽  
Huanguo Zhang ◽  
Shaowu Mao ◽  
Wanqing Wu ◽  
Liqiang Zhang
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem ◽  
New Public

scholarly journals New Public-Key Cryptosystem Using Braid Groups

2000 ◽  
pp. 166-183 ◽  
Author(s):  
Ki Hyoung Ko ◽  
Sang Jin Lee ◽  
Jung Hee Cheon ◽  
Jae Woo Han ◽  
Ju-sung Kang ◽  
...  
Keyword(s):  
Braid Groups ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
New Public

A new public key cryptosystem over ℤn2*

2017 ◽  
Vol 09 (06) ◽  
pp. 1750080
Author(s):  
Pinkimani Goswami ◽  
Madan Mohan Singh ◽  
Bubu Bhuyan
Keyword(s):  
Multiplicative Group ◽  
Discrete Logarithm ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Quadratic Residues ◽  
Diffie Hellman ◽  
New Public ◽  
Intractable Problems ◽  
The One ◽  
Safe Primes

At Eurocrypt ’99, Paillier showed a cryptographic application of the group [Formula: see text], the multiplicative group modulo [Formula: see text] where [Formula: see text] is some RSA modulus. In this paper, we have present a new public key cryptosystem over [Formula: see text] where [Formula: see text] is a product of two safe primes, which is based on two intractable problems namely, integer factorization and partial discrete logarithm problem over [Formula: see text], the group of quadratic residues modulo [Formula: see text]. This scheme is a combination of BCP (Bresson–Catalano–Pointcheval) cryptosystem, proposed by Bresson et al. at Asiacrypt ’03 and the Rabin–Paillier scheme proposed by Galindo et al. at PKC 2003. We will show that the one-wayness of this new scheme equally depends on the Computational Diffie–Hellman assumption and factoring assumption. We will also prove that the proposed scheme is more secure than the BCP cryptosystem and the Rabin–Paillier cryptosystem.

Sign in / Sign up

Export Citation Format

Share Document