Please use this identifier to cite or link to this item: http://148.72.244.84/xmlui/handle/xmlui/9063
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShakir Mahmoud Salman-
dc.date.accessioned2023-11-15T08:42:21Z-
dc.date.available2023-11-15T08:42:21Z-
dc.date.issued2014-
dc.identifier.issn2222-8373-
dc.identifier.urihttp://148.72.244.84:8080/xmlui/handle/xmlui/9063-
dc.description.abstractThis work introduce study for one of the relation between points on elliptic curve group which may can use it to attack some of elliptic curve cryptosystems kinds by solving the elliptic curve discrete logarithm problem ( ECDLP ) which are Weil pairings where we describe the basic concepts for elliptic curve group points operation and some type of elliptic curve that we can fined Weil pairing on it and also we explain all the terms concerning with this property and how to compute it by arithmetical example and introduce some of conclusions that we get it in this work .en_US
dc.description.sponsorshiphttps://djps.uodiyala.edu.iq/en_US
dc.language.isoenen_US
dc.publisheruniversity of Diyalaen_US
dc.subjectelliptic curve ; pairing ; divisor ; rational function ; weil pairings .en_US
dc.titleComputing Well Pairings For Elliptic Curve Group Pointsen_US
dc.typeArticleen_US
Appears in Collections:مجلة ديالى للعلوم الاكاديمية / Academic Science Journal (Acad. Sci. J.)

Files in This Item:
File Description SizeFormat 
u32.pdf400.01 kBAdobe PDFView/Open


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