A signature scheme from the finite field isomorphism problem
نویسندگان
چکیده
منابع مشابه
Fully Homomorphic Encryption from the Finite Field Isomorphism Problem
If q is a prime and n is a positive integer then any two finite fields of order q are isomorphic. Elements of these fields can be thought of as polynomials with coefficients chosen modulo q, and a notion of length can be associated to these polynomials. A non-trivial isomorphism between the fields, in general, does not preserve this length, and a short element in one field will usually have an ...
متن کاملAn efficient blind signature scheme based on the elliptic curve discrete logarithm problem
Elliptic Curve Cryptosystems (ECC) have recently received significant attention by researchers due to their high performance such as low computational cost and small key size. In this paper a novel untraceable blind signature scheme is presented. Since the security of proposed method is based on difficulty of solving discrete logarithm over an elliptic curve, performance of the proposed scheme ...
متن کاملFast exponentiation via prime finite field isomorphism
lard and Schnorr algorithm. Farther factorization of prime quadratic integer π = ρρ in the ring 4 [ 2] ± can be done similarly. Finite field r is represented as quotient ring 4 [ 2] /( ) ± ρ . Integer exponent k is reduced in corresponding quotient ring by minimization of absolute value of its norm. Algorithms can be used for fast exponentiation in arbitrary cyclic group if its order can b...
متن کاملA Signature Scheme as Secure as the Diffie-Hellman Problem
We show a signature scheme whose security is tightly related to the Computational Diffie-Hellman (CDH) assumption in the Random Oracle Model. Existing discrete-log based signature schemes, such as ElGamal, DSS, and Schnorr signatures, either require non-standard assumptions, or their security is only loosely related to the discrete logarithm (DL) assumption using Pointcheval and Stern’s “forkin...
متن کاملThe Finite Field Kakeya Problem
A Besicovitch set in AG(n, q) is a set of points containing a line in every direction. The Kakeya problem is to determine the minimal size of such a set. We solve the Kakeya problem in the plane, and substantially improve the known bounds for n > 4.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2020
ISSN: 1862-2984,1862-2976
DOI: 10.1515/jmc-2015-0050