Logo
Please use this identifier to cite or link to this item: http://20.198.91.3:8080/jspui/handle/123456789/1971
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorRay, Utpal Kumar-
dc.contributor.authorZeeshan Mehboob-
dc.date.accessioned2023-01-14T10:44:31Z-
dc.date.available2023-01-14T10:44:31Z-
dc.date.issued2019-
dc.date.submitted2019-
dc.identifier.otherDC4468-
dc.identifier.urihttp://20.198.91.3:8080/jspui/handle/123456789/1971-
dc.format.extentix, 40 p.en_US
dc.language.isoenen_US
dc.publisherJadavpur Univesity, Kolkata, West Bengalen_US
dc.subjectCryptographyen_US
dc.subjectElliptic Curvesen_US
dc.subjectSchoof’s Algorithmen_US
dc.subjectCardinalityen_US
dc.subjectHasse’s Theoremen_US
dc.subjectDivision Polynomialsen_US
dc.titleEfficient approach of finding curve orderen_US
dc.typeTexten_US
dc.departmentJadavpur University. Department of Information Technologyen_US
Appears in Collections:Dissertations

Files in This Item:
File Description SizeFormat 
M. E. (Information Technology) Zeeshan Mehboob.pdf1.27 MBAdobe PDFView/Open


Items in IR@JU are protected by copyright, with all rights reserved, unless otherwise indicated.