Smart Card IC Design EEPROM RAM ROM CPU Coprocessors Logic

More documents

Recommendations

Info

Representation of Elements of Jac(C) • Each element of Jac(C) can be represented by a pair of polynomials over k: (a(u),b(u)) with a(u) normalized. • Call such an element reduced if deg(a(u))
Analysis of Cantor Algorithm • Need polynomial arithmetic over finite field k: – Gcd(a,b): Greatest common divisor. – Div/Mod: Polynomial division with remainder. • These are complicated algorithms. • Very efficient field arithmetic is needed (esp. inversion!). • Efficiency of complete implementation in hardware is unclear (see Th. Wollingers M.Sc. thesis, WPI 2001). • Active research on optimal hardware environment done by Philips Semiconductors in EU IST project AREHCC. Semiconductors, BUID, CCC Kim Nguyen, Essen, 2002-09-23 2
Page 1 and 2: Curve based cryptography - The stat
Page 3 and 4: Elliptic curves • Consider the eq
Page 5 and 6: Digital signatures based on ellipti
Page 7 and 8: Analysis of Signature algorithms
Page 9 and 10: ECC: Implementational choices • T
Page 11 and 12: ECC: Implementational Choices • Q
Page 13 and 14: Standard Smart Card IC Design Copro
Page 15 and 16: Arithmetic in Hardware • Importan
Page 17 and 18: History of Philips Coprocessors •
Page 19 and 20: Implementation of Signature algorit
Page 21 and 22: Implementation of ECDSA on HiPerSma
Page 23 and 24: Hyperelliptic curves • A hyperell
Page 25: Implications for Cryptography • N
Page 29 and 30: Explicit formulae • Especially in
Page 31: Thank you for your attention ! Semi

Smart Card IC Design EEPROM RAM ROM CPU Coprocessors Logic

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?