The rapid development of quantum computing brings great challenges to public key cryptosystems.The braid group,which is non-commutative,provides a new platform of constructing cryptographic protocols.A convertible authenticated encryption scheme over braid group is proposed on the difficulty of conjugacy search problem and multiple conjugacy problem,in which only the designated receiver can recover and authenticate the message,when the sender repudiates the signature,the receiver can prove the dishonesty of the sender by converting the signature to an ordinary one without the cooperating of the sender.As for the resistance against quantum attacks,the proposed scheme has advantage over the schemes based on commutative algebraic structures.
The rapid development of quantum computing brings great challenges to public key cryptosystems.The braid group,which is non-commutative,provides a new platform of constructing cryptographic protocols.A convertible authenticated encryption scheme over braid group is proposed on the difficulty of conjugacy search problem and multiple conjugacy problem,in which only the designated receiver can recover and authenticate the message,when the sender repudiates the signature,the receiver can prove the dishonesty of the sender by converting the signature to an ordinary one without the cooperating of the sender.As for the resistance against quantum attacks,the proposed scheme has advantage over the schemes based on commutative algebraic structures.
Abstract We propose BRCE (Braid-Ring Convolutional Encryption), a novel quantum-resilient group ring-based encryption scheme built over the non-abelian structure of braid groups and their integral group rings. The encryption mechanism applies convolution-based masking with randomized braid elements to achieve semantic obfuscation without relying on periodic structures. Our design embeds high-entropy messages into non-commutative algebraic carriers , resulting in ciphertexts that resist both classical and quantum algebraic attacks. We provide a provable security reduction from the Conjugacy Search Problem (CSP) in braid groups and show that the scheme satisfies IND-CPA and IND-CCA security notions under reasonable pseudorandomness assumptions. We anchor security in a new hardness assump-tion—the Group Ring Convolution Inversion Problem (GRCIP)—tailored to non-abelian group rings. Further, we demonstrate that the structure resists reductions to the Hidden Subgroup Problem (HSP), positioning BRCE as a competitive post-quantum candidate rooted in topological and algebraic hardness. MSC 2020: 94A60, 20F36, 68Q12, 11T71
Shor,Boneh,Liptonon et al. present some remarkable quantum algorithms which can solve integer factoring problem, discrete logarithm problem and discrete logarithm problem on elliptic curves in quantum polynomial time. These quantum algorithms are great challenges to classical public key cryptographies based on the above-described hard problems. It seems that braid group is a kind of considerable public key cryptography platform, but current key agreement protocols, such as AAG,AAFG and BDH, all have different degrees of security weaknesses.This paper takes advantage of random braids and non-conjugate transformations to present an improved braid key agreement protocol related to AAG and AAFG, which can make the two communication parties securely share a common key over any insecure channel. This protocol can resists current length-based attacks, linear representation attacks and other conjugacy search attacks.
The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant quantum cryptography very urgent. This motivate us to design a new key exchange protocol and encryption scheme in this paper. Firstly, some acknowledged mathematical problems was introduced, such as ergodic matrix problem and tensor decomposition problem, the two problems have been proved to NPC hard. From the computational complexity prospective, NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them. From the algebraic structures prospective, non-commutative cryptography has been considered to resist quantum. The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures, so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures. Secondly, a new problem was constructed based on the introduced problems in this paper, then a key exchange protocol and a public key encryption scheme were proposed based on it. Finally the security analysis, efficiency, recommended parameters, performance evaluation and etc. were also been given. The two schemes has the following characteristics, provable security, security bits can be scalable, to achieve high efficiency, quantum resistance, and etc.
This paper proposes a new and efficient key agreement protocol where trusted third party (TTP) is involved. There are various available schemes which are based on number theoretic, elliptic curves etc. Due to the availability of modern computers, these schemes are vulnerable to man in the middle attack (MITM). So there is a requirement of new technique for key agreement which surprises the intruders and enhances the security of communication system. Our proposed protocol utilizes the property of a non commutative group. We have given the security proof of our protocol keeping the fact in mind that decomposition and conjugacy search problem are hard in a group which is non commutative.
Abstract. We propose new cryptosystems based on self-distributive systems that are defined by conjugator searching problems (CSP) in noncommutative groups. Under certain assumptions, the ciphertexts of our basic construction are proven indistinguishable against chosen plaintext attacks (IND-CPA) in the standard model, and two extended schemes achieve the IND-CCA security in the random oracle model. Then, our proposal is instantiated with braid groups, and leads to a new braid-based encryption scheme that is directly based on the intractability assumption of CSP in braid groups. Furthermore, we quote an analysis to manifest that our newly derived braid-based cryptosystem has the potential to resist currently known quantum attacks. Keywords: Self-distributive systems, conjugator searching problem, braid groups, resistance to quantum attacks 1
Arbitrated quantum signature (AQS) schemes aim at ensuring the authenticity of a message with the help of an arbitrator. Moreover, they aim at preventing repudiation, both from a sender that denies the origin of a message, and from a receiver who disavows its reception. Such protocols use quantum communication and are often designed to protect quantum messages. In this paper, we study four recently submitted AQS schemes and propose attacks on their security.
Firstly, we look at Zhang, Sun, Zhang and Jia's AQS scheme which aims at signing quantum messages with chained CNOT encryption. We show that the sender can repudiate her messages and make false allegation of reception. Moreover, we show that a dishonest receiver can forge signatures.
Secondly, we analyse Ding, Xin, Yang and Sang's AQS protocol to sign classical messages based on GHZ states. We show that both the sender and the receiver have simple repudiation strategies.
Thirdly, we study Lu, Li, Yu and Han's AQS scheme that uses controlled teleportation to protect quantum messages. We expose forgeries, false allegation attacks and the possibility of repudiation by both parties.
Fourthly, we focus on the AQS scheme by Zhang, Xin, Sun, Li and Li designed to sign classical messages without entangled states. We show that one can disavow the reception of messages, and that information-theoretic security is not achieved for other security goals.