Timing Attacks on Cryptosystems: 18 Years Later

dc.contributor.advisorWashington, Lawrenceen_US
dc.contributor.authorGlowacki, Clariceen_US
dc.contributor.departmentMathematicsen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.date.accessioned2014-10-11T06:00:38Z
dc.date.available2014-10-11T06:00:38Z
dc.date.issued2014en_US
dc.description.abstractThis work applies methodology for cryptosystem timing attacks to elliptic curve encryption using parametric coordinates. Additionally, we attempt to replicate the results found by Paul Kocher regarding timing attacks on RSA cryptosystems. Multiple implementations including Sage, MuPAD, Mathematica, and Python are attempted. Viability of timing attacks with modern computing power is assessed.en_US
dc.identifierhttps://doi.org/10.13016/M2PG6Z
dc.identifier.urihttp://hdl.handle.net/1903/15836
dc.language.isoenen_US
dc.subject.pqcontrolledMathematicsen_US
dc.titleTiming Attacks on Cryptosystems: 18 Years Lateren_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Glowacki_umd_0117N_15616.pdf
Size:
605.23 KB
Format:
Adobe Portable Document Format