이산 로그
둘러보기로 가기
검색하러 가기
노트
위키데이터
- ID : Q864003
말뭉치
- The discrete logarithm to the base g of h in the group G is defined to be x .[1]
- However, if p−1 is a product of small primes, then the Pohlig–Hellman algorithm can solve the discrete logarithm problem in this group very efficiently.[1]
- That's why we always want p to be a safe prime when using Z p * as the basis of discrete logarithm based crypto-systems.[1]
- This guarantees that p-1 = 2q has a large prime factor so that the Pohlig–Hellman algorithm cannot solve the discrete logarithm problem easily.[1]
- Other base-10 logarithms in the real numbers are not instances of the discrete logarithm problem, because they involve non-integer exponents.[2]
- Can the discrete logarithm be computed in polynomial time on a classical computer?[2]
- The discrete logarithm problem is considered to be computationally intractable.[2]
- In designing public-key cryptosystems, two problems dominate the designs: the integer factorization problem and the discrete logarithm problem.[3]
- In the next part of the chapter, we will take a look at the discrete logarithm problem and discuss its application to cryptography.[3]
- This is called the discrete logarithm problem.[4]
- I was reading an answer about an attack on a weak group for the discrete logarithm problem and wanted to formalize and verify that the attack was correct.[5]
- We study the elliptic curve discrete logarithm problem over finite extension fields.[6]
- We continue our study on the elliptic curve discrete logarithm problem over finite extension fields.[7]
- Crypto-schemes where the Discrete Logarithm problem is hard are known as ElGamal crypto-schemes.[8]
- The hardness of the discrete logarithm problem (DLP) in cyclic groups has been one of the key mathematical problems underlying many public key cryptosystems in use today.[9]
- Apart from the above mentioned links to efficient attacks on the elliptic curve discrete logarithm problem, this problem is an interesting mathematical problem in its own right.[9]
소스
- ↑ 1.0 1.1 1.2 1.3 Discrete Logarithm Problem
- ↑ 2.0 2.1 2.2 Discrete logarithm
- ↑ 3.0 3.1 Discrete Logarithms - an overview
- ↑ The discrete logarithm problem (video)
- ↑ Solving the discrete logarithm problem for a weak group
- ↑ On the discrete logarithm problem in elliptic curves
- ↑ Diem : On the discrete logarithm problem in elliptic curves II
- ↑ Towards Zero Knowledge Proof — 0x01 — The Discrete Logarithm problem: A constructive approach
- ↑ 9.0 9.1 Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem
메타데이터
위키데이터
- ID : Q864003
Spacy 패턴 목록
- [{'LOWER': 'discrete'}, {'LEMMA': 'logarithm'}]