Results 51 to 60 of about 11,187 (236)
Little Dragon Two: An efficient Multivariate Public Key Cryptosystem [PDF]
International Journal of Network Security & Its Applications 2.2
(2010) 1-10, 2010 In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant a variant of Matsumoto Imai cryptosystem C*. However Patarin latter found that Little Dragon cryptosystem is not secure [8], [3]. In this paper we propose a cryptosystem Little Dragon Two which is as efficient as Little Dragon cryptosystem but secure ...
arxiv +1 more source
International Journal of Satellite Communications and Networking, EarlyView.ABSTRACT Quantum key distribution (QKD) allows the generation of cryptographic keys beyond the computational hardness paradigm and is befitting for secure data transmission requiring long‐term security. The communication distance of fiber‐based QKD, however, is limited to a few hundred kilometers due to the exponential scaling of signal attenuation ...
Davide Orsucci +7 more
wiley +1 more source
Cryptanalysis of the Sidelnikov Cryptosystem [PDF]
, 2007 We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a private key from a given public key. Its running time is subexponential and is effective if the parameters of the Reed-Muller code allow for efficient sampling of minimum weight codewords. For example, the length 2048, 3rd-order Reed-Muller code as proposed in [
Minder, Lorenz, Shokrollahi, Amin
openaire +2 more sources
Dragon Crypto – An Innovative Cryptosystem [PDF]
International Journal of Computer Applications, 2020 5 pages, 6 figures, 1 ...
Awnon Bhowmik, Unnikrishnan Menon
openaire +3 more sources
Cryptography based on the Matrices
Boletim da Sociedade Paranaense de Matemática, 2019 In this work we introduce a new method of cryptography based on the matrices over a finite field $\mathbb{F}_{q}$, were $q$ is a power of a prime number $p$. The first time we construct the matrix $M=\left( \begin{array}{cc} A_{1} & A_{2} \\ 0 & A_{3} \\
M. Zeriouh, A. Chillali, Abdelkarim Boua
doaj +1 more source
A tiny public key scheme based on Niederreiter Cryptosystem [PDF]
arXiv, 2023 Due to the weakness of public key cryptosystems encounter of quantum computers, the need to provide a solution was emerged. The McEliece cryptosystem and its security equivalent, the Niederreiter cryptosystem, which are based on Goppa codes, are one of the solutions, but they are not practical due to their long key length.
arxiv
CAAI Transactions on Intelligence Technology, EarlyView.Abstract Life expectancy has improved with new‐age technologies and advancements in the healthcare sector. Though artificial intelligence (AI) and the Internet of Things (IoT) are revolutionising smart healthcare systems, security of the healthcare data is always a concern.
Shaiju Panchikkil +4 more
wiley +1 more source
Elliptic Curve Cryptosystems [PDF]
Mathematics of Computation, 1987 We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure, because the analog of the discrete logarithm problem on elliptic curves is likely to be harder than the classical discrete logarithm problem, especially ...
openaire +2 more sources
RSA: A number of formulas to improve the search for p+qp+q
Journal of Mathematical Cryptology, 2017 Breaking RSA is one of the fundamental problems in cryptography. Due to its reliance on the difficulty of the integer factorization problem, no efficient solution has been found despite decades of extensive research. One of the possible ways to break RSA
Mohammed Ahmed, Alkhelaifi Abdulrahman
doaj +1 more source
Finite Fields and Their Applications, 2005 Hyperelliptic curves over finite fields are used in cryptosystems. To reach better performance, Koblitz curves, i.e. subfield curves, have been proposed. We present fast scalar multiplication methods for Koblitz curve cryptosystems for hyperelliptic curves enhancing the techniques published so far.
openaire +3 more sources