[PDF] Top 20 On the discrete logarithm problem in finite fields of fixed characteristic
Has 10000 "On the discrete logarithm problem in finite fields of fixed characteristic" found on our website. Below are the top 20 most common "On the discrete logarithm problem in finite fields of fixed characteristic".
On the discrete logarithm problem in finite fields of fixed characteristic
... generally fixed characteristic) fields of a certain form, relation generation for degree one elements runs in heuristic polynomial time, as does computing the logarithms of degree two elements using ... See full document
20
PERFORMANCE OF COOPERATIVE COMMUNICATION SYSTEM WITH NETWORK CODING USING SOFTWARE DEFINED RADIO
... over finite fields deliver an inexhaustible source of finite abelian groups [6], which (even if they are large) are convenient for computation and have a rich structure ...curve discrete ... See full document
7
A New Index Calculus Algorithm for the Elliptic Curve Discrete Logarithm Problem and Summation Polynomial Evaluation
... order fields seems to be much harder to ...order fields, although they are valid for any finite ...in Finite Fields and their Applications has shown how to simplify these algorithms to ... See full document
21
On Generating Coset Representatives of PGL_2(\F_q) in PGL_2(\F_{q^2})
... The discrete logarithm problem (DLP) over finite fields underpins the security of many cryptographic ...the characteristic is small [18, 15, 5, 16, 6, 17, 7, 19, 10, 9, 8, 3, 4, ... See full document
11
New algorithm for the discrete logarithm problem on elliptic curves
... 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 ... See full document
17
On Discrete Logarithm Problem based on Algebraic Varieties over Finite Field and Public Key Cryptosystem
... over finite fields which combine quite efficiently the cohomological methods (black-box) and some results and techniques of logic to give estimates where the product set in the finite field is much ... See full document
8
A new perspective on the powers of two descent for discrete logarithms in finite fields
... It was originally proven in [GKZ18] when q > 61, q is not a power of 4, and d ≥ 18. Even though we eliminate these technical conditions, the main contribution is the new approach to the proof. The theorem represents ... See full document
9
An Efficient ID based Proxy Signcryption Scheme without Bilinear Pairings
... the discrete logarithm problem over finite ...Curve Discrete Logarithm Problem (ECDLP) with a reduced computational complexity compared to other schemes in ... See full document
6
Traps to the BGJT-Algorithm for Discrete Logarithms
... The discrete logarithm problem over finite fields is one of the most important candidates, besides the integer factorization ...of discrete logarithms underpins the security of ... See full document
16
Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields
... given in (4). Assuming that both g 1 and g 2 are not equal to v + w then all three values (g 1 , g 2 , g 3 ) are well-defined. With this specific choice, the right-hand side that now appear in Equation (5) or (6) gains a ... See full document
21
A New Signature Scheme Define over a Class of Non-Abelian Group
... set problem in dihedral groups, and then we setup a linkage for showing that the exhaustion number search problem is computationally equivalent to subset sum ... See full document
8
On the Initial Subalgebra of a Graded Lie Algebra
... simple finite-dimensional Lie algebras over fields of prime characteristic, irreducible transitive finite dimensional graded Lie algebras play a fundamental role ...simple finite ... See full document
6
Tight Reductions for Diffie-Hellman Variants in the Algebraic Group Model
... [EHK + 17] Alex Escala, Gottfried Herold, Eike Kiltz, Carla R` afols, and Jorge Luis Villar. An algebraic framework for Diffie-Hellman assumptions. J. Cryptology, 30(1):242–288, 2017. [FKL18] Georg Fuchsbauer, Eike Kiltz, ... See full document
31
ABSTRACT : In this paper we purposed an image based cryptography that Elliptic Curve cryptography (ECC)
... The word cryptography is derived from the Greek words Crypto meaning cover and grafia meaning writing defining it as covered writing. In image cryptography the information is hidden exclusively in images. Cryptography is ... See full document
5
A Digital Signature Scheme for Long-Term Security
... In this paper we defined a signature system based on two difficult arithmetic prob- lems. In the framework chosen, these problems have similar resistance to known attacks. We explained how to implement in practice all ... See full document
10
An Encryption and Decryption More Secure Elgamal Cryptosystem
... In our system we overcome the problem that arises in the previous system and it has also less time complexity and it is more powerful than the existing system. In our system we enforce Chinese Remainder Theorem ... See full document
9
On Algebraic Immunity of Trace Inverse Functions over Finite Fields with Characteristic Two
... important multi-output Boolean function, which is first intro- duced by K. Nyberg [3]. The inverse function x −1 possesses many good cryptographic properties, including permutation, high algebraic degree, high ... See full document
8
A Moment Problem for Discrete Nonpositive Measures on a Finite Interval
... the problem of interpolation by means of shape- preserving algorithms A, which have some properties of shape-preserving projections ...certain finite-dimensional ... See full document
9
A Digital Signature Scheme Based on Pell Equation
... normal discrete logarithm problem (DLP) and the integer factorization problem (IFP), the elliptic curve discrete logarithm problem (ECDLP) has no sub exponential-time ... See full document
5
Discrete Logarithm in Galois Rings
... In this paper, it is explained how one can use Galois rings to perform ElGamal encryption through the concept of the discrete logarithm and the generators. That encryption is based on the Diffie-Hellman key ... See full document
12
Related subjects