A Secure and Efficient Code-Based Signature Scheme

2019 ◽  
Vol 30 (04) ◽  
pp. 635-645 ◽  
Author(s):  
Xiangxin Liu ◽  
Xiaoyuan Yang ◽  
Yiliang Han ◽  
Xu An Wang
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem ◽  
Hamming Weight ◽  
Signature Scheme ◽  
Error Vector ◽  
Syndrome Decoding ◽  
High Security ◽  
Two Systems ◽  
Disclosure Of Information ◽  
Efficient Code

The McEliece public key cryptosystem and the Niederreiter public key cryptosystem are the two major branches of the code-based public key cryptosystem. It has been found that the difficult problems relied by these two systems are different from the syndrome decoding problem stated by Berlekamp et al. The Hamming weight of the error vector is fixed and known to the attackers in these two systems, which leading to the disclosure of information, and through which the attacker can implement an effective attack. In this paper, an improved vision of the McEliece public key cryptosystem was given, and a new code-based signature scheme is designed based on the new cryptosystem. As a result, we achieve a more secure variant of McEliece public key cryptosystem and a more secure code-based signature scheme with high security and fast signing speed.

A Verifiable Ring Signature Scheme Based on Multivariate Public-Key Cryptosystem

2013 ◽  
Vol 380-384 ◽  
pp. 1899-1902
Author(s):  
Ling Ling Wang
Keyword(s):  
Public Key ◽  
Quantum Computers ◽  
Public Key Cryptosystem ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Ring Signature ◽  
Multivariate Public Key

Most existing verifiable ring signature schemes are based on traditional PKCs, which cannot resist future attacks of quantum computers. Fortunately, the MQ-problem based Multivariate Public-Key Cryptosystem (MPKC) is an important alternative to traditional PKCs for its potential to resist future attacks of quantum computers. In this paper, we proposed a construction of verifiable ring signature based on MPKC, which has the properties of consistent, unforgery, signer-anonymity and verifiability.

Fast Public Key Cryptosystem Based Blind Signature Scheme

2010 ◽  
Vol 20-23 ◽  
pp. 505-511
Author(s):  
Xuan Wu Zhou
Keyword(s):  
High Efficiency ◽  
Discrete Logarithm ◽  
Security Analysis ◽  
Blind Signature ◽  
Public Key ◽  
Secret Message ◽  
Polynomial Algorithms ◽  
Public Key Cryptosystem ◽  
Signature Scheme ◽  
Replay Attack

Compared with symmetric cryptosystem, asymmetric cryptosystem has much superiority in many application cases. Yet, the computation in a public key cryptosystem is much more complex than symmetric cryptosystem. In the paper, we applied HCC (Hyper-elliptic Curves Cryptosystem) as a typical fast public key cryptosystem into the designing of efficient blind signature scheme and presented an improved blind signature with fast cryptography algorithms. By utilizing probabilistic blinding algorithm, the scheme renders effective protection for the secrecy of original user, the signature generator or outer adversaries can not attack the secret message via the blinded information with effective polynomial algorithms. The scheme avoids the relevance between different signatures and interim parameters from the same original user, thus it effectively prevents signature forgery and replay attack. As security analysis for the scheme, we presented similar blind signature without relevant improving algorithms based on discrete logarithm cryptosystem. The analysis and comparison with other schemes both justify the security, reliability and high efficiency of the improved blind signature scheme regarding software and hardware application environment.

Public Key Cryptosystem and Signature Scheme over the Ring Z[3√2]

2014 ◽  
Vol 513-517 ◽  
pp. 4509-4512
Author(s):  
Xue Dong Dong ◽  
Xin Peng Jing
Keyword(s):  
Digital Signature ◽  
Public Key ◽  
Periodic Change ◽  
Security Level ◽  
Public Key Cryptosystem ◽  
Signature Scheme ◽  
Group Of Units ◽  
Original Scheme ◽  
Primitive Roots ◽  
Digital Signature Scheme

In this paper, the extended ElGamal public key cryptosystem and digital signature scheme with appendix are described in the setting of the group of units of the ring.Elements of the group of units with the larger order are used as the base elements in the proposed extension instead of primitive roots used in the original scheme. Proposed schemes make periodic change of the group and base elements to provide necessary security level.

Attacks on an ID-based signature scheme based on Rabin's public key cryptosystem

1994 ◽  
Vol 17 (9) ◽  
pp. 674-676
Author(s):  
Ming-Yung Ko ◽  
Tzonelih Hwang ◽  
CC Chang
Keyword(s):  
Public Key ◽  
Public Key Cryptosystem ◽  
Signature Scheme

scholarly journals A Novel Public Key Cryptosystem and Digital Signatures

1970 ◽  
Vol 3 (1) ◽  
pp. 22-30
Author(s):  
Saba Inam ◽  
Shamsa Kanwal ◽  
Adnan Zahid ◽  
Maria Abid
Keyword(s):  
Digital Signatures ◽  
Commutative Rings ◽  
Public Key ◽  
Public Key Cryptosystem ◽  
Brute Force ◽  
Signature Scheme ◽  
Decomposition Problem ◽  
Symmetric Decomposition ◽  
The Hard Problem ◽  
Work Structure

In this article, we develop a new algebraic public key cryptosystem, which is based on generally non-commutative ring. Firstly, we define the polynomials over the non-commutative rings and then take it as underlying work structure. The hard problem of the scheme is the mixture of matrix discrete log problem under modular classes and polynomial symmetric decomposition problem. Using matrices of higher order and large modular classes resist the brute force and other well-known attacks exists in the literature. We also discuss the computational complexity of proposed scheme. On the other hand, we propose a signature scheme over a non-commutative division semiring. The key idea behind the signature scheme is that, for a given non-commutative division semiring, we build a polynomial and then implement digital signatures on multiplicative structure of semiring.

Sign in / Sign up

Export Citation Format

Share Document