Tagged: elliptic curve Toggle Comment Threads | Keyboard Shortcuts

  • CG 2:09 pm on November 4, 2011 Permalink | Reply
    Tags: elliptic curve, geometer sketchpad,   

    Drawing Elliptic Curve with Geometer Sketchpad 

    Point Addition:

    Point Doubling:

    Associative:

    [*Note: Big thanks for Fajar Yuliawan for his brilliant tutorial 😉 ]

    Advertisements
     
  • CG 7:41 am on August 14, 2010 Permalink | Reply
    Tags: digital signature, elliptic curve, ,   

    Now reading 

    A Low-Power VHDL Design for an Elliptic Curve Digital Signature Chip – Richard Schroeppel, Cheryl Beaver, and Timothy Draelos – Cryptography and Information Systems Surety Department, September 2002

     
  • CG 9:54 am on February 10, 2010 Permalink | Reply
    Tags: elliptic curve, , point multiplication   

    Doubling & Addition Table (4 bits) 

    Notes:

    1. The calculation starts from LSB
    2. Every bit shift means doubling, bit 1 means added by P and bit 0 means not added by P
    3. Adding costs more than doubling
     
    • Budi Rahardjo 5:19 pm on February 13, 2010 Permalink | Reply

      to be frankly, i cannot see the pattern from the table.
      i have different notation in my head 🙂 which is basically similar to what you wrote in your notes.

      • CG 5:42 pm on February 13, 2010 Permalink | Reply

        @BR: should there be any pattern anyway? 😛 i’m so lost in multiplication of different bases 😀 show me your notation 🙂

  • CG 2:42 pm on December 25, 2008 Permalink | Reply
    Tags: elliptic curve   

    Newcomers to the bookshelf :) 

    Forgot to post an update about me shopping some books, really cool ones 🙂

    1. The “bible” of ECC: “Guide to Elliptic Curve Cryptography” – Darrel Hankerson, Alfred Menezes, Scott Vanstone

    2. A very detail and theoritical book about elliptic curves: “Elliptic Curves – Number Theory and Cryptography” – Lawrence C. Washington

    3. The most related book to be the reference of my phd thesis: “Elliptic Curve Cryptography for Constrained Devices – Algorithms, Architectures and Practical Implementations” – Sandeep S. Kumar

    Happy holiday, everybody.

    I’m going to spend the holiday with my new buddies 😉

     
    • Budi Rahardjo 7:13 pm on December 26, 2008 Permalink | Reply

      Waaahhh … iri …
      Buku baru selalu membuat iri 😀

    • CG 7:15 pm on December 26, 2008 Permalink | Reply

      @BR: hey, you’ve got to read them too and help me to understand and finish my phd 😀

    • mehobbes 5:39 am on December 29, 2008 Permalink | Reply

      the first one is a “bible” ?
      hmmmm, oke, a must have ECC book isn’t, it.

  • CG 5:19 am on October 14, 2008 Permalink | Reply
    Tags: , elliptic curve,   

    Changing generators 

    I was going to observe the “behaviour” of an elliptic curve by changing its generator, and looking for an answer what does happen if I change it.

    From the discussion yesterday, I understand that each generator will generate different cyclic subgroups. And does it have something to do with security level? Let’s find out.

    Still thinking about changing other parameters of elliptic curve, and observe the result.

     
  • CG 10:18 pm on October 13, 2008 Permalink | Reply
    Tags: elliptic curve,   

    Why finite fields? 

    Eh, there are still some questions left, and I’m posting it here to remind me that I have to move forward from this point 😉

    Question:

    Why finite fields? Does it has something to do with “reversible”? Is that a requirement for only elliptic curve? Is it possible for elliptic curve without finite fields?

     
  • CG 5:36 am on October 5, 2008 Permalink | Reply
    Tags: elliptic curve, , point   

    Order of the point 

    Multiplication over elliptic curve is like this:

    Q = kP

    where Q and P are points on an elliptic curve and k is an integer. The equation above means that P is added to itself k times.

    What I don’t understand (yet) is, why the integer k need not be larger than the “order” of the point P ? Understand that reducing k will save a great deal of processing. But what’s the relation between the “order” of the point with this statement:

    The points in elliptic curve, forms a cyclic group (a field)

    ??? [back to reading… ]

    Update:

    I guess now I start to grab the ideas about those previous paragraphs 🙂

    I’ll check it to mathematician buddy as soon as possible 😉

     
    • tetangga sebelah 7:03 pm on October 6, 2008 Permalink | Reply

      walah baca postingan ini jadi merasa orang garut……dodol
      cing atuh……pake bahasa manusia kalau posting tehhhh

    • chikaradirghsa 8:49 pm on October 6, 2008 Permalink | Reply

      @tetangga sebelah: cing atuh karunya ka sayah. lebaran mudik teh bawain oleh2x atuh, opor kek, dodol kek…

      emang bukan bahasa manusia makanya saya juga ga ngarti…

    • gre 5:51 pm on October 10, 2008 Permalink | Reply

      speaking of field, you must be a knowledgeable person in abstract algebra and it is rarely found in LABTEK VIII 🙂
      I am just wondering if the k integer might be a Lipshitz constant.

    • chikaradirghsa 11:45 pm on October 10, 2008 Permalink | Reply

      @gre: not yet a knowledgeable person in abstract algebra 😉
      what is a Lipshitz constant anyway? [pls don’t give more headaches to me now 😀 ]

  • CG 7:26 pm on September 12, 2008 Permalink | Reply
    Tags: elliptic curve,   

    Applying plaintext embedding 

    Continuing this, from “Problems of Plaintext Embedding on Elliptic Curve” by Fucai Zhou and Jun Zhang, I’m now focusing on the algorithms of plaintext embedding on Elliptic Curve.

    Will explore this more, while also learn about affine, standard and jacobi projective.

     
  • CG 7:07 pm on August 28, 2008 Permalink | Reply
    Tags: , elliptic curve,   

    Papers on ECC Implementation 

    Now reading

    1. D. Hankerson, J.L. Hernandez, A. Menezes, “Software Implementation of Elliptic Curve Cryptography over Binary Fields”
    2. M. Brown, D. Hankerson, J. Lopez, A. Menezes, “Software Implementation of the NIST Elliptic Curves over Prime Fields”
     
    • Budi Rahardjo 5:20 am on August 29, 2008 Permalink | Reply

      Good! Summary, please.
      Also, don’t forget to enter this into you bibliography database.

    • chikaradirghsa 3:57 pm on August 31, 2008 Permalink | Reply

      @BR: summary is in progress. already added to the bibliography database.

    • intan 1:53 pm on September 3, 2008 Permalink | Reply

      after the summary can you make a presentation in our ecc-study group about this book, please?

    • chikaradirghsa 6:45 pm on September 3, 2008 Permalink | Reply

      @intan: those are papers, not books. would be glad to give presentation, but need some time to prepare it. is 2 weeks from now ok? 😉

  • CG 9:46 pm on August 16, 2008 Permalink | Reply
    Tags: elliptic curve,   

    Plaintext embedding on Elliptic Curve: Conclusions 

    From this paper:

    • Problems of plaintext embedding are the fundamental problems in elliptic curve public key cryptosystems.
    • A good embedding algorithm will enhance the encryption speed.
    • Plaintext embedding algorithm in binary field presented in the paper is easier to be implemented than that in prime field, and faster.
    • Applying the plaintext embedding algorithm to the storage and trasmission of points in elliptic curve can save half of the storage space and bandwidth.
     
c
Compose new post
j
Next post/Next comment
k
Previous post/Previous comment
r
Reply
e
Edit
o
Show/Hide comments
t
Go to top
l
Go to login
h
Show/Hide help
shift + esc
Cancel