Results 81 to 90 of about 19,147 (192)
Security of the cryptosystems based on ergodic matrices
The security of the public-key cryptosystems based on ergodicmatrices over finite field was analysed.According to the public key,a system of linear equations for the forged secret key bits is obtained by inverse matrix elimination method.It is proved ...
Hua-wei HUANG +3 more
doaj +2 more sources
Electronic health information exchange (HIE) allows doctors, nurses, pharmacists, other health care providers and patients to appropriately access and securely share a patient’s vital medical information electronically—improving the speed, quality ...
Hailong Yu +3 more
doaj +1 more source
An Efficient Public Key Encryption Scheme Based on QC-MDPC Lattices
In this paper, we introduce a new family of lattices, namely QC-MDPC lattices, which are a special case of LDPC lattices, and an improved bit flipping algorithm for decoding of these lattices. Encoding and decoding implementations of QC-MDPC lattices are
Khadijeh Bagheri +2 more
doaj +1 more source
Certificateless Blind Signcryption With Low Complexity
Elliptic curve cryptosystem (ECC) has the merits of providing shorter key length and higher processing speed compared with other public key cryptosystems with respect to the same security level.
Huifang Yu, Zhicang Wang
doaj +1 more source
Private Key Extension of Polly Cracker Cryptosystems [PDF]
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
NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks. [PDF]
Ibrahim A +5 more
europepmc +1 more source
An image encryption scheme based on public key cryptosystem and quantum logistic map. [PDF]
Ye G, Jiao K, Huang X, Goi BM, Yap WS.
europepmc +1 more source
Homomorphic public-key cryptosystems and encrypting boolean circuits
In this paper homomorphic cryptosystems are designed for the first time over any finite group. Applying Barrington's construction we produce for any boolean circuit of the logarithmic depth its encrypted simulation of a polynomial size over an ...
Grigoriev, Dima, Ponomarenko, Ilia
core +1 more source
A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem Based on Reed-Solomon Codes
Baldi et \textit{al.} proposed a variant of McEliece's cryptosystem. The main idea is to replace its permutation matrix by adding to it a rank 1 matrix.
Gauthier, Valérie +2 more
core +1 more source
Further research on public-key cryptosystems based on third-order recurrence sequence
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

