Tagged: plaintext embedding Toggle Comment Threads | Keyboard Shortcuts

  • CG 3:11 pm on December 17, 2010 Permalink | Reply
    Tags: , , plaintext embedding   

    Now reading 

    Mapping an Arbitrary Message to an Elliptic Curve when Defined over GF(2^n), Brian King, Indiana University – Purdue University Indianapolis 723 W Michigan, SL 160 Indianapolis, IN 46202International Journal of Network Security, Vol.8, No.2, PP.169–176, Mar. 2009.

    Advertisements
     
    • Johnb282 9:24 pm on May 28, 2014 Permalink | Reply

      certainly like your website however you have to check the spelling on several of your posts. Many of them are rife with spelling problems and I to find it very troublesome to inform the truth nevertheless I will surely come back again. eafkedkbdegg

  • CG 12:52 am on September 28, 2008 Permalink | Reply
    Tags: plaintext embedding   

    Big integer representation : done! 

    Next : executing text to point conversion.

    Let’s say we have 13 bytes of bit stream, characters, binary picture data, etc, put it into the lowest 13 bytes of FIELD2N variable and see if the value fits on the curve. If not, add 1 to byte 14. Check again if the x value not fits on the curve. We just keep adding one and check until find a value that does fit on the curve.

    Then pick one of 2 y values associated with x.

    Sounds very simple. But let’s see how to deal with it tomorrow.

    Now is very late and I’m going to zzzzzz…….

     
  • CG 7:26 pm on September 12, 2008 Permalink | Reply
    Tags: , plaintext embedding   

    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 9:46 pm on August 16, 2008 Permalink | Reply
    Tags: , plaintext embedding   

    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.
     
  • CG 7:51 am on August 16, 2008 Permalink | Reply
    Tags: , plaintext embedding   

    Reading papers 

    Found this interesting paper about plaintext embedding on Elliptic Curve. Going to read and make a report about it. Then implement it in C.

     
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