scholarly journals ELEMENTS OF HIGH ORDER ON FINITE FIELDS FROM ELLIPTIC CURVES

2010 ◽  
Vol 81 (3) ◽  
pp. 425-429 ◽  
Author(s):  
JOSÉ FELIPE VOLOCH
Keyword(s):  
Elliptic Curves ◽  
Finite Fields ◽  
Rational Functions ◽  
Large Degree ◽  
High Order ◽  
Prime Field ◽  
Nontrivial Estimate ◽  
Special Cases

AbstractWe discuss the problem of constructing elements of multiplicative high order in finite fields of large degree over their prime field. We obtain such elements by evaluating rational functions on elliptic curves, at points whose order is small with respect to their degree. We discuss several special cases, including an old construction of Wiedemann, giving the first nontrivial estimate for the order of the elements in this construction.

scholarly journals Some remarks on the number of points on elliptic curves over finite prime field

2007 ◽  
Vol 75 (1) ◽  
pp. 135-149 ◽  
Author(s):  
Saiying He ◽  
J. McLaughlin
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Quadratic Forms ◽  
Exponential Sums ◽  
Binary Quadratic Forms ◽  
Prime Field ◽  
Trace Of Frobenius ◽  
Finite Prime Field ◽  
Congruence Classes

Let p ≥ 5 be a prime and for a, b ε p, let Ea, b denote the elliptic curve over p with equation y2 = x3 + ax + b. As usual define the trace of Frobenius ap, a, b by We use elementary facts about exponential sums and known results about binary quadratic forms over finite fields to evaluate the sums and for primes p in various congruence classes.As an example of our results, we prove the following: Let p ≡ 5 (mod 6) be prime and let b ε *p. Then

Distance functions on the sets of ordinary elliptic curves in short Weierstrass form over finite fields of characteristic three

2018 ◽  
Vol 68 (4) ◽  
pp. 749-766
Author(s):  
Keisuke Hakuta
Keyword(s):  
Finite Field ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Analogous Result ◽  
Distance Functions ◽  
Prime Field ◽  
Supersingular Elliptic Curves ◽  
Characteristic Two

Abstract We study distance functions on the set of ordinary (or non-supersingular) elliptic curves in short Weierstrass form (or simplified Weierstrass form) over a finite field of characteristic three. Mishra and Gupta (2008) firstly construct distance functions on the set of elliptic curves in short Weierstrass form over any prime field of characteristic greater than three. Afterward, Vetro (2011) constructs some other distance functions on the set of elliptic curves in short Weierstrass form over any prime field of characteristic greater than three. Recently, Hakuta (2015) has proposed distance functions on the set of ordinary elliptic curves in short Weierstrass form over any finite field of characteristic two. However, to our knowledge, no analogous result is known in the characteristic three case. In this paper, we shall prove that one can construct distance functions on the set of ordinary elliptic curves in short Weierstrass form over any finite field of characteristic three. A cryptographic application of our distance functions is also discussed.

PERSPECTIVES OF ELLIPTICAL CRYPTOGRAPHY TO ENSURE THE INTEGRITY AND CONFIDENTIALITY OF INFORMATION

2019 ◽  
Author(s):  
Anna ILYENKO ◽  
Sergii ILYENKO ◽  
Yana MASUR
Keyword(s):  
Information Systems ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Computational Efficiency ◽  
Digital Signature ◽  
Discrete Logarithm ◽  
Algebraic Groups ◽  
Schnorr Signature ◽  
Stability Of Algorithms

In this article, the main problems underlying the current asymmetric crypto algorithms for the formation and verification of electronic-digital signature are considered: problems of factorization of large integers and problems of discrete logarithm. It is noted that for the second problem, it is possible to use algebraic groups of points other than finite fields. The group of points of the elliptical curve, which satisfies all set requirements, looked attractive on this side. Aspects of the application of elliptic curves in cryptography and the possibilities offered by these algebraic groups in terms of computational efficiency and crypto-stability of algorithms were also considered. Information systems using elliptic curves, the keys have a shorter length than the algorithms above the finite fields. Theoretical directions of improvement of procedure of formation and verification of electronic-digital signature with the possibility of ensuring the integrity and confidentiality of information were considered. The proposed method is based on the Schnorr signature algorithm, which allows data to be recovered directly from the signature itself, similarly to RSA-like signature systems, and the amount of recoverable information is variable depending on the information message. As a result, the length of the signature itself, which is equal to the sum of the length of the end field over which the elliptic curve is determined, and the artificial excess redundancy provided to the hidden message was achieved.

