Updates from May, 2008 Toggle Comment Threads | Keyboard Shortcuts

  • CG 2:38 pm on May 30, 2008 Permalink | Reply

    What? That's what you call a progress??? 

    This is exactly what was happening to me today when I met my advisor/supervisor. Hi hi hi…

    And he gave a bunch of questions and a long to-do-list, result in an expanding mind maps of mine! Aaaaaaaaa!!!!

    • Budi Rahardjo 11:22 pm on May 30, 2008 Permalink | Reply

      Hey … I didn’t do that. ha ha ha. Yes, I always ask for progress. So, is there any progress?

    • chikaradirghsa 11:30 pm on May 30, 2008 Permalink | Reply

      yes there’s some progress. but they’re still in my term, not yet in your term, sir 😀 next week hopefully there will be some progress comply with your request 😉

    • Budi Rahardjo 3:07 am on June 1, 2008 Permalink | Reply

      You better have some results next week! :p

    • Rindu 12:36 pm on June 2, 2008 Permalink | Reply

      talk about progress.. for me it means ” from step to result” 🙂

    • iffata 3:57 pm on June 18, 2008 Permalink | Reply

      Progress … ? What progress, Sir?
      … in harmonia … progressio! (sounds like a spell) :p

  • CG 12:33 pm on May 27, 2008 Permalink | Reply  

    Fermat's Last Theorem 

    Some of my favorites book arrived today. One of the is this book

    But the funny thing is, it has different cover with those I found on the web:

    Is it because they’re from different publishers, or there are different versions, I will find out 😉

    Ready to enjoy the book… (the piles is getting higher, adding more distractions for me, hi hi hi…)

    • Budi Rahardjo 5:02 pm on May 28, 2008 Permalink | Reply

      Ah … those distractions. I think you should work on your stuff first. Show me your progress. Minor progress is okay, as long as it is progressing.

      Then, you can read a book for your reward.

      As for that book, I read it already but wouldn’t mind re-reading it again.

    • kusprasapta 12:41 am on May 29, 2008 Permalink | Reply

      tulisin short summary-nya di sini dong.
      biar bisa ikutan baca, dikit-dikit 🙂

    • Rindu 3:49 am on May 29, 2008 Permalink | Reply

      Enjoy the books but dont forget pak BR comment 🙂 work on progress first…

    • chikaradirghsa 5:10 am on May 29, 2008 Permalink | Reply

      BR: but what if i need some “distractions” to make some progress, sir? hi hi. i will take the advice and will stay away from the (new) books. but let me at least finish “the cuckoo’s egg”, hi hi hi *blink blink*

      Kusprasapta: ok 😉 campur2x sama coding tapi ya 😀

      Rindu: yes, trying hard to make some progress here 😀

  • CG 11:04 am on May 25, 2008 Permalink | Reply
    Tags: ,   

    Quals – postponed 

    Forgot to inform that my academic supervisor #1 adviced me to postpone the quals until I’m ready with the “hands-on experience” (in this case will be coding). He suggested me to stop reading papers and start to implement the theory has been gathered.

    So I will stop those “endless paper-hunting” activity for a while and focusing on building a small cryptosystem and make it work!

    • Rindu 2:47 am on May 26, 2008 Permalink | Reply

      Chika … who is “He”? 🙂

    • chikaradirghsa 3:44 am on May 26, 2008 Permalink | Reply

      Dr. Ir. Kuspriyanto, beliau promotor utama saya 🙂

    • kusprasapta 4:36 am on May 26, 2008 Permalink | Reply

      i totally agree with your academic supervisor #1 🙂

      reduce reading paper (don’t stop :)), focus and build a small system.

    • chikaradirghsa 11:11 am on May 26, 2008 Permalink | Reply

      yes, but i don’t feel like reading papers right now, so much into the coding 😉

      but i will read some papers and search some updates about the latest, maybe next week

    • intan 1:08 am on May 27, 2008 Permalink | Reply

      good luck!

    • Budi Sulistyo 4:26 am on May 27, 2008 Permalink | Reply

      I agree that we need to do some hand-on experience to get more insight about a theory, swinging between generalization/theoritic thinking to spesific observation/experiment and vice versa

    • Lutce 9:43 am on May 27, 2008 Permalink | Reply

      Klo kangmas ku pasti nyuruh baca yaaa kwakwkakwakwk. Dasar memang dianya yg gila baca. Beda ma otak kita, dia baca langsung bisa membayangkan dan ngerti, kita baca…praktek dulu baru ngerti

    • chikaradirghsa 11:11 am on May 27, 2008 Permalink | Reply

      @intan: thx, partner :* we haven’t discussed about our project for quite a long time 😉

      @budi sulis: exactly. i’m looking for experiences and insights to comprehend the theory. but i often find difficulties in switching between those two domains (theoritical vs experiment). how do you deal with that?

      @luche: hey! so nice to have you here! kangmasmu belum bales email pertanyaan dari aku, sibuk banget dianya!

    • Lutce 11:14 am on May 27, 2008 Permalink | Reply

      iya bisanya komen di sini, di multiply musti bikin dulu maleeessss

  • CG 10:56 am on May 25, 2008 Permalink | Reply
    Tags: large integers,   

    Large integers 

    Have been doing some coding on large integers for the last couple of weeks.

    The integers are represented in a half of 32 bytes words.

    So far the program has been verified for the addition, substraction, multiplication and division operations.

    Functions for converting ascii to large integer or vice versa have also been built and verified.

    Next step will be developing some functions for basic number theory like GCD, modular arithmetic, Fermat’s theorem, finite fields and generators.

    Still a long way to go, even for a simple cryptosystem to convert a word into a point in elliptic curve.

    • Rindu 2:49 am on May 26, 2008 Permalink | Reply

      Salut … no future comment !

    • chikaradirghsa 3:44 am on May 26, 2008 Permalink | Reply

      trims Rindu, belum apa 2x, ini, kerjaannya masih banyak!!! 😉

    • kusprasapta 4:27 am on May 26, 2008 Permalink | Reply

      dalam komputer arsitektur Intel IA32, bilangan integer memiliki representasi sebanyak 4 byte (32 bit).
      kalau saya lihat dalam code yang dibuat, integer-nya memiliki representasi sebanyak ‘half of 32 bytes words’.
      jadi boleh dibilang, representasi integernya sebanyak 0.5 * 32 * 8 bit = 128 bit, atau 4 kali lebih besar dari representasi biasa.

      tentu ini ada trik-nya ya?

    • chikaradirghsa 11:07 am on May 26, 2008 Permalink | Reply

      ya ya ya ya… nge-trik-nya aja meni butuh waktu, ampun!

  • CG 2:44 pm on May 16, 2008 Permalink | Reply

    Current to do list 

    I will just scribble notes here about what I got from the regular discussion today:

    1. Is it relevant to observe the input and output class groups? Which condition regarding to this correlation should be considered as “secure”?
    2. How many class numbers will be needed to be considered as “secure”? How does the number affects the security? Any research on that?
    3. Generating curve, then choose the generator, or vice versa? Observe the effect of applying different generators
    4. Is it possible (if possible, is it necessary?) to apply some feedback to the system?
    5. Find the most convenient way to convert plaintext to point in ECC
    6. Find out more about cryptanalysis on ECC
    7. Getting ready for quals! QUALS!!!
    • Budi Rahardjo 2:46 pm on May 24, 2008 Permalink | Reply

      Any progress?

    • chikaradirghsa 12:13 am on May 25, 2008 Permalink | Reply

      yes, but not much. still working on the coding. hopefully nextweek there will be some significant progress

  • CG 2:25 am on May 15, 2008 Permalink | Reply

    Converting text to point in ECC 

    I’m now building some simple codes for converting plain text character to a point on an elliptic curve.

    Here’s how I’m gonna do it, based on Mike Rosing’s hints:

    1. Take the data, and treat it as an x value
    2. If x value fit on the curve, then find y. Each x value has two y values associated with it.
    3. If x value does not fit on the curve, add extra bits to the data (but make sure not to mess with the raw data)
    4. Check again
    5. Repeat until the combination of the raw data and extra bits does fit on the curve.

    To get the x value back, just mask off the extra bits to recover the raw data.

  • CG 2:41 pm on May 13, 2008 Permalink | Reply

    Presentation at Math Dept. 

    Going to give a presentation at the Math Dept. tomorrow. Talking about cryptography and ECC and ECDLP. Will avoid explaining about those math equations, otherwise the students will eat me alive, hi hi hi

    Wish me luck 😉

    • Aris 3:29 pm on May 13, 2008 Permalink | Reply

      Good luck mbak. Nice to find your blog. It is really a niche blog with cryptography inside. Best regards from Brussels

    • chikaradirghsa 1:49 am on May 14, 2008 Permalink | Reply

      hello aris, thx for dropping by.

      what an impressive blog about foreign affairs of yours!

    • kusprasapta 3:43 am on May 14, 2008 Permalink | Reply

      good luck with your presentation at the math dept.
      but i don’t think you can avoid math 😀

      wait for result of the presentation.
      post immediately!

    • Rindu 4:31 am on May 14, 2008 Permalink | Reply

      Good Luck… so, how the result of yesterday presentation dear? report yak !!

    • chikaradirghsa 8:20 am on May 14, 2008 Permalink | Reply

      @kusprasapta: i only avoid math when i’m presenting in front of mathematicians 😛

      @rindu: thx for asking, but i don’t think i did it well 😦 kacow!

    • Intan 9:04 am on May 14, 2008 Permalink | Reply

      you did it well!! they are more motivated by you than by my speech for a whole semester!

    • kusprasapta 9:55 am on May 14, 2008 Permalink | Reply

      infact, in front of mathematicians, you have to describe engineering things with the language of mathematics 🙂

      so proud that you have a gut to do presentation in front of science people. because i’m not! 🙂

    • Intan 11:27 am on May 14, 2008 Permalink | Reply

      just want to tell you my new ‘mathematical side’ blog 🙂

    • Budi Rahardjo 12:20 pm on May 14, 2008 Permalink | Reply

      Well done! We’re all proud of you. 🙂

    • chikaradirghsa 12:40 pm on May 14, 2008 Permalink | Reply

      @intan: are you sure? REALLY??? they seemed like they were not interested at ALL!!!
      btw, i already add you “mathematical side” blog rss feed and link to this blog 🙂

      @kusprasapta: i think i failed to deliver the message using their language :((
      this posting is so true http://rahard.wordpress.com/2008/05/14/delivering-the-message/

      @BR: thx 🙂 you’re always inspiring me

  • CG 2:43 pm on May 9, 2008 Permalink | Reply
    Tags: diffusion,   

    ECC and diffusion? 

    After spending hours googling and reading some pdf and presentation files, I still cannot find the correlation between the term “diffusion” with ECC.

    For now I do really think that the term “diffusion” is only for symmetric-key system.

    Will find out more about it later. Hmmm….

  • CG 3:13 am on May 6, 2008 Permalink | Reply
    Tags: attack,   

    Cryptanalysis of ECC 

    To make sure that your cryptosystem is secure, then you have to do cryptanalysis.

    The known attacks for ECC are:

    • The Pohlig-Hellman algorithm (which reduces the problem to subgroups of prime order)
    • Shanks’ baby-step-giant-step method
    • Pollard’s methods, the rho method and the kangaroo method, both of which have parallel versions due to van Oorschot and Wiener
    • The Menezes-Okamoto-Vanstone (MOV) attack using the Weil pairing
    • The Frey-Rueck attack using the Tate pairing
    • The attacks on anomalous elliptic curves (i.e., elliptic curves over F_p which have p points) due to Semaev, Satoh-Araki and Smart
    • Weil descent (for some special finite fields)
    • Algebro-geometric attack

    Next step will be to choose which attacks to be used for measuring the level of security of ECC.

  • CG 9:55 pm on May 5, 2008 Permalink | Reply
    Tags: , encryption   

    Confusion and Diffusion 

    Diffusion means many bits of the plaintext (possibly all) affect each bit of the ciphertext.
    Confusion means there is a low statistical bias of bits in the  ciphertext.

    Question: the diffusion behaviour for ECC in encryption process?

Compose new post
Next post/Next comment
Previous post/Previous comment
Show/Hide comments
Go to top
Go to login
Show/Hide help
shift + esc