But even when this is true from a mathematical point of view, side channel attacks could be used to reveal information about the key.In this thesis, we study the difficulty of the discrete logarithm problem when
Breaking an ID-based encryption based on discrete logarithm and factorization problemsCryptographyCryptanalysisID-based encryptionDiscrete logarithm problemFactorization problemIdentity-based (ID-based) cryptography is very useful as it can simplify the certificate management in public key cryptosystem. Since ...
K. S. McCurley, The discrete logarithm problem,Cryptography and Computational Number Theory(C. Pomerance, ed.), Proc. Symp. Appl. Math., Amer. Math. Soc., 42 (1990) pp. 49–74. E. Manstavicius, Semigroup elements free of large prime factors,New Trends in Probability and Statistics, ...
K.S. McCurley, The discrete logarithm problem, Cryptography and Computational Number Theory, (C.Pomerance, ed.), vol. 42, Proc.Symp. Appl. Math., Amer. Math. Soc., 1990, pp. 49-74.McCurley K S. The Discrete Logarithm Problem[A].New York:AMS Press,1990.49-74....
From the introduction: The discrete logarithm problem in finite groups is one of the supposedly difficult problems at the foundation of asymmetric or public key cryptography. The first cryptosystems based on discrete logarithms were implemented in the multiplicative groups of finite fields, in which ...
The discrete logarithm problem (DLP) in a groupGis to find the integernsuch thatgn=hholds giveng,h∈G. As one of the most important mathematical primitives in modern cryptography, there are some classic algorithms to solve it, such as the Pollard’s rho method, the index calculus method,...
In any finite field F q , the discrete logarithm problem can be solved with the index calculus algorithm in time L q ( 1 2 , c). For prime fields and fields of fixed characteristic, it is possible to choose c = √ 2. Rem. This is much better than for a generic grou...
1.Public-Key Cryptography Based on Elliptic Curve Discrete Logarithm Problem;基于椭圆曲线离散对数问题的公钥密码 2.Both of their security are based on the intractability of elliptic curve discrete logarithm problem.两种方案的安全性都是基于椭圆曲线离散对数问题的难解性。 3.Based on the elliptic curve ...
Identification Protocols based on Discrete Log Representation Problem ☆Identification ProtocolsDiscrete Log RepresentationBilinear PairingMultilinearIdentification protocols are powerful tools in many areas of cryptography. A prover's identity (ID) has n distinct secrets which in total construct her identity. ...
The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences Kristin Lauter, Katherine Stange Selected Areas in Cryptography 2008|January 2008 Published by Springer Verlag Download BibTex We define three hard p...