scholarly journals Penerapan skema tanda tangan Schnorr pada pembuatan tanda tangan digital

2017 ◽  
Vol 12 (1) ◽  
pp. 57
Author(s):  
Herdita Fajar Isnaini ◽  
Karyati Karyati
Keyword(s):  
Digital Signature ◽  
Hash Function ◽  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Key Generation ◽  
Signature Scheme ◽  
Private Key ◽  
Message Digest ◽  
Schnorr Signature

Tanda tangan digital dapat dijadikan sebagai salah satu cara untuk menjamin keaslian pesan atau informasi yang diterima. Salah satu skema yang dapat digunakan dalam membentuk tanda tangan adalah skema tanda tangan Schnorr. Skema tanda tangan ini berdasarkan pada masalah logaritma diskret. Skema ini memerlukan penggunaan fungsi hash yang akan menghasilkan nilai hash pesan untuk pembuatan tanda tangan, yang menjadi salah satu alasan keamanan dari skema ini. Skema tanda tangan Schnorr terdiri dari tiga proses, yaitu: pembentukan kunci, pembuatan tanda tangan serta verifikasi. Kajian ini akan membahas mengenai skema tanda tangan Schnorr dalam membentuk tanda tangan digital sebagai pengaman keaslian informasi, yang dibahas per prosesnya, meliputi: pembentukan kunci, pembuatan tanda tangan yang disertai perhitungan nilai hash serta verifikasi. Hasil dari kajian ini adalah didapatkan algoritma – algoritma dari skema tanda tangan Schnorr, yaitu algoritma pembentukan kunci publik dan kunci privat, algoritma pembuatan tanda tangan, serta algoritma verifikasi tanda tangan.Kata Kunci: tanda tangan digital, skema tanda tangan Schnorr, nilai hash, kunci publik, kunci privat. Implementation of Schnorr Signature Scheme in The Form of  Digital Signature AbstractDigital signature can be used as a way to ensure the authenticity of a received message or information. There is a scheme that can be used to form a signature called Schnorr signature scheme. This signature scheme is based on discrete logarithm problem. This scheme requires the use of hash function that will result to a message digest to form the signature, which is the reason of this scheme’s security. Schnorr signature scheme consists of three processes, namely: the key generation, signature formation, and verification. This study will discuss the Schnorr signature scheme in the form of digital signatures as a safeguard of an information’s authenticity, which is discussed process by process, including: the key generation, signature formation as well as the calculation of message digest and verification. The results of this study obtained algorithms - algorithms of Schnorr signature scheme, which is an algorithm of a public key and a private key generation, an algorithm of the signature formation, and an algorithm of signature verification.Keywords: digital signature, Schnorr signature scheme, message digest, public key, privat key

A Proxy Signature Based on the Difficulty of Solving Equations of Higher on Quaternion Ring

2014 ◽  
Vol 513-517 ◽  
pp. 1951-1954
Author(s):  
Hui Shao ◽  
Fan Zhang ◽  
Xiao Zhuan Yuan ◽  
Chuan Da Qi
Keyword(s):  
Digital Signature ◽  
Discrete Logarithm ◽  
Proxy Signature ◽  
Discrete Logarithm Problem ◽  
Signature Scheme ◽  
Multivariate Functions ◽  
Actual Application ◽  
Solving Equations ◽  
Computational Difficulty ◽  
High Degree

At present, all the applied schemes of the digital signature schemes based on the research of the factoring problem, discrete logarithm problem, and discrete logarithm problem on the elliptic curve cant meet the demand of actual application. This paper introduces the knowledge to the digital signature and studies the signature scheme based on the quaternion ring. The scheme introduces the multivariate functions of high degree to non-commutative quaternion ring, and its safety based on the computational difficulty to solve the the multivariate equations of high degree. The article applies this thought to proxy signature and designs a proxy signature scheme. Finally, it gives the safety analysis of the new scheme.

A Novel RFID Anti-Counterfeiting Based on Bisectional Multivariate Quadratic Equations

