A point compression method for elliptic curves defined over GF(2n)

被引：0
|
作者：
King, B [1 ]
机构：
[1] Indiana Univ Purdue Univ, Purdue Sch Engn, Indianapolis, IN 46202 USA
来源：
PUBLIC KEY CRYPTOGRAPHY - PKC 2004, PROCEEDINGS | 2004年 / 2947卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Here we describe new tools to be used in fields of the form Gf (2(n)), that help describe properties of elliptic curves defined over GF(2(n)). Further, utilizing these tools we describe a new elliptic curve,point compression method, which provides the most efficient use of bandwidth whenever the elliptic curve is defined by y(2) + xy = x(3) + a(2)x(2) + a(6) and the trace of a(2) is zero.
引用
收藏
页码：333 / 345
页数：13
相关论文
共 50 条
  • [21] Multiple point compression on elliptic curves
    Xinxin Fan
    Adilet Otemissov
    Francesco Sica
    Andrey Sidorenko
    Designs, Codes and Cryptography, 2017, 83 : 565 - 588
  • [22] High-performance Pipelined FPGA Implementation of the Elliptic Curve Cryptography over GF (2n)
    Harb, Salah
    Ahmad, M. Omair
    Swamy, M. N. S.
    PROCEEDINGS OF THE 16TH INTERNATIONAL JOINT CONFERENCE ON E-BUSINESS AND TELECOMMUNICATIONS, VOL 2: SECRYPT, 2019, : 15 - 24
  • [23] Asymmetric Key Cryptosystem for Image Encryption by Elliptic Curve over Galois Field GF (2n)
    Hazzazi, Mohammad Mazyad
    Rehman, Hafeez Ur
    Shah, Tariq
    Younas, Hajra
    CMC-COMPUTERS MATERIALS & CONTINUA, 2023, 76 (02): : 2033 - 2060
  • [24] Color image encryption by piecewise function and elliptic curve over the Galois field GF(2n)
    Rehman, Hafeez Ur
    Hazzazi, Mohammad Mazyad
    Shah, Tariq
    Aljaedi, Amer
    Bassfar, Zaid
    AIMS MATHEMATICS, 2024, 9 (03): : 5722 - 5745
  • [25] Implementation of elliptic curve cryptosystems over GF(2n) in optimal normal basis on a reconfigurable computer
    Bajracharya, S
    Shu, C
    Gaj, K
    El-Ghazawi, T
    FIELD-PROGRAMMABLE LOGIC AND APPLICATIONS, PROCEEDINGS, 2004, 3203 : 1001 - 1005
  • [26] Fastest Parallel Molecular Algorithms for the Elliptic Curve Discrete Logarithm Problem over GF(2n)
    Iaccarino, Gennaro
    Mazza, Tommaso
    WORKSHOP ON BIO-INSPIRED ALGORITHMS FOR DISTRIBUTED SYSTEMS - BADS 2009, 2009, : 95 - 104
  • [27] A cryptographic processor for arbitrary elliptic curves over GF(2(m))
    Eberle, Hans
    Gura, Nils
    Shantz, Sheueling Chang
    Gupta, Vipul
    INTERNATIONAL JOURNAL OF EMBEDDED SYSTEMS, 2008, 3 (04) : 241 - 255
  • [28] ELLIPTIC CURVES WITH A POINT OF ORDER 13 DEFINED OVER CYCLIC CUBIC FIELDS
    Bruin, Peter
    Derickx, Maarten
    Stoll, Michael
    FUNCTIONES ET APPROXIMATIO COMMENTARII MATHEMATICI, 2021, 65 (02) : 191 - 198
  • [29] APN monomials over GF(2n) for infinitely many n
    Jedlicka, David
    FINITE FIELDS AND THEIR APPLICATIONS, 2007, 13 (04) : 1006 - 1028
  • [30] EA and CCZ equivalence of functions over GF(2n)
    Horadam, K. J.
    ARITHMETIC OF FINITE FIELDS, PROCEEDINGS, 2008, 5130 : 134 - 143
12345