搜索结果: 1-15 共查到“军事学 Discrete Logarithm Problem”相关记录27条 . 查询时间(0.046 秒)
A New Method for Geometric Interpretation of Elliptic Curve Discrete Logarithm Problem
Intersection of Curves Grobner Basis Vanishing Ideals
2019/9/19
In this paper, we intend to study the geometric meaning of the discrete logarithm problem defined over an Elliptic Curve. The key idea is to reduce the Elliptic Curve Discrete Logarithm Problem (EC-DL...
A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem
public-key cryptography algorithm depends
2018/2/8
In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points of an elliptic curve an...
The Discrete-Logarithm Problem with Preprocessing
discrete logarithm problem generic-group model
2017/11/21
This paper studies discrete-log algorithms that use preprocessing. In our model, an adversary may use a very large amount of precomputation to produce an "advice" string about a specific group (e.g., ...
A Quantum “Magic Box'' for the Discrete Logarithm Problem
discrete logarithm problem elliptic curve cryptosystem quantum cryptanalysis
2017/8/10
In their foundational paper on pseudorandom bit generation, Blum and Micali showed that the discrete logarithm problem could be solved efficiently given a ``magic box'' oracle that computes the most s...
On the discrete logarithm problem for prime-field elliptic curves
elliptic curve discrete logarithm problem prime field
2017/6/27
In recent years several papers have appeared investigating the classical discrete logarithm problem for elliptic curves by means of the multivariate polynomial approach based on the celebrated summati...
FHPKE based on multivariate discrete logarithm problem
fully homomorphic public-key encryption multivariate discrete logarithm problem octonion ring
2017/5/23
Previously I proposed fully homomorphic public-key encryption (FHPKE) based on discrete logarithm problem which is vulnerable to quantum computer attacks. In this paper I propose FHPKE based on multiv...
The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives
non-canonical lifts logarithmic derivatives
2017/3/6
The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives.
Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem
Isogeny expander graph hyperelliptic curve cryptography
2017/2/20
Fix an ordinary abelian variety defined over a finite field. The ideal class group of its endomorphism ring acts freely on the set of isogenous varieties with same endomorphism ring, by complex multip...
The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem
Discrete logarithm Hensel lift Multivaraible Chinese Remainder theorem
2016/12/10
The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem.
Improving NFS for the discrete logarithm problem in non-prime finite fields
Discrete logarithm computation NFS
2016/6/12
The aim of this work is to investigate the hardness of the discrete logarithm problem in fields GF(pn) where n is a small integer greater than 1. Though less studied than the small characteristic case...
Fully Homomorphic Public-key Encryption Based on Discrete Logarithm Problem
fully homomorphic public-key encryption discrete logarithm problem octonion ring
2016/1/27
In this paper I propose the new fully homomorphic public-key
encryption scheme without bootstrapping that is based on the discrete
logarithm assumption and computational Diffie–Hellman assumption of...
Generic Hardness of the Multiple Discrete Logarithm Problem
multiple discrete logarithm search-by-hyperplane-queries generic group model
2016/1/7
We study generic hardness of the multiple discrete logarithm problem, where the
solver has to solve n instances of the discrete logarithm problem simultaneously. There are
known generic algorithms w...
Some experiments investigating a possible L(1/4) algorithm for the discrete logarithm problem in algebraic curves
discrete logarithm problem index calculus algebraic curves
2016/1/5
The function field sieve, a subexponential algorithm of complexity L(1/3) that
computes discrete logarithms in finite fields, has recently been improved to an algorithm of
complexity L(1/4) and subs...
New algorithm for the discrete logarithm problem on elliptic curves
finite fields elliptic curves Gr¨obner basis algorithms
2015/12/31
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic c...
On the discrete logarithm problem in finite fields of fixed characteristic
discrete logarithm problem finite fields quasi-polynomial time algorithm
2015/12/29
For q a prime power, the discrete logarithm problem (DLP) in F×q consists in finding, for any g∈F×q and h∈⟨g⟩, an integer x such that gx=h. For each prime p we exhibit infinitely many ex...