scholarly journals A New Family of High-Order Ehrlich-Type Iterative Methods

Mathematics ◽  
2021 ◽  
Vol 9 (16) ◽  
pp. 1855 ◽  
Author(s):  
Petko D. Proinov ◽  
Maria T. Vasileva
Keyword(s):  
Iterative Methods ◽  
Local Convergence ◽  
Semilocal Convergence ◽  
High Order ◽  
Convergence Theorems ◽  
New Family ◽  
Special Cases ◽  
Iteration Functions ◽  
Iteration Function ◽  
Local Convergence Analysis

One of the famous third-order iterative methods for finding simultaneously all the zeros of a polynomial was introduced by Ehrlich in 1967. In this paper, we construct a new family of high-order iterative methods as a combination of Ehrlich’s iteration function and an arbitrary iteration function. We call these methods Ehrlich’s methods with correction. The paper provides a detailed local convergence analysis of presented iterative methods for a large class of iteration functions. As a consequence, we obtain two types of local convergence theorems as well as semilocal convergence theorems (with computer verifiable initial condition). As special cases of the main results, we study the convergence of several particular iterative methods. The paper ends with some experiments that show the applicability of our semilocal convergence theorems.

scholarly journals A note on extensions of multilinear maps defined on multilinear varieties

2021 ◽  
pp. 1-26
Author(s):  
W. T. Gowers ◽  
L. Milićević
Keyword(s):  
Finite Fields ◽  
Vector Spaces ◽  
Restriction Map ◽  
Zero Set ◽  
Dimensional Vector ◽  
Prime Field ◽  
Finite Dimensional ◽  
Multilinear Maps ◽  
Multilinear Map

Abstract Let $G_1, \ldots , G_k$ be finite-dimensional vector spaces over a prime field $\mathbb {F}_p$ . A multilinear variety of codimension at most $d$ is a subset of $G_1 \times \cdots \times G_k$ defined as the zero set of $d$ forms, each of which is multilinear on some subset of the coordinates. A map $\phi$ defined on a multilinear variety $B$ is multilinear if for each coordinate $c$ and all choices of $x_i \in G_i$ , $i\not =c$ , the restriction map $y \mapsto \phi (x_1, \ldots , x_{c-1}, y, x_{c+1}, \ldots , x_k)$ is linear where defined. In this note, we show that a multilinear map defined on a multilinear variety of codimension at most $d$ coincides on a multilinear variety of codimension $O_{k}(d^{O_{k}(1)})$ with a multilinear map defined on the whole of $G_1\times \cdots \times G_k$ . Additionally, in the case of general finite fields, we deduce similar (but slightly weaker) results.

scholarly journals New Formulae for the High-Order Derivatives of Some Jacobi Polynomials: An Application to Some High-Order Boundary Value Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
W. M. Abd-Elhameed
Keyword(s):  
Galerkin Method ◽  
Boundary Value Problems ◽  
Chebyshev Polynomials ◽  
Hypergeometric Functions ◽  
Jacobi Polynomials ◽  
Boundary Value ◽  
High Order ◽  
Sixth Order ◽  
Special Cases ◽  
Derivatives Of

This paper is concerned with deriving some new formulae expressing explicitly the high-order derivatives of Jacobi polynomials whose parameters difference is one or two of any degree and of any order in terms of their corresponding Jacobi polynomials. The derivatives formulae for Chebyshev polynomials of third and fourth kinds of any degree and of any order in terms of their corresponding Chebyshev polynomials are deduced as special cases. Some new reduction formulae for summing some terminating hypergeometric functions of unit argument are also deduced. As an application, and with the aid of the new introduced derivatives formulae, an algorithm for solving special sixth-order boundary value problems are implemented with the aid of applying Galerkin method. A numerical example is presented hoping to ascertain the validity and the applicability of the proposed algorithms.

scholarly journals Construction of elliptic curves with cyclic groups over prime fields

2006 ◽  
Vol 73 (2) ◽  
pp. 245-254 ◽  
Author(s):  
Naoya Nakazawa
Keyword(s):  
Elliptic Curves ◽  
Finite Fields ◽  
Function Field ◽  
Modular Group ◽  
Modular Function ◽  
Invariant Function ◽  
Rational Points ◽  
Modular Invariant ◽  
Cyclic Groups ◽  
Prime Fields

The purpose of this article is to construct families of elliptic curves E over finite fields F so that the groups of F-rational points of E are cyclic, by using a representation of the modular invariant function by a generator of a modular function field associated with the modular group Γ0(N), where N = 5, 7 or 13.

Sign in / Sign up

Export Citation Format

Share Document