1. DSpace at Indian Statistical Institute
  2. Scientific Contributions of ISI
  3. Electronics
Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/2509
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMishra, Pradeep Kumar-
dc.contributor.authorPal, P-
dc.contributor.authorSarkar, Palash-
dc.date.accessioned2011-08-12T07:23:49Z-
dc.date.available2011-08-12T07:23:49Z-
dc.date.issued2007-
dc.identifier.citation3rd International conference,ISPEC,P1-38en_US
dc.identifier.urihttp://hdl.handle.net/10263/2509-
dc.language.isoenen_US
dc.subjectElliptic and hyperelliptic curve cryptosysytemsen_US
dc.subjectMemoryen_US
dc.subjectExplicit formulaen_US
dc.subjectDivisior additionen_US
dc.subjectDivisor doublingen_US
dc.subjectScalar multiplicationen_US
dc.titleTowards minimizing memory requirement for implementation of hyperelliptic curve cryptosystems,practice and experienceen_US
dc.typeArticleen_US
Appears in Collections:Electronics

Files in This Item:
File Description SizeFormat 
toward minimizing memory requirement for implementation of hyperelliptic curve cryptosystems.pdf359.57 kBAdobe PDFView/Open
Show simple item record


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