搜索结果: 1-15 共查到“军事学 cryptosystem”相关记录126条 . 查询时间(0.046 秒)
A New Attack on RSA and Demytko's Elliptic Curve Cryptosystem
RSA Cryptanalysis Coppersmith's method
font style='font-size:12px;'>
2019/9/19
Let N=pqN=pq be an RSA modulus and ee be a public exponent. Numerous attacks on RSA exploit the arithmetical properties of the key equation ed−k(p−1)(q−1)=1ed−k(p−1)(q...
A New Public Key Cryptosystem Based on Edwards Curves
Elliptic curves Twisted Edwards curves RSA cryptosystem
font style='font-size:12px;'>
2019/9/19
The elliptic curve cryptography plays a central role in various cryptographic schemes and protocols. For efficiency reasons, Edwards curves and twisted Edwards curves have been introduced. In this pap...
Improved Cryptanalysis of the KMOV Elliptic Curve Cryptosystem
public-key cryptography KMOV
font style='font-size:12px;'>
2019/9/19
This paper presents two new improved attacks on the KMOV cryptosystem. KMOV is an encryption algorithm based on elliptic curves over the ring ZNZN where N=pqN=pq is a product of two large primes of eq...
Lucente Stabile Atkins (LSA) Cryptosystem (Unbreakable)
public-key cryptography quantum cryptography RSA
font style='font-size:12px;'>
2019/9/16
The LSA cryptosystem is an asymmetric encryption algorithm which is based on both group and number theory that follows Kerckhoffs’s principle and relies on a specific case of Gauss’s Generalization of...
A Simple Key Reuse Attack on Ntru Cryptosystem
Lattice Encryption Ntru Cryptanalysis KEM
font style='font-size:12px;'>
2019/9/16
In 1998, Jerey Hostein, Jill Pipher, and Joseph H. Silverman introduced the famous Ntru cryptosystem, and called it "A ring-based public key cryptosystem". Actually it turns out to be a lattice based ...
Improved Cryptanalysis of the AJPS Mersenne Based Cryptosystem
public-key cryptography Mersenne numbers LLL
font style='font-size:12px;'>
2019/6/3
At Crypto 2018, Aggarwal, Joux, Prakash and Santha (AJPS) described a new public-key encryption scheme based on Mersenne numbers. Shortly after the publication of the cryptosystem, Beunardeau et al. d...
On a Rank-Metric Code-Based Cryptosystem with Small Key Size
code-based cryptography rank-metric codes interleaving
font style='font-size:12px;'>
2018/12/19
A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem is proposed.The FL cryptosystem is based on the hardness of list decoding Gabidulin codes which are special rank-metric codes. We...
Code-based Cryptosystem from Quasi-Cyclic Elliptic Codes
code-based cryptography post quantum cryptograp elliptic code
font style='font-size:12px;'>
2018/12/6
With the fast development of quantum computation, code based cryptography arises public concern as a candidate of post quantum cryptography. However, the large key-size becomes a main drawback such th...
A Public Key Exchange Cryptosystem Based on Ideal Secrecy
one way function ideal secrecy asymmetric key cryptography
font style='font-size:12px;'>
2018/11/29
This paper proposes two closely related asymmetric key (or a public key) schemes for key exchange whose security is based on the notion of ideal secrecy. In the first scheme, the private key consists ...
Reducing the Key Size of McEliece Cryptosystem from Goppa Codes via Permutations
McEliece cryptosystem automorphism-incuded Goppa codes quasi-cyclic
font style='font-size:12px;'>
2018/11/2
In this paper, we propose a new general construction to reduce the public key size of McEliece-based schemes based on Goppa codes. In particular, we generalize the ideas of automorphism-induced Goppa ...
DRANKULA: a McEliece-like rank metric based cryptosystem implementation
Code-based cryptography Public key cryptography Cryptosystem
font style='font-size:12px;'>
2018/8/28
We present and analyze the performance of DRANKULA, a McEliece-like cryptosystem implementation using \textit{rank metric} instead of Hamming distance. Namely, we use the scheme proposed by Loidreau i...
New Single-Trace Side-Channel Attacks on a Specific Class of Elgamal Cryptosystem
Elgamal cryptosystem Side-channel attacks Montgomery Ladder
font style='font-size:12px;'>
2018/8/21
In 2005, Yen et al. proposed the first N−1N−1 attack on the modular exponentiation algorithms such as BRIP and square-and-multiply-always methods. This attack makes use of the ciphertext N...
Towards Static Assumption Based Cryptosystem in Pairing Setting: Further Applications of DéjàQ and Dual-Form Signature
Bilinear target assumption q-type assumption DejaQ technique and Dual form signature technique
font style='font-size:12px;'>
2018/8/16
A large number of parameterized complexity assumptions have been introduced in the bilinear pairing setting to design novel cryptosystems and an important question is whether such ``qq-type" assumptio...
Finding Small Solutions of the Equation $Bx-Ay=z$ and Its Applications to Cryptanalysis of the RSA Cryptosystem
RSA Cryptanalysis Lattice
font style='font-size:12px;'>
2018/6/6
We present two attacks on RSA as its applications. One focuses on the case with known bits of the private exponent together with the prime factor, and the other considers the case with a small differe...
Provably Secure Integration Cryptosystem on Non-Commutative Group
Braid group Public key cryptosystem CPA
font style='font-size:12px;'>
2018/5/28
Braid group is a very important non-commutative group. It is also an important tool of quantum field theory, and has good topological properties. This paper focuses on the provable security research o...