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 条

[31] RATIONAL 2N-TORSION POINTS ON ELLIPTIC CURVES DEFINED OVER QUADRATIC FIELDS
KENKU, MA
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1975, 11 (SEP): : 93 - 98
[32] CERTAIN REPRESENTATIONS OF CHEVALLEY GROUPS OVER GF(2N)
WILSON, RL
COMMUNICATIONS IN ALGEBRA, 1975, 3 (04) : 319 - 364
[33] Side-channel aware design:: Algorithms and architectures for elliptic curve cryptography over GF(2n)
Batina, L
Mentens, N
Preneel, B
Verbauwhede, I
16TH INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURE AND PROCESSORS, PROCEEDINGS, 2005, : 350 - 355
[34] Low latency flexible FPGA implementation of point multiplication on elliptic curves over GF(p)
Javeed, Khalid
Wang, Xiaojun
INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS, 2017, 45 (02) : 214 - 228
[35] FORMULA IN GF(2N)
JAGERS, AA
WILLIAMS, KS
GREENING, MG
AMERICAN MATHEMATICAL MONTHLY, 1972, 79 (03): : 308 - &
[36] A cryptographic processor for arbitrary elliptic curves over GF(2m)
Eberle, H
Gura, N
Chang-Shantz, S
IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, PROCEEDINGS, 2003, : 444 - 454
[37] Arithmetic computation using self-assembly of DNA tiles: point-addition on conic curves over finite field GF(2n)
Li, Yongnan
Xiao, Limin
2019 IEEE 25TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2019, : 888 - 895
[38] Multiplier architectures for GF(p) and GF(2n)
Savas, E
Tenca, AF
Çiftçibasi, ME
Koç, ÇK
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2004, 151 (02): : 147 - 160
[39] New point compression method for elliptic Fq2-curves of j-invariant 0
Koshelev, Dmitrii
Finite Fields and their Applications, 2021, 69
[40] New point compression method for elliptic Fq2-curves of j-invariant 0
Koshelev, Dmitrii
FINITE FIELDS AND THEIR APPLICATIONS, 2021, 69

← 1 2 3 4 5 →