Results 111 to 120 of about 11,187 (236)
Cryptanalysis of a New Knapsack Type Public-Key Cryptosystem [PDF]
arXiv, 2012 Recently, Hwang et al. introduced a knapsack type public-key cryptosystem. They proposed a new algorithm called permutation combination algorithm. By exploiting this algorithm, they attempt to increase the density of knapsack to avoid the low-density attack.
arxiv
An implementation for a fast public-key cryptosystem [PDF]
, 1991 Gordon B. Agnew +3 more
openalex +1 more source
Public key cryptosystem based on algebraic geometric codes
Tongxin xuebao, 2008 A public-key cryptosystem based on algebraic geometric codes was proposed.The cryptosystem is a pub-lic-key system combined with error correcting.Compared with M public-key system and some variants,the performance of the public-key cryptosystem was ...
ZHANG Ying, YUE Dian-wu
doaj +2 more sources
Medical image cryptosystem using improved Quadratic Congruential Generator and logistic map
Measurement: Sensors, 2022 The medical images, patient history, doctor's note, and clinical review contained in an electronic health record are highly sensitive data. Digital images are multimedia data that comprise of hidden information in medical field.
M.Y. Mohamed Parvees, T. Vijayakumar
doaj
A New Chaos-Based Cryptosystem for Secure Transmitted Images [PDF]
arXiv, 2015 This paper presents a novel and robust chaos-based cryptosystem for secure transmitted images and four other versions. In the proposed block encryption/decryption algorithm, a 2D chaotic map is used to shuffle the image pixel positions. Then, substitution (confusion) and permutation (diffusion) operations on every block, with multiple rounds, are ...
arxiv
Cryptosystems Using Automorphisms of Finitely Generated Free Groups [PDF]
arXiv, 2016 This paper introduces a newly developed private key cryptosystem and a public key cryptosystem. In the first one, each letter is encrypted with a different key. Therefore, it is a kind of a one-time pad. The second one is inspired by the ElGamal cryptosystem. Both presented cryptosystems are based on automorphisms of free groups. Given a free group $F$
arxiv
McEliece-type Cryptosystems over Quasi-cyclic Codes [PDF]
arXiv, 2018 In this thesis, we study algebraic coding theory based McEliece-type cryptosystems over quasi-cyclic codes. The main goal of this thesis is to construct a cryptosystem that resists quantum Fourier sampling making it quantum secure. We propose a new variant of Niederreiter cryptosystem over rate $\frac{m-1}{m}$ quasi-cyclic codes which is secure against
arxiv
Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic [PDF]
, 1999 Nigel P. Smart
openalex +1 more source
, 2004 The remarkably long-standing problem of cryptography is to generate completely secure key. It is widely believed that the task cannot be achieved within classical cryptography. However, there is no proof in support of this belief. We present an incredibly simple classical cryptosystem which can generate completely secure key.
openaire +2 more sources
Many-to-one trapdoor functions and their relation to public-key cryptosystems [PDF]
, 1998 Mihir Bellare +3 more
openalex +1 more source