Multi-message and Multi-receiver Hybrid Signcryption Scheme Based on Discrete Logarithm [PDF]
Jisuanji gongcheng, 2016 Existing multi-receiver signcryption schemes exist some security problems.For example,multi-message can not be broadcast simultaneously and the receivers do not have fairness in decryption.In order to avoid those problems,this paper proposes a multi ...
WANG Caifen,JIANG Hong,YANG Xiaodong,ZHANG Yulei,NIU Shufen
doaj +1 more source
The ElGamal cryptosystem over circulant matrices [PDF]
, 2011 In this paper we study extensively the discrete logarithm problem in the group of non-singular circulant matrices. The emphasis of this study was to find the exact parameters for the group of circulant matrices for a secure implementation.
Mahalanobis, Ayan
core +3 more sources
Asymmetric cipher protocol using conjugacy and discrete logarithm problem
Lietuvos Matematikos Rinkinys, 2009 The paper proposes asymmetric cipher protocol based on matrix field over some field F. The asymmetric cipher is based on two simultaneous problems: matrix conjugator search problem (MCSP) and matrix discrete logarithm problem (MDLP).
Andrius Raulynaitis +1 more
doaj +1 more source
Shor's Algorithm Using Efficient Approximate Quantum Fourier Transform
IEEE Transactions on Quantum Engineering, 2023 Shor's algorithm solves the integer factoring and discrete logarithm problems in polynomial time. Therefore, the evaluation of Shor's algorithm is essential for evaluating the security of currently used public-key cryptosystems because the ...
Kento Oonishi, Noboru Kunihiro
doaj +1 more source
Counting Fixed Points, Two-Cycles, and Collisions of the Discrete Exponential Function using p-adic Methods [PDF]
, 2011 Brizolis asked for which primes p greater than 3 does there exist a pair (g, h) such that h is a fixed point of the discrete exponential map with base g, or equivalently h is a fixed point of the discrete logarithm with base g.
Bourbaki +9 more
core +1 more source
Digital signature scheme with doubled verification equation [PDF]
Computer 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
The Discrete Logarithm Problem [PDF]
, 2016 For large prime numbers p, computing discrete logarithms of elements of the multiplicative group (Z∕pZ)∗ is at present a very difficult problem. The security of certain cryptosystems is based on the difficulty of this computation. In this expository paper we discuss several generalizations of the discrete logarithm problem and we describe various ...
openaire +2 more sources
The formal solutions of Diophantine equation agy = bx + c
HeliyonWe develop a novel method to completely solve the 3-term partial exponential Diophantine equation that represents a generalization of the standard discrete logarithm problem.
Xiazhou Yang
doaj +1 more source
Security analysis of elliptic curves with embedding degree 1 proposed in PLOS ONE 2016.
PLoS ONE, 2019 Wang et al. proposed a method for obtaining elliptic curves with embedding degree 1 for securing critical infrastructures, and presented several elliptic curves generated by their method with torsion points of 160 bits and 189 bits orders.
Tadanori Teruya
doaj +1 more source
Algorithm of the electronic sign-code signature on the basis of the composition of existing complexities [PDF]
E3S Web of ConferencesThe article developed a new algorithm for electronic digital signature in the composition of existing difficulties: discrete logarithm in a finite field, addition of points with rational coordinates of the elliptic curve.
Akbarov Davlatali +5 more
doaj +1 more source