2018 ◽  
Vol 6 (2) ◽  
pp. 1-9
Author(s):  
Xiaoyi Zhou ◽  
Jixin Ma ◽  
Xiaoming Yao ◽  
Honglei Li
Keyword(s):  
Finite Field ◽  
Data Encryption ◽  
Public Key ◽  
Generation Process ◽  
Key Generation ◽  
Quadratic Equations ◽  
Private Key ◽  
Message Digest ◽  
The One ◽  
N Vector

This article proposes a novel scheme for RFID anti-counterfeiting by applying bisectional multivariate quadratic equations (BMQE) system into an RF tag data encryption. In the key generation process, arbitrarily choose two matrix sets (denoted as A and B) and a base RAB such that [(AB) ⃗ ]=λ〖R_AB〗^T, and generate 2n BMQ polynomials (denoted as ρ) over finite field F_q. Therefore, (F_q, ρ) is taken as a public key and (A,B,λ) as a private key. In the encryption process, the EPC code is hashed into a message digest d_m. Then d_m is padded to d_m^' which is a non-zero 2n×2n matrix over F_q. With (A,B,λ)and d_m^', s_m is formed as an n-vector over F_2. Unlike the existing anti-counterfeit scheme, the one the authors proposed is based on quantum cryptography, thus it is robust enough to resist the existing attacks and has high security.

Structure and Analysis of Certificateless Proxy Blind Signature Scheme without Bilinear Pairing

2013 ◽  
Vol 734-737 ◽  
pp. 3194-3198
Author(s):  
Yi Wang
Keyword(s):  
Finite Field ◽  
Discrete Logarithm ◽  
Public Key Cryptography ◽  
Bilinear Pairing ◽  
Blind Signature ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Signature Scheme ◽  
Proxy Blind Signature ◽  
Certificateless Public Key Cryptography

Combined with certificateless public key cryptography and proxy blind signature, an efficient certificateless proxy blind signature scheme is proposed. Its security is based on the discrete logarithm problem. Compared with the existed certificateless proxy blind signature scheme, because without bilinear pairing, it have higher efficiency. According to the different attacker and all kinds of attacks, the scheme is proved to be correct and security under the hardness of discrete logarithm problem in the finite field.

Improvement of a Structured Multi-Signature Scheme

2010 ◽  
Vol 439-440 ◽  
pp. 401-406
Author(s):  
Jun Zhang
Keyword(s):  
Discrete Logarithm ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Signature Scheme ◽  
Forgery Attack ◽  
Signature Schemes ◽  
Insider Attack ◽  
Public Keys

Structured multi-signatures is a special multi-signature which multiple signer can sign the same message and it provided co-signers with different position have different authorization capability. There are lots of structured multi-signature schemes such as Harn’s scheme and Burmester’s scheme, etc. Though Harn’s scheme was relatively safer, yet this scheme was not safety enough because it was very easily aggressed by the forgery attack. This paper shows the scheme can not resist the forgery attack. Then the paper proposed a new structure multi-signature scheme based on the difficulty of the discrete logarithm problem with verifying signature parameter and signers’ public keys. By verifying public-key, the new scheme can resist lots of outsider attack and insider attack. The validity of the new scheme can be verified, and it is a secure structured multi-signature scheme.

scholarly journals A post-quantum digital signature scheme on groups with four-dimensional cyclicity

2021 ◽  
pp. 43-51
Author(s):  
Nikolay Moldovyan ◽  
Dmitry Moldovyan
Keyword(s):  
Digital Signature ◽  
Discrete Logarithm ◽  
Quantum Signature ◽  
Discrete Logarithm Problem ◽  
Public Key ◽  
Associative Algebras ◽  
Signature Schemes ◽  
Public Keys ◽  
Digital Signature Scheme ◽  
Quantum Digital Signature

