• 제목/요약/키워드: Frobenius method

검색결과 37건 처리시간 0.041초

Efficient Exponentiation in Extensions of Finite Fields without Fast Frobenius Mappings

  • Nogami, Yasuyuki;Kato, Hidehiro;Nekado, Kenta;Morikawa, Yoshitaka
    • ETRI Journal
    • /
    • 제30권6호
    • /
    • pp.818-825
    • /
    • 2008
  • This paper proposes an exponentiation method with Frobenius mappings. The main target is an exponentiation in an extension field. This idea can be applied for scalar multiplication of a rational point of an elliptic curve defined over an extension field. The proposed method is closely related to so-called interleaving exponentiation. Unlike interleaving exponentiation methods, it can carry out several exponentiations of the same base at once. This happens in some pairing-based applications. The efficiency of using Frobenius mappings for exponentiation in an extension field was well demonstrated by Avanzi and Mihailescu. Their exponentiation method efficiently decreases the number of multiplications by inversely using many Frobenius mappings. Compared to their method, although the number of multiplications needed for the proposed method increases about 20%, the number of Frobenius mappings becomes small. The proposed method is efficient for cases in which Frobenius mapping cannot be carried out quickly.

  • PDF

FROBENIUS ENDOMORPHISMS OF BINARY HESSIAN CURVES

  • Gyoyong Sohn
    • East Asian mathematical journal
    • /
    • 제39권5호
    • /
    • pp.529-536
    • /
    • 2023
  • This paper introduces the Frobenius endomophisms on the binary Hessian curves. It provides an efficient and computable homomorphism for computing point multiplication on binary Hessian curves. As an application, it is possible to construct the GLV method combined with the Frobenius endomorphism to accelerate scalar multiplication over the curve.

Improved Scalar Multiplication on Elliptic Curves Defined over $F_{2^{mn}}$

  • Lee, Dong-Hoon;Chee, Seong-Taek;Hwang, Sang-Cheol;Ryou, Jae-Cheol
    • ETRI Journal
    • /
    • 제26권3호
    • /
    • pp.241-251
    • /
    • 2004
  • We propose two improved scalar multiplication methods on elliptic curves over $F_{{q}^{n}}$ $q= 2^{m}$ using Frobenius expansion. The scalar multiplication of elliptic curves defined over subfield $F_q$ can be sped up by Frobenius expansion. Previous methods are restricted to the case of a small m. However, when m is small, it is hard to find curves having good cryptographic properties. Our methods are suitable for curves defined over medium-sized fields, that is, $10{\leq}m{\leq}20$. These methods are variants of the conventional multiple-base binary (MBB) method combined with the window method. One of our methods is for a polynomial basis representation with software implementation, and the other is for a normal basis representation with hardware implementation. Our software experiment shows that it is about 10% faster than the MBB method, which also uses Frobenius expansion, and about 20% faster than the Montgomery method, which is the fastest general method in polynomial basis implementation.

  • PDF

작은 유한체 위에 정의된 타원곡선의 고속연산 방법 (A Fast Multiplication Method for Elliptic Curves defined on small finite fields)

  • 박영호;정수환
    • 정보보호학회논문지
    • /
    • 제12권5호
    • /
    • pp.45-51
    • /
    • 2002
  • Koblitz 타원곡선과 같이 표수(characteristic)가 2인 작은 유한체 위에서 정의된 non-supersingular 타원곡선은 스칼라 곱을 효율적으로 구현하기 위하여 프로베니우스 자기준동형 (Frobenius endomorphism)이 유용하게 사용된다. 본 논문은 확장된 프로베니우스 함수를 사용하여 스칼라 곱의 고속연산을 가능하게 하는 방법을 소개한다. 이 방법은 Muller[5]가 제안한 블록방법(block method) 보다 선행계산을 위해 사용되는 덧셈량을 줄이는 반면에 확장길이는 거의 같게 하므로 M(equation omitted )ller의 방법보다 효율적이다.

A TOPOLOGICAL PROOF OF THE PERRON-FROBENIUS THEOREM

  • Ghoe, Geon H.
    • 대한수학회논문집
    • /
    • 제9권3호
    • /
    • pp.565-570
    • /
    • 1994
  • In this article we prove a version of the Perron-Frobenius Theorem in linear algebra using the Brouwer's Fixed Point Theorem in topology. We will mostly concentrate on he qualitative aspect of the Perron-Frobenius Theorem rather than quantitative formulas, which would be enough for theoretical investigations in ergodic theory. By the nature of the method of the proof, we do not expect to obtain a numerical estimate. But we may regard it worthwhile to see why a certain type of result should be true from a topological and geometrical viewpoint. However, a geometric argument alone would give us a sharp numerical bounds on the size of the eigenvalue as shown in Section 2. Eigenvectors of a matrix A will be fixed points of a certain mapping defined in terms of A. We shall modify an existing proof of Frobenius Theorem and that will do the trick for Perron-Frobenius Theorem.

  • PDF

