A new key exchange cryptosystem
An-Ping Li
本文提出了一种新的基于线性代数的密钥交换密码体制，它比Diffie-Hellman的密钥交换密码体制运算量少，但安全性较弱。
In this paper, we will present a new key exchange cryptosystem based on linear algebra, which take less operations but weaker in security than Diffie-Hellman's one.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We discuss a matrix public key cryptosystem and its numerical implementation.
On the Security of the Cha-Ko-Lee-Han-Cheon Braid Group Public Key Cryptosystem
我们表明，一些密码协议使用非交换半群，包括Cha-Ko-Lee-Han-Cheon辫子群公钥密码系统和相关的公钥密码系统，如Shpilrain-Ushakov公钥密码系统是基于MSCSP。
Homomorphic public-key cryptosystems over groups and rings
基于整数矩阵群成员问题的困难性，提出了一种新的有限群上的同态公钥密码体制。此外，首次在有限交换环上设计了一个同态密码体制。
The El-Gamal AA_β Public Key Cryptosystem - A new approach utilizing the subset sum problem in designing an asymmetric cryptosystem
El-Gamal AA_β公钥密码体制是一种基于分段AA_β函数的新的非对称密码体制。AA_β-函数本质上是一个单向布尔函数，它是由Diffie Hellman密钥交换过程中计算g^a（mod p）以及RSA密码体制中计算C \equiv M^e（mod N）和M \equiv C^d（mod N）时的平方和乘法过程所激发的。它也是由椭圆曲线密码体制中的加法和倍点运算E=kG所激发的。围绕这个新设计的非对称密码系统的数学难题是NP完全问题，称为子集和问题。El-Gamal AA_β公钥密码体制通过向接收方发送双参数密文来模仿El-Gamal密码体制和椭圆曲线密码体制。
Little Dragon Two: An efficient Multivariate Public Key Cryptosystem
在1998年[8]，Patarin提出了一种称为Little Dragon的高效密码系统，它是Matsumoto Imai密码系统C* 的变体。然而Patarin后来发现Little Dragon密码系统是不安全的[8]，[3]。本文提出了一个与小龙密码体制一样有效的密码体制小龙2，它能抵抗所有已知的攻击。与小龙密码系统一样，小龙二号的公钥是混合类型，即明文和密文变量的二次型。因此，小龙二的公钥大小等于小龙密码系统。我们的公钥算法是双射的，可用于加密和签名。
We develop a public key cryptosystem based on invariants of diagonalizable groups and investigate properties of such cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of these cryptosystem and show that it is necessary to restrict the set of parameters of the system to prevent various attacks (including linear algebra attacks and attacks based on Euclidean algorithm).
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 > q )$. We define p and q values for which ModDiv2Inv can be the hardest. We then present ModDiv2Kex, a new fast key exchange algorithm based on ModDiv2Inv. In this paper we also evaluate the hardness of this problem by reducing it to SAT .
Cryptanalysis of a New Knapsack Type Public-Key Cryptosystem
最近，Hwang等人提出了一种背包型公钥密码体制。他们提出了一种新的算法，称为排列组合算法。通过利用该算法，他们试图增加背包的密度，以避免低密度攻击。我们证明了该密码体制是不安全的，因为它是基于基本的Merkel-Hellman背包密码体制的，并且由于其超增结构，我们可以利用Shamir对基本的Merkel-Hellman背包的攻击来破解该密码体制。
Homomorphic public-key cryptosystems and encrypting boolean circuits
本文首次设计了有限群上的同态密码体制。应用巴林顿的建设，我们产生的任何布尔电路的对数深度的加密模拟的多项式大小超过一个适当的随机生成组。
All instances of the semidirect key exchange protocol, a generalisation of the famous Diffie-Hellman key exchange protocol, satisfy the so-called "telescoping equality"; in some cases, this equality has been used to construct an attack. In this report we present computational evidence suggesting that an instance of the scheme called `MOBS' is an example of a scheme where the telescoping equality has too many solutions to be a practically viable means to conduct an attack.
Cryptanalysis of Key Issuing Protocols in ID-based Cryptosystems
为了消除基于身份的密码系统中的密钥托管问题，避免对安全信道的需要，Lee等人提出了一种安全的密钥发布协议。然而，我们表明，它遭受冒名顶替，内部攻击和无能的关键隐私当局。我们还密码分析隋等人。的可分离匿名密钥发布协议。
Generating Keys in Elliptic Curve Cryptosystems
本文将介绍如何使用Delphi 7控制台应用程序的简单工具，利用GF（p）域上的标量点乘问题的软件求解，找到椭圆曲线密码体制（ECC）的密钥，其中p是任意素数。
In recent years, there have been many studies on quantum computing and the construction of quantum computers which are capable of breaking conventional number theory-based public key cryptosystems. Therefore, in the not-too-distant future, we need the public key cryptosystems that withstand against the attacks executed by quantum computers, so-called post-quantum cryptosystems. A public key cryptosystem based on polar codes (PKC-PC) has recently been introduced whose security depends on the difficulty of solving the general decoding problem of polar code. In this paper, we first implement the …
McEliece cryptosystem represents a smart open key system based on the hardness of the decoding of an arbitrary linear code, which is believed to be able to resist the advent of quantum computers. But the original McEliece cryptosystem, based on Goppa codes, has just very limited interest in practice, partly because it requires a very large public key. In this paper we propose a new general way to reduce the public key size. Unlike most papers on reducing key length of the cryptosystem, where original Goppa codes are substituted by some other codes, we suggest a new method of key size reduction…
A tiny public key scheme based on Niederreiter Cryptosystem
本文提出一种基于Niederreiter密码系统的公钥方案，其公钥长度远短于NIST决赛入围方案，安全性至少与Niederreiter相当，且简单易实现。
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev多项式最近被提出用于设计公钥系统。事实上，它们具有一些很好的混沌特性，这些特性似乎适用于密码学。此外，它们满足半群性质，这使得实现陷门机制成为可能。本文研究了一个基于这种多项式的公钥密码体制，它既能加密又能数字签名。该密码系统适用于实数，并且非常有效。不幸的是，从我们的分析来看，它并不安全。我们描述了一种攻击，允许恢复相应的明文从一个给定的密文。如果密码系统用于签名消息，则可以应用相同的攻击来产生伪造。然后，我们指出，其他原语，Diffie-Hellman一样的密钥协商方案和认证方案，沿着相同的密码系统设计，是不安全的，由于上述攻击。最后，我们讨论了在实数上构造公钥密码系统的问题和可能性。
Group Authentication Using The Naccache-Stern Public-Key Cryptosystem
组认证协议认证预定义的个体组，使得：- 没有个人被识别-验证者不知道哪些组可以被成功认证-没有敏感数据被暴露本文提出了一个基于Naccache-Stern公钥的私钥分裂的组认证协议，密钥密码系统，以这种方式，定义可验证组的布尔表达式隐含在分裂中。
On non-abelian homomorphic public-key cryptosystems
现代密码学的一个重要问题涉及代数结构中的秘密公钥计算。我们构造了同态密码体制为（秘密）满态f：G -> H，其中G，H是（代数已知）群，H是有限的.要加密的消息的字母是H的元素h元素，而其加密G的元素g使得f（g）=h。同态密码系统允许人们使用加密信息（不知道H上的原始消息）进行计算（在群G中操作）。本文首次对非阿贝尔群H构造了某些同态密码体制（以前，同态密码体制只在阿贝尔群的情况下才知道）。事实上，我们对任何可解（固定）群H给出了这样一个系统。
The purpose of this paper is to describe and analyze the Cayley-Purser algorithm, which is a public-key cryptosystem proposed by Flannery in 1999. I will present two attacks on it, one of which is apparently new. I will also examine a variant of the Cayley-Purser algorithm that was patented by Slavin in 2008, and show that it is also insecure.
In this paper, we suggest a code-based public key encryption scheme, called McNie. McNie is a hybrid version of the McEliece and Niederreiter cryptosystems and its security is reduced to the hard problem of syndrome decoding. The public key involves a random generator matrix which is also used to mask the code used in the secret key. This makes the system safer against known structural attacks. In particular, we apply rank-metric codes to McNie.
In this paper we show that it is possible to extend the framework of Persichetti's code-based framework and create a secure KEM based on the McEliece protocol. This provides greater flexibility in the application of coding theory as a basis for cryptographic purposes.
In recent years, a lot of research has gone into creating multi-layer chaotic mapping-based cryptosystems. Random-like behavior, a continuous broadband power spectrum, and a weak baseline condition dependency are all characteristics of chaotic systems. Chaos could be helpful in the three functional components of compression, encryption, and modulation in a digital communication system. To successfully use chaos theory in cryptography, chaotic maps must be built in such a way that the entropy they produce can provide the necessary confusion and diffusion. A chaotic map is used in the first laye…
A CCA2 Secure Variant of the McEliece Cryptosystem
McEliece公钥加密方案已经成为基于数论问题的密码系统的有趣替代方案。与RSA和ElGa- mal不同的是，McEliece PKC还没有被量子计算机打破。此外，即使是强硬的McEliece PKC也具有相对较大的密钥大小，加密和解密操作相当高效。尽管所有的最新成果在编码理论为基础的密码系统，到目前为止，有没有建设安全的选择密文攻击的标准模型-事实上的安全概念的公钥密码系统。在这项工作中，我们展示了第一个建设的McEliece为基础的公钥密码系统的安全选择密文攻击的标准模型。我们的设计灵感来自Rosen和Segev最近提出的技术。
An unbreakable cryptosystem
密码学的一个长期存在的问题是生成完全安全的密钥。人们普遍认为，在经典密码学中无法实现这一任务。然而，没有证据支持这一信念。我们提出了一个非常简单的经典密码系统，可以产生完全安全的密钥。
The modified Paillier cryptosystem has become extremely popular and applied in many fields, owning to its additive homomorphism. This cryptosystem provides weak private keys and a strong private key. A weak private key only can decrypt ciphertexts under the corresponding public key. The strong private key can decrypt all ciphertexts even under different public keys. When the modified Paillier cryptosystem is applied in a system, the member, often the system administrator, has the strong private key and can decrypt all ciphertexts. If this system administrator is attacked or compromised, the se…
Goldreich-Goldwasser-Halevi (GGH) public key cryptosystem is an instance of lattice-based cryptosystems whose security is based on the hardness of lattice problems. In fact, GGH cryptosystem is the lattice version of the first code-based cryptosystem, proposed by McEliece. However, it has a number of drawbacks such as; large public key length and low security level. On the other hand, Low Density Lattice Codes (LDLCs) are the practical classes of lattice codes which can achieve capacity on the additive white Gaussian noise (AWGN) channel with low complexity decoding algorithm. This paper intro…
Polynomial Lattices for the BIKE Cryptosystem
本文提出了一种基于多项式环的格结构，用于BIKE加密系统，并通过约简基方法改进了弱钥恢复技术。
Dual Layer Textual Message Cryptosystem with Randomized Sequence of Symmetric Key
本文结合视觉密码学和隐写术的概念，提出了一种通过随机对称密钥池和双层密码体制对文本信息进行加密和解密的新概念。将文本消息转换为两个图像幻灯片，并通过两个不同的对称密钥随机序列对图像进行加密。解密以相反的方式进行。加密后的图像由这两个对称密钥解密。解密的图像幻灯片被合并在一起并转换成文本消息。在这里，图像共享是通过视觉密码学的概念完成的，文本消息到图像的转换是通过隐写术的概念完成的。
We present public-private key cryptosystem which utilizes the fact that checking whether a partial automaton is carefully synchronizing is $PSPACE$-complete, even in the case of a binary alphabet.
Security Assessment of the LG Cryptosystem
本文对2019年提出的LG公钥加密体制进行密码分析，发现其部分参数安全性被高估，并存在弱密钥，使攻击者能在多项式时间内找到等效私钥。
Koopman interpretation and analysis of a public-key cryptosystem: Diffie-Hellman key exchange
本文将Diffie-Hellman密钥交换解释为非线性动力系统，利用Koopman理论将其转换为高维线性系统，从而通过简单操作重构密钥交换的秘密整数，并提供了最小提升维度的上限及数据驱动扩展。
This project involves an implementation of the Rivest Shamir Adleman (RSA) encryption algorithm in C. It consists of generation of two random prime numbers and a number co- prime to phi(n) also called euler toitent function. These three are used to generate a public key and private key. The user has to enter a message which is encrypted by the public key. The algorithm also decrypts the generated cipher text with the help of the private key and returns the plain text message which was encrypted earlier.
Public-key cryptography and invariant theory
基于群的不变量提出了公钥密码体制。我们也给出了一个概述的已知的密码系统，涉及群体。
Due to the rapid advances in the development of quantum computers and their susceptibility to errors, there is a renewed interest in error correction algorithms. In particular, error correcting code-based cryptosystems have reemerged as a highly desirable coding technique. This is due to the fact that most classical asymmetric cryptosystems will fail in the quantum computing era. Quantum computers can solve many of the integer factorization and discrete logarithm problems efficiently. However, code-based cryptosystems are still secure against quantum computers, since the decoding of linear cod…
Hilbert Matrix Based Cryptosystem using a Session Key
密码学通过提供数据加密和其他用户身份验证功能来保护用户。这项技术让电子信息的接收者验证发送者，确保信息只能被预期的人阅读，并向接收者保证信息在传输过程中没有被更改。经典密码分析涉及分析推理、数学工具的应用和模式发现的有趣组合。所提出的工作的目标是提出一种新的加密方法的基础上的特殊矩阵称为希尔伯特矩阵的认证和保密性，并提出一个模型的保密性和认证使用共享密钥密码系统的概念，数字封装使用会话密钥。在目前的工作中，提出了各种算法的加密和认证的基础上希尔伯特矩阵使用会话密钥。
Hidden Polynomial(s) Cryptosystems
我们提出了一种公钥密码系统，其中公钥是代数或微分多项式方程组，而私钥是单个多项式或小尺寸理想。我们建立了概率加密，签名和签密协议。
Security of the Cao-Li Public Key Cryptosystem
证明了\cite{CL1}中提出的Cao-Li密码体制是不安全的。它的私钥可以使用诸如LU分解和欧几里德算法的基本手段从其公钥重构。
The Rabin cryptosystem has been proposed protect the unique ID (UID) in radio-frequency identification tags. The Rabin cryptosystem is a type of lightweight public key system that is theoretetically quite secure; however it is vulnerable to several side-channel attacks. In this paper, a crashing modulus attack is presented as a new fault attack on modular squaring during Rabin encryption. This attack requires only one fault in the public key if its perturbed public key can be factored. Our simulation results indicate that the attack is more than 50\% successful with several faults in practical…
A note on quantum McEliece public-key cryptosystem
受藤田分析的启发[Quantum inf. & comput. 12（3&4），2012]，提出了一种二次加密方案，以提高原量子McEliece公钥加密算法的安全性。
RSA is one of the most popular Public Key Cryptography based algorithm mainly used for digital signatures, encryption/decryption etc. It is based on the mathematical scheme of factorization of very large integers which is a compute-intensive process and takes very long time as well as power to perform. Several scientists are working throughout the world to increase the speedup and to decrease the power consumption of RSA algorithm while keeping the security of the algorithm intact. One popular technique which can be used to enhance the performance of RSA is parallel programming. In this paper …
Cryptanalysis of a Public-key Cryptosystem Using Lattice Basis Reduction Algorithm
我们提出了一个新的攻击Hwang等人。的密码系统。该密码体制采用超增序列作为私钥，并提出了一种新的算法--置换组合算法来提高背包的密度，以避免低密度攻击。Sattar J. Aboud [Aboud j. Sattar，“An improved knapsack公钥密码学system”，International Journal of Internet Technology and Secured Transactions，Vol.3（3），pp.310-319，2011]使用Shamir对基本Merkle-Hellman密码系统的攻击来破解该密码系统。在本文中，我们介绍了一个直接攻击Hwang等人。的密码体制。通过计算提出的攻击的复杂度，我们表明，不同于Aboud的密码分析，我们的密码分析是更有效和实用。
Decision and Search in Non-abelian Cramer Shoup Public Key Cryptosystem
提出了一种非阿贝尔Cramer-Shoup密码体制的设计方法。探讨了决策和搜索的作用，并提出了可解/多环群的平台。在这个过程中，我们回顾了非阿贝尔密码学的最新进展，并发布了一些从这条研究道路上自然产生的开放问题。
At Eurocrypt'99, Paillier presented a public-key cryptosystem based on a novel computational problem. It has interested many researchers because it was additively homomorphic. In this paper, we show that there is a big difference between the original Paillier's encryption and some variants. The Paillier's encryption can be naturally transformed into a signature scheme but these variants miss the feature. In particular, we simplify the alternative decryption procedure of Bresson-Catalano-Pointcheval encryption scheme proposed at Asiacrypt'03. The new version is more applicable to cloud computin…
McNie is a code-based public key encryption scheme submitted as a candidate to the NIST Post-Quantum Cryptography standardization. In this paper, we present McNie2-Gabidulin, an improvement of McNie. By using Gabidulin code, we eliminate the decoding failure, which is one of the limitations of the McNie public key cryptosystem that uses LRPC codes. We prove that this new cryptosystem is IND-CPA secure. Suggested parameters are also given which provides low key sizes compared to other known code based cryptosystems with zero decryption failure probability.
In this paper, a novel and efficient hardware implementation of steganographic cryptosystem based on a public-key cryptography is proposed. Digital images are utilized as carriers of secret data between sender and receiver parties in the communication channel. The proposed public-key cryptosystem offers a separable framework that allows to embed or extract secret data and encrypt or decrypt the carrier using the public-private key pair, independently. Paillier cryptographic system is adopted to encrypt and decrypt pixels of the digital image. To achieve efficiency, a proposed efficient paralle…
Recently, a new fast public key exchange protocol was presented by S. Bouftass. The protocol is based on the difficulty of inverting the function $F(x)=\lfloor (zx \mod 2^p)/ 2^q \rfloor$. In this paper, we describe a practical attack against this protocol based on Closest Vector Problem (CVP) and Gaussian lattice reduction.
Traditional methods in public key cryptography are based on number theory, and suffer from problems such as dealing with very large numbers, making key creation cumbersome. Here, we propose a new public key cryptosystem based on strings only, which avoids the difficulties of the traditional number theory approach. The security mechanism for public and secret keys generation is ensured by a recursive encoding mechanism embedded in a quasi-commutative-random function, resulted from the composition of a quasi-commutative function with a pseudo-random function. In this revised version of the paper…
Information Hiding in CSS : A Secure Scheme Text-Steganography using Public Key Cryptosystem
近年来，编程世界已经引入了一种新的程序设计语言来设计网站，它是CSS，可以与HTML一起使用来开发Web界面。而现在，这两种程序设计语言似乎是不可分割的。作为客户端脚本，CSS作为原始脚本对所有用户都是可见的，但它不能被授权更改。网站是全世界信息传播者的工具，这当然可以通过使用CSS作为信息隐藏器来进行秘密通信。提出了一种利用CSS等Web工具进行信息隐藏的新方案。这是一种使用文本隐写术技术的秘密通信机制，该技术将消息嵌入CSS文件中，并使用RSA作为公钥密码算法进行进一步加密。
We propose BQTRU, a non-commutative NTRU-like cryptosystem over quaternion algebras. This cryptosystem uses bivariate polynomials as the underling ring. The multiplication operation in our cryptosystem can be performed with high speed using quaternions algebras over finite rings. As a consequence, the key generation and encryption process of our cryptosystem is faster than NTRU in comparable parameters. Typically using Strassen's method, the key generation and encryption process is approximately $16/7$ times faster than NTRU for an equivalent parameter set. Moreover, the BQTRU lattice has a hy…
A verifiable multi-secret sharing (VMSS) scheme enables the dealer to share multiple secrets, and the deception of both participants and the dealer can be detected. After analyzing the security of VMSS schemes proposed by Mashhadi and Dehkordi in 2015, we illustrate that they cannot detect some deception of the dealer. By using nonhomogeneous linear recursion and LFSR public key cryptosystem, we introduce two new VMSS schemes. Our schemes can not only overcome the drawback mentioned above, but also have shorter private/public key length at the same safety level. Besides, our schemes have dynam…
ITRU cryptosystem is a public key cryptosystem and one of the known variants of NTRU cryptosystem. Instead of working in a truncated polynomial ring, ITRU cryptosystem is based on the ring of integers. The authors claimed that ITRU has better features comparing to the classical NTRU, such as having a simple parameter selection algorithm, invertibility, and successful message decryption, and better security. In this paper, we present an attack technique against the ITRU cryptosystem, and it is mainly based on a simple frequency analysis on the letters of ciphertexts.
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 of cryptosystem over braid group, which consists of two aspects: One, we proved that the Ko's cryptosystem based on braid group is secure against chosen-plaintext-attack(CPA) which proposed in CRYPTO2000, while it dose not resist active attack. The other is to propose a new public key cryptosystem over braid group which is secure against adaptive chosen-ciphertext-attack(CCA2). Our proofs are based…
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 prove that the recent structural attack on the system by Gaborit et al. is equivalent to decoding an interleaved Gabidulin code. Since all known polynomial-time decoders for these codes fail for a large constructive class of error patterns, we are able to construct public keys that resist the attack. It is also shown that all other known attacks fail for our repair and parameter choices. Compare…
This paper presents a key recovery attack on the cryptosystem proposed by Lau and Tan in a talk at ACISP 2018. The Lau-Tan cryptosystem uses Gabidulin codes as the underlying decodable code. To hide the algebraic structure of Gabidulin codes, the authors chose a matrix of column rank $n$ to mix with a generator matrix of the secret Gabidulin code. The other part of the public key, however, reveals crucial information about the private key. Our analysis shows that the problem of recovering the private key can be reduced to solving a multivariate linear system over the base field, rather than so…
Secret Key Cryptosystem based on Polar Codes over Binary Erasure Channel
提出了一种基于极化码的二进制擦除信道下的高效秘密密钥密码体制。我们介绍了一种方法，第一次我们的知识，从攻击者隐藏的极化码的生成矩阵。事实上，我们的主要目标是使用有限长度的极化码实现安全可靠的通信。与Rao-Nam密码体制相比，该体制在抵抗选择明文攻击方面具有显著的安全优势。此外，在应用新的压缩算法之后，密钥长度减小。此外，该方案受益于高码率和适当的错误性能，以实现可靠的通信。
We propose a framework for threshold cryptosystems under a permissionless-economic model in which the participants are rational profit-maximizing entities. To date, threshold cryptosystems have been considered under permissioned settings with a limited adversary. Our framework relies on an escrow service that slashes and redistributes deposits to incentivize participants to adhere desired behaviors. Today, more than ever, sophisticated escrow services can be implemented over public blockchains like Ethereum, without additional trust assumptions. The key threat to rational threshold cryptosyste…
Simple Power Analysis on Post-Quantum Code Based Cryptosystems
本文研究了基于编码理论的后量子密码系统中，使用简单功耗分析（SPA）评估解封装过程中共享秘密密钥生成阶段是否存在信息泄露，并通过实验发现电磁辐射与秘密值之间的相关性，利用机器学习模型在仅收集200条功耗轨迹的情况下预测共享会话密钥的比特。
In this paper, a code-based public-key cryptosystem based on interleaved Goppa codes is presented. The scheme is based on encrypting several ciphertexts with the same Goppa code and adding a burst error to them. Possible attacks are outlined and the key size of several choices of parameters is compared to those of known schemes for the same security level. For example, for security level 128 bits, we obtain a key size of 696 Kbits whereas the classical McEliece scheme based on Goppa codes using list decoding requires a key size of 1935 Kbits.
A Factoring and Discrete Logarithm based Cryptosystem
本文介绍了一种新的公钥密码体制，它基于两个难题：模复合模的立方根提取（等价于模的因式分解）和离散对数问题。这两个难题在密钥生成、加密和解密阶段结合在一起。将IFP和DLP相结合，提出了一种安全高效的公钥密码体制.为了破解该方案，对手可以分别求解IFP和DLP，这在计算上是不可行的。密钥生成是基于离散对数模复合模的简单操作。加密阶段基于立方根计算和DLP。这些操作在计算上是有效的。
A McEliece cryptosystem using permutation codes
本文研究了基于置换纠错码构建的公钥密码体制，证明其不安全，但提出了一种包含基于线性纠错码的McEliece密码体制的增强方案。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。