Elliptic Curve Cryptography (ECC) - Science topic

https://www.hindawi.com/journals/tswj/2016/4913015/

Hi Dr. Anik Islam Abhi

Try with the following, they could help you.

http://ijns.jalaxy.com.tw/contents/ijns-v15-n4/ijns-2013-v15-n4-p256-264.pdf

https://crypto.stackexchange.com/questions/1025/can-one-generalize-the-diffie-hellman-key-exchange-to-three-or-more-parties

Sincerely

@Auday sir, can you please mention any one of the public key evaluation tools ?

Ok Salah

But tell me some network security experts claim that their protocol will verifiably protect in the random oracle model against the hardness assumptions of the Elliptic Curve Discrete Logarithm Problem and Elliptic Curve Computational Diffie-Hellman problem.

What this mean?

Theoretically, yes. But the required infrastructure is still many years away

The question should be as you state, but you should have also add at the end "..for achieving the same level of security," I'd assume this is what you meant.

To get a reasonable security in modular exponentiation over an elementary number theoretic group (say, prime order group) one needs to get a security of 2^80 say, an exponent size of about 1000 (or even 2000, more or less, I am not doing exact calculations), given the various methods to extract discrete log in these group representation over the modular subset of the integers. For elliptic curve (if chosen wisely) the best algorithm for d. log. is the generic one, so a size of 160-200 bit scalar is needed so already 5 -- 6 (or even 10) times less bits to perform on, thus making the ECC curve multiplication much faster (even if the basic per bit op is more involved). 

The ECC is therefore faster and consumes less space.

You can see this link:

As you say, the theory of "complex multiplication" (looking at modular invariants of elliptic curves with CM) solves the problem of determining the maximal abelian extension of an imaginary quadratic field. But as yet no analogous theory is known for real quadratic fields, although class field theory affords  a complete theoretical (but not explicit) description of the abelian extensions of a given number field. You can  take the measure of our ignorance by  listening to the short negative answer given by Serre at the end of his talk on abelian Galois theory at the occasion of Galois' bicentenary (the talk can be found on You Tube, I think).

not sure for that, but looking for paper talk about that topic

For one, they appear in the study of Frobenius morphism, see e.g.  :

Everything depends on how you modify your algorithm ,CPU clock cycles to perform it , iteration process capacity of a processor for the running operation.Compare to the previous & the modified one.You'll understand. Better to apply on raw code.You can get the result in per/sec then convert it to j/s.In your needed result must have to know how many works the algorithm will perform in per second. - Thanks.

It would be great to work together or with other researchers who have desire to work together.

ECC requires shorter key to achieve security as compared to RSA, and that the mathematical operation involved in ECC is scalar multiplication while RSA uses exponentiation.  Because of these, computational complexity involved in ECC is much less as compared to other asymmetric cryptosystems.  

This enables much faster encryption, decryption and signature verification.  Also it saves bandwidh and memory space.  

Hence ECC is best suited for devices which have limited storage and computational power (like smart cards).  Also it is suited for web-browsers, which use a number of encryption sessions.

So your observation about ECC is right.

Regards.

What about Pollard's Rho method and its parallelized?  it may be more efficient and fast.

Yes, there is a relation between the order of the group of points, the size of the base field (check Hasse's condition) and the curve coefficients. You can use a point counting algorithm like Schoof-Elkies-Atkin (SEA) to determine the order. This algorithm is usually already implemented in software like Sage or MAGMA.

"multiple-operation" is mistake the word. The word is corrected as "multiple-operand".

Hello sir, the encryption technique you need to use for a database is depend on the data you store inside the database.

If the data is username and passwords, you can use Hash function instead of ECC. But beware of Rainbow table attack(if you chose Hash). This attack can be rectified by using SALT to the hash function.

If you store some important data/value/message that possibly more than 20 characters, you can use multilevel/multistage encryption techniques, that is you can combine two algorithms/ two whole new algorithms. All the best for your work.

I will provide you wit a paper to discuss your inquiry

Thanks Abdoul, but actually am looking for more advanced attacks such as the ones related to the field attacks, curve generation and so on.

There is a notion of (divisor) class group 'Cl(X) ' associated to algebraic varieties X--affine and projective. (I will define this notion below for elliptic curves which are projective.). Now, if A is a Dedekind domain, (e.g. the ring of integers in a number field F (where F could be a quadratic field you are interested in) Cl(Spec(A)) coincides with the ideal class group of A as defined in Algebraic Number Theory. So, this gives you the connection between affine varieties and ideal class group. (Spec A is affine.)

I will now define Cl(X) for an elliptic curve X. . A divisor D of X is a linear combination of points x_i with coefficients k_i in Z(the integers).. The degree of D (deg D) is the sum of the k_i's. The divisors of X form a group Div(X)--the free Abelian group (Z-module) generated by the x_i's . A principal divisor is a divisor D such that the degree of D = 0.The principal divisors (P(X)) form a subgroup of Div (X) and the quotient group Div(X)/P(X) is denoted by Cl(X). Now, there is homomorphism deg: Cl(X) --> Z whose kernel is denoted by Cl^o(X). Cl^o(X) has the following interesting property:

There is a one-one correspondence between the points of x and the elements of the group Cl^o(X). Moreover by using this one-one correspondence, one can transfer the group law from Cl^o(X) to X itself.

Elliptic curves is a very active area of research probably because the curves have various deep ramifications. For example, an elliptic curve is an Abelian variety of dimension 1 i.e an irreducible projective algebraic group; it is also a curve of genus 1. etc.

for further information you may look at the following books:

1) Basic Algebraic Geometry--Varieties in Projective spaces by I. R. Shavarevich.

Springer-Verlag.

2) Algebraic Geometry-- R. Hartshorne. Springer-Verlag.

Equations do not hold for O related operations. You should add additional “if ” branch codes for these cases.