Results 31 to 40 of about 7,844 (165)

Comparative Study of Digital Signature Standards Based on Discrete Logarithm [PDF]

open access: yesJisuanji gongcheng, 2016
As Chinese state encryption administration is seeking the next generation of Digital Signature Standard(DSS),this paper analyzes and compares seven DSS listed in ISO/IEC 14888-3 and SM2 which are based on Discrete Logarithm Problem(DLP) or Elliptic Curve
FENG Zeyu,GONG Boru,ZHAO Yunlei
doaj   +1 more source

The discrete logarithmic Minkowski problem

open access: yes, 2014
Existence of solution of the logarithmic Minkowski problem is proved for the case where the discrete measures on the unit sphere satisfy the subspace concentration condition with respect to some special proper subspaces. In order to understand how optimal this condition is, we discuss certain conditions that any cone volume measure satisfies.
Boroczky, Karoly J.   +2 more
openaire   +2 more sources

Selectively Linkable and Convertible Ring Signature Scheme Based on DLP [PDF]

open access: yesJisuanji gongcheng, 2019
Most of the existing linkable and convertible ring signature schemes do not have strong anonymity.To solve this problem,a ring signature scheme based on Discrete Logarithm Problem(DLP) is proposed.The actual signer establishes an association tag by ...
CAO Suzhen,SUN Han,DAI Wenjie,WANG Xiuya
doaj   +1 more source

A NEW PROPOSED METHOD FOR SOLVING AN ELLIPTIC CURVE DISCRETE LOGARITHM PROBLEM

open access: yesJournal of Kufa for Mathematics and Computer, 2012
In this work, we present a new approach for solving Elliptic Curve Discrete Logarithm Problem. This method provides a new access to the field of attacking methods the Elliptic Curve Cryptosystems.
Ammar Ali Neamah
doaj   +1 more source

Security of the cryptosystems based on ergodic matrices

open access: yesTongxin xuebao, 2015
The security of the public-key cryptosystems based on ergodicmatrices over finite field was analysed.According to the public key,a system of linear equations for the forged secret key bits is obtained by inverse matrix elimination method.It is proved ...
Hua-wei HUANG   +3 more
doaj   +2 more sources

Post-quantum signature algorithms based on the hidden discrete logarithm problem [PDF]

open access: yesComputer Science Journal of Moldova, 2018
New options of the hidden discrete logarithm problem are proposed as cryptographic primitive of the post-quantum signature algorithms. Two signature schemes using computations in finite non-commutative algebras with associative multiplication operation
A.A. Moldovyan, N.A. Moldovyan
doaj  

Developed Protocol for Key Exchange Based on Irreducible Polynomial [PDF]

open access: yesمجلة جامعة الانبار للعلوم الصرفة, 2012
The Aim of this paper is to design a protocol for key exchanging to work on the available computers for different data security application. This paper proposed idea to modify the Diffie-Hellman key exchange by using truncated polynomial instead of ...
Abdul Monem S. Rahma   +2 more
doaj   +1 more source

Digital signature scheme with doubled verification equation [PDF]

open access: yesComputer Science Journal of Moldova, 2020
A novel design of the signature schemes based on the hidden discrete logarithm problem is proposed, which is characterized in using special criterion oriented to providing security to potential quantum attacks.
D.N. Moldovyan   +2 more
doaj  

Post-quantum public key-agreement scheme based on a new form of the hidden logarithm problem [PDF]

open access: yesComputer Science Journal of Moldova, 2019
A new form of the hidden discrete logarithm problem, proposed as primitive of the post-quantum public-key cryptoschemes, is defined over the 6-dimensional finite non-commutative associative algebra with a large set of the left-sided global units.
D.N. Moldovyan
doaj  

On the discrete logarithm problem for plane curves [PDF]

open access: yesJournal de théorie des nombres de Bordeaux, 2012
In this article the discrete logarithm problem in degree 0 class groups of curves over finite fields given by plane models is studied. It is proven that the discrete logarithm problem for non-hyperelliptic curves of genus 3 (given by plane models of degree 4) can be solved in an expected time of O ˜(q), where q is the cardinality of the ground field ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy