4 citations found. Retrieving documents...
G.B. Agnew, R.C. Mullin, and S.A. Vanstone, "On the Development of a Fast Elliptic Curve Cryptosystem", Lecture Notes in Computer Science 658: Advances in Cryptology - Eurocrypt '92 Proceedings, Springer-Verlag, pp. 482-487.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
NESSIE D21 - Performance of Optimized.. - Preneel, Van.. (2003)   (Correct)

....for Elliptic Curve Point Multiplication Over Multiplier Device Field Digit Frequency # Clk. Cyc. # Mult. Throughput # gates # CLBs # FFs # RAM Size (MHz) per Mult. per second (bits sec) AMV93 310 32 40 444 [3] 275862 145 60 AMV89 32 40 4444444 9 11.000 [1] M68008 controller AMV92 [2] 32 40 4310 580 200 6 Kbytes SES98 [66] 32 10 15 17.000 GSS99 [20] 126 179856 272 825 19230 478 7158 1653 962 26753 417 1626 Leung et al. 37] XCV300 4 45 166738 270 645 1808 bits 36 266443 147 784 2480 bits 281 33 474504 69 1311 4496 bits 74.5 45336 2857 2136 1753 40 ....

Gordon B. Agnew, Ronald C. Mullin, and S. A. Vanstone. On the development of a fast elliptic curve cryptosystem. In Rainer A. Rueppel, editor, Proceedings of Eurocrypt'92, Lecture Notes in Computer Science, Advances in Cryptology, pages 482--487, Hungary, 1992. Springer-Verlag.


NESSIE D17 - Preliminary list of realistic.. - Preneel, Bosselaers, .. (2002)   (Correct)

....for Elliptic Curve Point Multiplication Over Multiplier Device Field Digit Frequency # Clk. Cyc. # Mult. Throughput # gates # CLBs # FFs # RAM Size (MHz) per Mult. per second (bits sec) AMV93 310 32 40 444 [3] 275862 145 60 AMV89 32 40 4444444 9 11.000 [1] M68008 controller AMV92 [2] 32 40 4310 580 200 6 Kbytes SES98 [15] 32 10 15 17.000 GSS99 [6] 126 179856 272 825 19230 478 7158 1653 962 26753 417 1626 Leung et al. 9] XCV300 4 113 45 166738 270 645 1808 bits 36 266443 147 784 2480 bits 281 33 474504 69 1311 4496 bits OP00 [10] 4 85.7 82212 ....

Gordon B. Agnew, Ronald C. Mullin, and S. A. Vanstone. On the development of a fast elliptic curve cryptosystem. In Rainer A. Rueppel, editor, Proceedings of Eurocrypt'92, Lecture Notes in Computer Science, Advances in Cryptology, pages 482--487, Hungary, 1992. Springer-Verlag.


NESSIE D21 - Performance of Optimized.. - Preneel, Van.. (2002)   (Correct)

....for Elliptic Curve Point Multiplication Over Multiplier Device Field Digit Frequency # Clk. Cyc. # Mult. Throughput # gates # CLBs # FFs # RAM Size (MHz) per Mult. per second (bits sec) AMV93 310 32 40 444 [3] 275862 145 60 AMV89 32 40 4444444 9 11.000 [1] M68008 controller AMV92 [2] 32 40 4310 580 200 6 Kbytes SES98 [66] 32 10 15 17.000 GSS99 [20] 126 179856 272 825 19230 478 7158 1653 962 26753 417 1626 Leung et al. 37] XCV300 4 113 45 166738 270 645 1808 bits 36 266443 147 784 2480 bits 281 33 474504 69 1311 4496 bits 74.5 45336 2857 2136 1753 ....

Gordon B. Agnew, Ronald C. Mullin, and S. A. Vanstone. On the development of a fast elliptic curve cryptosystem. In Rainer A. Rueppel, editor, Proceedings of Eurocrypt'92, Lecture Notes in Computer Science, Advances in Cryptology, pages 482--487, Hungary, 1992. Springer-Verlag.


Parallel Collision Search with Cryptanalytic Applications - van Oorschot, Wiener (1996)   (51 citations)  (Correct)

No context found.

G.B. Agnew, R.C. Mullin, and S.A. Vanstone, "On the Development of a Fast Elliptic Curve Cryptosystem", Lecture Notes in Computer Science 658: Advances in Cryptology - Eurocrypt '92 Proceedings, Springer-Verlag, pp. 482-487.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC