DSpace
 

Researchspace >
General science, engineering & technology >
General science, engineering & technology >
General science, engineering & technology >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10204/3911

Title: Efficient method for finding square roots for elliptic curves over OEF
Authors: Abu-Mahfouz, A
Hancke, G
Keywords: Square root
Elliptic curve
Optimal extension field
Frobenius map
Quadratic residue
Issue Date: 2009
Citation: AbuMahouz, A and Hancke, G. 2009. Efficient method for finding square roots for elliptic curves over OEF. 2009 International Conference on Foundations of Computer Science (FCS'09), Las Vegas, Nevada, USA, 13-16 July 2009, pp 87-91
Abstract: Elliptic curve cryptosystems like others public key encryption schemes, require computing a square roots modulo a prime number. The arithmetic operations in elliptic curve schemes over Optimal Extension Fields (OEF) can be efficiently computed by using an irreducible binomial. This paper provides an overview of the OEF, Frobenius map and embedding points on an elliptic curve. The focus is on describing an efficient method to find a square root over Optimal Extension algorithm which is based on the Frobenius map, in order to simplify the problem of finding the square root over OEF.
Description: 2009 International Conference on Foundations of Computer Science (FCS'09), Las Vegas, Nevada, USA, 13-16 July 2009
URI: http://hdl.handle.net/10204/3911
ISBN: 1-60132-103-1
Appears in Collections:Sensor science and technology
Information security
General science, engineering & technology

Files in This Item:

File Description SizeFormat
AbuMahouz_2009.pdf1.27 MBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback