Key exchange based on dickson polynomials over finite field with 2 m

Pengcheng Wei; Xiaofeng Liao; Kwok-Wo Wong

doi:10.4304/jcp.6.12.2546-2551

Key exchange based on dickson polynomials over finite field with 2 ^m

Pengcheng Wei, Xiaofeng Liao, Kwok-Wo Wong

Department of Electrical Engineering

Research output: Journal Publications and Reviews › RGC 22 - Publication in policy or professional journal

8 Citations (Scopus)

Abstract

Give a survey of the important properties of Dickson polynomial D _n (x,1), and prove that Dickson polynomial D _n (x,1) over finite field with 2 ^m is a permutation polynomial if and only if n is odd. Use this fact to construct a new key agreement protocol which is secure, feasible and extensible. © 2011 ACADEMY PUBLISHER.

Original language	English
Pages (from-to)	2546-2551
Journal	Journal of Computers
Volume	6
Issue number	12
DOIs	https://doi.org/10.4304/jcp.6.12.2546-2551
Publication status	Published - 2011

Research Keywords

Dickson polynomial
Key agreement
Permutation rational function
Semi-group

Access Output

10.4304/jcp.6.12.2546-2551

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{8dc688dcfb9d4f88880263a5e75a2207,

title = "Key exchange based on dickson polynomials over finite field with 2 m",

abstract = "Give a survey of the important properties of Dickson polynomial D n (x,1), and prove that Dickson polynomial D n (x,1) over finite field with 2 m is a permutation polynomial if and only if n is odd. Use this fact to construct a new key agreement protocol which is secure, feasible and extensible. {\textcopyright} 2011 ACADEMY PUBLISHER.",

keywords = "Dickson polynomial, Key agreement, Permutation rational function, Semi-group",

author = "Pengcheng Wei and Xiaofeng Liao and Kwok-Wo Wong",

year = "2011",

doi = "10.4304/jcp.6.12.2546-2551",

language = "English",

volume = "6",

pages = "2546--2551",

journal = "Journal of Computers",

issn = "1796-203X",

publisher = "Academy Publisher",

number = "12",

}

TY - JOUR

T1 - Key exchange based on dickson polynomials over finite field with 2 m

AU - Wei, Pengcheng

AU - Liao, Xiaofeng

AU - Wong, Kwok-Wo

PY - 2011

Y1 - 2011

N2 - Give a survey of the important properties of Dickson polynomial D n (x,1), and prove that Dickson polynomial D n (x,1) over finite field with 2 m is a permutation polynomial if and only if n is odd. Use this fact to construct a new key agreement protocol which is secure, feasible and extensible. © 2011 ACADEMY PUBLISHER.

AB - Give a survey of the important properties of Dickson polynomial D n (x,1), and prove that Dickson polynomial D n (x,1) over finite field with 2 m is a permutation polynomial if and only if n is odd. Use this fact to construct a new key agreement protocol which is secure, feasible and extensible. © 2011 ACADEMY PUBLISHER.

KW - Dickson polynomial

KW - Key agreement

KW - Permutation rational function

KW - Semi-group

UR - http://www.scopus.com/inward/record.url?scp=83455199153&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-83455199153&origin=recordpage

U2 - 10.4304/jcp.6.12.2546-2551

DO - 10.4304/jcp.6.12.2546-2551

M3 - RGC 22 - Publication in policy or professional journal

SN - 1796-203X

VL - 6

SP - 2546

EP - 2551

JO - Journal of Computers

JF - Journal of Computers

IS - 12

ER -