Introduction: Development of practical post-quantum signature schemes is a current challenge in the applied cryptography. Recently, several different forms of the hidden discrete logarithm problem were proposed as primitive signature schemes resistant to quantum attacks. Purpose: Development of a new form of the hidden discrete logarithm problem set in finite commutative groups possessing multi-dimensional cyclicity, and a method for designing post-quantum signature schemes. Results: A new form of the hidden discrete logarithm problem is introduced as the base primitive of practical post-quantum digital signature algorithms. Two new four-dimensional finite commutative associative algebras have been proposed as algebraic support for the introduced computationally complex problem. A method for designing signature schemes on the base of the latter problem is developed. The method consists in using a doubled public key and two similar equations for the verification of the same signature. To generate a pair of public keys, two secret minimum generator systems <G, Q> and <H, V> of two different finite groups G<G, Q> and G<H, V> possessing two-dimensional cyclicity are selected at random. The first public key (Y, Z, U) is computed as follows: Y = Gy1Qy2a, Z = Gz1Qz2b, U = Gu1Qu2g, where the set of integers (y1, y2, a, z1, z2, b, u1, u2, g) is a private key. The second public key (Y¢, Z¢, U¢) is computed as follows: Y¢ = Hy1Vy2a, Z¢ = Hz1Vz2b, U¢ = Hu1Vu2g. Using the same parameters to calculate the corresponding elements belonging to different public keys makes it possible to calculate a single signature which satisfies two similar verification equations specified in different finite commutative associative algebras. Practical relevance: Due to a smaller size of the public key, private key and signature, as well as approximately equal performance as compared to the known analogues, the proposed digital signature scheme can be used in the development of post-quantum signature algorithms.

scholarly journals A New Method for Designing Post-Quantum Signature Schemes

2020 ◽  
pp. 747-754
Author(s):  
Minh Nguyen Hieu ◽  
◽  
Moldovyan Alexander Andreevich ◽  
Moldovyan Nikolay Andreevich ◽  
Canh Hoang Ngoc
Keyword(s):  
Digital Signature ◽  
Quantum Computer ◽  
Multiplicative Group ◽  
Discrete Logarithm ◽  
Quantum Signature ◽  
Discrete Logarithm Problem ◽  
New Method ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Computational Difficulty

The current standards of the digital signature algorithms are based on computational difficulty of the discrete logarithm and factorization problems. Expected appearance in near future of the quantum computer that is able to solve in polynomial time each of the said computational puts forward the actual task of the development of the post-quantum signature algorithms that resist the attacks using the quantum computers. Recently, the signature schemes based on the hidden discrete logarithm problem set in finite non-commutative associative algebras had been proposed. The paper is devoted to a further development of this approach and introduces a new practical post-quantum signature scheme possessing small size of public key and signature. The main contribution of the paper is the developed new method for defining the hidden discrete logarithm problem that allows applying the finite commutative groups as algebraic support of the post-quantum digital signature schemes. The method uses idea of applying multipliers that mask the periodicity connected with the value of discrete logarithm of periodic functions set on the base of the public parameters of the signature scheme. The finite 4-dimensional commutative associative algebra the multiplicative group of which possesses 4-dimensional cyclicity is used as algebraic support of the developed signature scheme.

scholarly journals An Overview of Blockchain Technology

2018 ◽  
Vol 4 (4) ◽  
pp. 1
Author(s):  
Karthik C
Keyword(s):  
Digital Signature ◽  
Hash Function ◽  
Emerging Technology ◽  
Consensus Algorithm ◽  
Public Key ◽  
Private Key ◽  
Linked List ◽  
Blockchain Technology ◽  
Distributed Ledger ◽  
A Chain

Blockchain Technology is an emerging technology nowadays. The Blockchain was first used as a Peer-to-Peer ledger for registering Bitcoin transactions. The blockchain is a singly linked list which consists of a number of transactions. The blockchain is a decentralized distributed ledger which consists of a number of blocks organized in the form of a chain. A block in blockchain consists of two parts data and hash pointer. The first block in the blockchain is known as genesis block. The transactions and data in the block are secured by cryptography. The data inside a block in blockchain can be anything like bank transactions, backup data etc., which are recorded chronologically and publicly. The Hash pointer of a block is a unique code generated by a hash function like SHA256, SHA-3 etc., the hash function used in bitcoin blockchain. A block consists of a public key and a private key, using hash function digital signature is generated to the block. This is how the data inside the blockchain is so secured. The blocks are added into the blockchain by verifying the transaction in the block, the transactions are verified by miners. The miners use consensus algorithm to solve the blocks.

Sign in / Sign up

Export Citation Format

Share Document