scholarly journals Ephemeral Keys Authenticated with Merkle Trees and Their Use in IoT Applications

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 2036
Author(s):  
Pavol Zajac
Keyword(s):  
Quantum Signature ◽  
Public Key ◽  
Parity Check ◽  
Signature Schemes ◽  
Iot Applications ◽  
Low Density Parity Check ◽  
Public Keys ◽  
Parity Check Codes ◽  
Handshake Protocols ◽  
Large Signature

Public key algorithms based on quasi-cyclic binary moderate-density parity-check codes (QC-MDPCs) and QC low-density parity-check codes (QC-LDPCs) codes for key encapsulation and encryption submitted to the NIST post-quantum competition (Bit Flipping Key Encapsulation (BIKE), QC-MDPC KEM, LEDA) are vulnerable against reaction attacks based on decoding failures. To protect algorithms, authors propose to limit the key usage, in the extreme (BIKE) to only use ephemeral public keys. In some authenticated protocols, we need to combine each key with a signature, which can lead to increased traffic overhead, especially given the large signature sizes of some of the proposed post-quantum signature schemes. We propose to combine ephemeral public keys with a simple Merkle tree to obtain a server authenticated key encapsulation/transport suitable for TLS-like handshake protocols. This allows a very simple public key verification on the client, leading to efficient protocols suitable for Internet of Things applications.

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.

New rapid algorithm for detecting girth of low-density Parity-check codes

2013 ◽  
Vol 32 (11) ◽  
pp. 3100-3101
Author(s):  
Jiong-cheng LI ◽  
Gui-yu LI ◽  
Heng-hui XIAO ◽  
Hai-yi HUANG
Keyword(s):  
Low Density ◽  
Parity Check ◽  
Low Density Parity Check ◽  
Parity Check Codes

scholarly journals Design of Short, High-Rate DVB-S2-Like Semi-Regular LDPC Codes

2008 ◽  
Vol 2008 ◽  
pp. 1-4
Author(s):  
Luca Barletta ◽  
Arnaldo Spalvieri
Keyword(s):  
Coded Modulation ◽  
High Rate ◽  
Parity Check ◽  
Code Length ◽  
Carrier Recovery ◽  
Low Density Parity Check ◽  
Novel Approach ◽  
Parity Check Codes ◽  
Moderate Length

This work focuses on high-rate () moderate-length () low-density parity-check codes. High-rate codes allow to maintain good quality of the preliminary decisions that are used in carrier recovery, while a moderate code length allows to keep the latency low. The interleaver of the LDPC matrix that we consider is inspired to the DVB-S2 standard one. A novel approach for avoiding short cycles is analyzed. A modified BP decoding algorithm is applied in order to deal with longer cycles. Simulations and results for the AWGN channel are presented, both for BPSK signalling and for coded modulation based on the partition .

Sign in / Sign up

Export Citation Format

Share Document