A digital signature scheme based on linear error-correcting block codes

1995 ◽  
pp. 238-248 ◽  
Author(s):  
Mohssen Alabbadi ◽  
Stephen B. Wicker
Keyword(s):  
Digital Signature ◽  
Block Codes ◽  
Signature Scheme ◽  
Digital Signature Scheme

scholarly journals Improvement to Nyang-Song fast digital signature scheme

1997 ◽  
Vol 33 (22) ◽  
pp. 1861 ◽  
Author(s):  
Wei-Hua He ◽  
Tzong-Chen Wu
Keyword(s):  
Digital Signature ◽  
Signature Scheme ◽  
Digital Signature Scheme

scholarly journals Digital signature scheme on the 2 x 2 matrix algebra

2021 ◽  
Vol 17 (3) ◽  
pp. 254-261
Author(s):  
Nikolay A. Moldovyan ◽  
◽  
Alexandr A. Moldovyan ◽  
Keyword(s):  
Digital Signature ◽  
High Performance ◽  
Matrix Algebra ◽  
Multiplicative Group ◽  
Discrete Logarithm ◽  
Signature Scheme ◽  
The Public ◽  
Signature Generation ◽  
Commutative Subalgebras ◽  
Digital Signature Scheme

The article considers the structure of the 2x2 matrix algebra set over a ground finite field GF(p). It is shown that this algebra contains three types of commutative subalgebras of order p2, which differ in the value of the order of their multiplicative group. Formulas describing the number of subalgebras of every type are derived. A new post-quantum digital signature scheme is introduced based on a novel form of the hidden discrete logarithm problem. The scheme is characterized in using scalar multiplication as an additional operation masking the hidden cyclic group in which the basic exponentiation operation is performed when generating the public key. The advantage of the developed signature scheme is the comparatively high performance of the signature generation and verification algorithms as well as the possibility to implement a blind signature protocol on its base.

scholarly journals Digital Signature Scheme for Image

2012 ◽  
Vol 49 (16) ◽  
pp. 1-6
Author(s):  
Kanchan K.Doke ◽  
S. M. Patil
Keyword(s):  
Digital Signature ◽  
Signature Scheme ◽  
Digital Signature Scheme

scholarly journals A New Digital Signature Scheme Using Tribonacci Matrices

2020 ◽  
Vol 9 (3) ◽  
Author(s):  
S.C. Gupta ◽  
Manju Sanghi
Keyword(s):  
Digital Signature ◽  
Coding Theory ◽  
Fibonacci Numbers ◽  
Signature Scheme ◽  
Important Goal ◽  
Current Technology ◽  
Digital Signature Scheme

Achieving security is the most important goal for any digital signature scheme. The security of RSA, the most widely used signature is based on the difficulty of factoring of large integers. The minimum key size required for RSA according to current technology is 1024 bits which can be increased with the advancement in technology. Representation of message in the form of matrix can reduce the key size and use of Tribonacci matrices can double the security of RSA. Recently M.Basu et.al introduced a new coding theorycalled Tribonacci coding theory based onTribonacci numbers, that are the generalization ofthe Fibonacci numbers. In this paper we present anew and efficient digital signature scheme usingTribonacci matrices and factoring.

Sign in / Sign up

Export Citation Format

Share Document