FPGA based Hardware Accleration for Elliptic Curve Cryptography ...

More documents

Recommendations

Info

5.2. FURTHER WORK 31 It should be possible to apply the formula of the MSK scheme to the generator, in order to derive FSM modules for arbitrary segment numbers at generator runtime. Though the MSK algorithm has been evaluated manually for the interesting range of segments the general mathematical proof is still interesting. Actually, there are people working on the proof and it is probable that the MSK scheme will soon be proven. Acknowledgment The author would like to thank Markus Ernst and Michael Jung for their great help and support.
Bibliography [1] National Institute of Standards and Technology, “Data Encryption Standard,” Federal Information Processing Standard (FIPS) Publication 46-2 (supercedes FIPS-46-1), http://www.itl.nist.gov/div897/pubs/fip46-2.htm, December 1993. [2] National Institute of Standards and Technology, “Specification for the Advanced Encryption Standard (AES),” Federal Information Processing Standard (FIPS) Publication 197, http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf, November 26, 2001. [3] Internet Engineering Task Force, “The TLS Protocol,” RFC 2246, http://www.ietf.org/rfc/rfc2246.txt, January 1999. [4] R. L. Rivest, A. Shamir and L. M. Adleman, “A Method for Obtaining Digital Signatures and Public- Key Cryptosystems,” Communications of the ACM, Feb 1978. [5] V. Miller, “Use of elliptic curves in cryptography,” Advances in Cryptology, Proc. CRYPTO’85, LNCS 218, H. C. Williams, Ed., Springer-Verlag, pp. 417–426, 1986. [6] N. Koblitz, “Elliptic Curve Cryptosystems,” Mathematics of Computation, vol. 48, pp. 203–209, 1987. [7] A. Lenstra and E. Verheul, “Selecting Cryptographic Key Sizes,” Proc. Workshop on Practice and Theory in Public Key Cryptography, Springer-Verlag, ISBN 3540669671, pp. 446–465, 2000. [8] Xilinx, “Programmable Logic Data Book,” 2001. [9] Atmel, Inc. “Configurable Logic Data Book,” 2001. [10] M. Ernst, S. Klupsch, O. Hauck and S. A. Huss, “Rapid Prototyping for Hardware Accelerated Elliptic Curve Public-Key Cryptosystems,” Proc. 12th IEEE Workshop on Rapid System Prototyping (RSP01), Monterey, CA, June 2001. [11] A. J. Menezes, “Elliptic Curve Public Key Cryptosystems,” Kluwer Akademic Publishers, 1993. [12] J. H. Silverman, “The Arithmetic of Elliptic Curves,” Graduate Texts in Mathematics, Springer- Verlag, 1986. [13] IEEE 1363, “Standard Specifications For Public Key Cryptography,” http://grouper.ieee.org/groups/1363/, 2000. [14] ANSI X9.62, “Public key cryptography for the financial services industry: The Elliptic Curve Digital Signature Algorithm (ECDSA),” (available from the ANSI X9 catalog), 1999.
Page 1 and 2: Fachbereich Informatik Integrierte
Page 3 and 4: Contents List of Figures iv 1 Intro
Page 5 and 6: List of Figures c)! #"%$ d)& #"'$ 2
Page 7 and 8: 1.2. PREVIOUS WORK 2 of dividing a
Page 9 and 10: Chapter 2 Mathematical Background T
Page 11 and 12: Ymonpn _ #qkr9;=stPuiY[ v l _ wr9xK
Page 13 and 14: 2.2. FINITE FIELD ARITHMETIC 8 k P
Page 15 and 16: 2.2.4 Addition in-·‰¸º¹ » 2
Page 17 and 18: Ì Ì Ì Ì Ì Ì Ì Ì Ì Ì Ì Ì
Page 19 and 20: 2.3. SEQUENTIAL MULTIPLICATION SCHE
Page 21 and 22: 6 v |!6 v 3 5 3 î 8 ¾ v Yg5 î 8
Page 23 and 24: 2.3. SEQUENTIAL MULTIPLICATION SCHE
Page 25 and 26: 3.2. REGISTER FILE 20 3.2 Register
Page 27 and 28: 3.4. FINITE FIELD ARITHMETIC 22 3.4
Page 29 and 30: Ì Ì Ì Ì Ì 3.4. FINITE FIELD AR
Page 31 and 32: 3.6. EVALUATION SOFTWARE 26 used fo
Page 33 and 34: 4.2. XILINX XCV405E 28 implementati
Page 35: Chapter 5 Conclusions and Outlook 5
Page 39 and 40: Ô Ô bY©®v @ | ò 6 6 Y©® v
Page 41: 3 m°e'Ỹ %jijY l Y Ym°5 l l $ƒm

FPGA based Hardware Accleration for Elliptic Curve Cryptography ...

Create successful ePaper yourself

Delete template?

Save as template?