Results 71 to 80 of about 1,377 (175)
On the security of the KMOV public key cryptosystem [PDF]
, 1997 This paper analyzes the KMOV public key cryptosystem, which is an elliptic curve based analogue to RSA. It was believed that this cryptosystem is more secure against attacks without factoring such as the Hastad-attack in broadcast application. Some new attacks on KMOV are presented in this paper that show the converse.
openaire +1 more source
A random number generator based on NTRU cryptosystem [PDF]
Maejo International Journal of Science and Technology, 2010 A random number generator based on the operation of the NTRU cryptosystem is proposed. By using the proposed generator together with the NTRU cryptosystem, we can save hardware and software components.
He Debiao
doaj
NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks. [PDF]
Sensors (Basel), 2020 Ibrahim A +5 more
europepmc +1 more source
An image encryption scheme based on public key cryptosystem and quantum logistic map. [PDF]
Sci Rep, 2020 Ye G, Jiao K, Huang X, Goi BM, Yap WS.
europepmc +1 more source
A Comment on Niederreiter’s Public Key Cryptosystem [PDF]
, 2007 In this comment we show that a recently proposed public key cryptosystem is not safe for most of the practical cases. Furthermore, it is shown that the security of this system is closely connected with the problem of computing logarithms over a finite field.
openaire +1 more source
Private Key Extension of Polly Cracker Cryptosystems [PDF]
Computer Science Journal of Moldova, 2008 In 1993 Koblitz and Fellows proposed a public key cryptosystem, Polly Cracker, based on the problem of solving multivariate systems of polynomial equations, which was soon generalized to a Dröbner basis formulation.
Nina Taslaman
doaj
Analysis of the MQQ Public Key Cryptosystem
, 2010 MQQ is a multivariate cryptosystem based on multivariate quadratic quasigroups and the Dobbertin transformation [18]. The cryptosystem was broken both by Gröbner bases computation and MutantXL[27]. The complexity of Gröbner bases computation is exponential in the degree of regularity, which is the maximum degree of polynomials occurring during the ...
Faugère, Jean-Charles +3 more
openaire +2 more sources
Further research on public-key cryptosystems based on third-order recurrence sequence
Tongxin xuebao, 2005 Properties of third-order recurrence sequences were investtgated and a new variant of GH public-key cryptosystem was proposed. It is further improved to be a probabilistic public-key cryptosystem.
JIANG Zheng-tao 1 +3 more
doaj +2 more sources
On a new fast public key cryptosystem
CoRR, 2014 This paper presents a new fast public key cryptosystem namel : a key exchange algorithm, a public key encryption algorithm and a digital signature algorithm, based on the difficulty to invert the following function: $$F(x) =(a\times x)Mod(2^p)Div(2^q).$$ Mod is modulo operation , Div is integer division operation , a , p and q are integers where $( p ...
openaire +3 more sources
Strongly Secure Certificate-based Blind Signature Scheme Without Pairings
工程科学与技术, 2013 :Certificate-based Cryptosystem is the latest evolution of traditional public key cryptosystem, but most of existing certificate-based signature schemes were constructed by pairings, which led to low calculation efficiency.
周萍, 何大可, 张文芳
doaj