파라미터 불확실성을 가지는 이산 시간지연 시스템에 대한 견실 H$_\infty$ 제어 (Robust H$_\infty$ Control for Discrete Time-delay Linear Systems with Frobenius Norm-bounded Uncertainties)

  • 김기태;이형호;이상경;박홍배
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.23-23
    • /
    • 2000
  • In this paper, we proposed the problems of robust stability and 개bust H$_{\infty}$ control of discrete time-delay linear st.stems with Frobenius norm-bounded uncertainties. The existence condition and the design method of robust H$_{\infty}$ state feedback control]or are given. Through some changes of variables and Schur complement, the obtained sufficient condition can be rewritten as an LMI(linear matrix inequality) form in terms of all variables.

  • PDF

CONSTRUCTION FOR SELF-ORTHOGONAL CODES OVER A CERTAIN NON-CHAIN FROBENIUS RING

  • Kim, Boran
    • 대한수학회지
    • /
    • 제59권1호
    • /
    • pp.193-204
    • /
    • 2022
  • We present construction methods for free self-orthogonal (self-dual or Type II) codes over ℤ4[v]/〈v2 + 2v〉 which is one of the finite commutative local non-chain Frobenius rings of order 16. By considering their Gray images on ℤ4, we give a construct method for a code over ℤ4. We have some new and optimal codes over ℤ4 with respect to the minimum Lee weight or minimum Euclidean weight.

Speeding up Scalar Multiplication in Genus 2 Hyperelliptic Curves with Efficient Endomorphisms

  • Park, Tae-Jun;Lee, Mun-Kyu;Park, Kun-Soo;Chung, Kyo-Il
    • ETRI Journal
    • /
    • 제27권5호
    • /
    • pp.617-627
    • /
    • 2005
  • This paper proposes an efficient scalar multiplication algorithm for hyperelliptic curves, which is based on the idea that efficient endomorphisms can be used to speed up scalar multiplication. We first present a new Frobenius expansion method for special hyperelliptic curves that have Gallant-Lambert-Vanstone (GLV) endomorphisms. To compute kD for an integer k and a divisor D, we expand the integer k by the Frobenius endomorphism and the GLV endomorphism. We also present improved scalar multiplication algorithms that use the new expansion method. By our new expansion method, the number of divisor doublings in a scalar multiplication is reduced to a quarter, while the number of divisor additions is almost the same. Our experiments show that the overall throughputs of scalar multiplications are increased by 15.6 to 28.3 % over the previous algorithms when the algorithms are implemented over finite fields of odd characteristics.

  • PDF

Scalar Multiplication on Elliptic Curves by Frobenius Expansions

  • Cheon, Jung-Hee;Park, Sang-Joon;Park, Choon-Sik;Hahn, Sang-Geun
    • ETRI Journal
    • /
    • 제21권1호
    • /
    • pp.28-39
    • /
    • 1999
  • Koblitz has suggested to use "anomalous" elliptic curves defined over ${\mathbb{F}}_2$, which are non-supersingular and allow or efficient multiplication of a point by and integer, For these curves, Meier and Staffelbach gave a method to find a polynomial of the Frobenius map corresponding to a given multiplier. Muller generalized their method to arbitrary non-supersingular elliptic curves defined over a small field of characteristic 2. in this paper, we propose an algorithm to speed up scalar multiplication on an elliptic curve defined over a small field. The proposed algorithm uses the same field. The proposed algorithm uses the same technique as Muller's to get an expansion by the Frobenius map, but its expansion length is half of Muller's due to the reduction step (Algorithm 1). Also, it uses a more efficient algorithm (Algorithm 3) to perform multiplication using the Frobenius expansion. Consequently, the proposed algorithm is two times faster than Muller's. Moreover, it can be applied to an elliptic curve defined over a finite field with odd characteristic and does not require any precomputation or additional memory.

  • PDF

최적확장체 위에서 정의되는 타원곡선에서의 고속 상수배 알고리즘 (Fast Scalar Multiplication Algorithm on Elliptic Curve over Optimal Extension Fields)

  • 정병천;이수진;홍성민;윤현수
    • 정보보호학회논문지
    • /
    • 제15권3호
    • /
    • pp.65-76
    • /
    • 2005
  • EC-DSA나 EC-ElGamal과 같은 타원곡선 암호시스템의 성능 향상을 위해서는 타원곡선 상수배 연산을 빠르게 하는 것이 필수적이다. 타원곡선 특유의 Frobenius 사상을 이용한 $base-{\phi}$ 전개 방식은 Koblitz에 의해 처음 제안되었으며, Kobayashi 등은 최적확장체 위에서 정의되는 타원곡선에 적용할 수 있도록 $base-{\phi}$ 전개 방식을 개선하였다. 그러나 Kobayashi 등의 방법은 여전히 개선의 여지가 남아있다. 본 논문에서는 최적확장체에서 정의되는 타원곡선상에서 효율적인 상수배 연산 알고리즘을 제안한다. 제안한 상수배 알고리즘은 Frobenius사상을 이용하여 상수 값을 Horner의 방법으로 $base-{\phi}$ 전개하고, 이 전개된 수식을 최적화된 일괄처리 기법을 적용하여 연산한다. 제안한 알고리즘을 적용할 경우, Kobayashi 등이 제안한 상수배 알고리즘보다 $20\%{\sim}40\%$ 정도의 속도 개선이 있으며, 기존의 이진 방법에 비해 3배 이상 빠른 성능을 보인다.