## Is this random enough?

• #### CG 3:11 pm on December 17, 2010 Permalink | Reply Tags: ECC ( 14 ), elliptic curve cryptography, plaintext embedding ( 5 )

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.

• #### 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

## What level of crypto security?

The security level for Elliptic Curve Cryptography is determined by the cardinality of the group rational points. The group order has to be known to generate secure elliptic curves. In other words: we need to pick a curve of known order.

Two main approaches to do this are:

1. Random approach

a. Pick random paramaters a and b

b. Use point counting algorithm for finding the group order

2. Complex multiplication approach

a. Define the group order candidates

b. Determine a and b using complex multiplication

I’m still digesting this dissertation about algorithm for determining cardinality to limit the complexity (whatever that means 😉 )

Will add more details on this, very soon!

[Sources: Harald Baier dissertation and Intan’s notes]

• #### Budi Sulistyo 2:57 am on April 22, 2008 Permalink | Reply

Menarik2, tapi masih belum ngerti sebenarnya. Tentang kompleksitas, mungkin berhubungan dengan komputasi. Semakin tinggi kompleksitas sebuah algoritma maka semakin besar sumber daya (time, computing power) yg diperlukan untuk mengeksekusinya

berarti sama ya di ecc dan di chaos ya?
kompleksitas berhubungan dengan resources yang dibutuhkan

c
Compose new post
j
Next post/Next comment
k
Previous post/Previous comment
r