Hari ini kita mulai UAS jam 8.00 dikelas biasa; Peserta UAS wajib hadir ontime

Dikerjakan dikertas, Lembar Ujian.
Boleh buka buku, internet dll, DILARANG MECONTEK TEMAN . Yang melangar akan diberi BONUS E

Soal type A. untuk NIM Ganjil
Soal Type B untuk NIM Genap


ECC part 1

Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC requires smaller keys compared to non-EC cryptography (based on plain Galois fields) to provide equivalent security.[1]

Elliptic curves are applicable for key agreement, digital signatures, pseudo-random generators and other tasks. Indirectly, they can be used for encryption by combining the key agreement with a symmetric encryption scheme. They are also used in several integer factorization algorithms based on elliptic curves that have applications in cryptography, such as Lenstra elliptic-curve factorization.



For current cryptographic purposes, an elliptic curve is a plane curve over a finite field (rather than the real numbers) which consists of the points satisfying the equation

{\displaystyle y^{2}=x^{3}+ax+b,\,}

along with a distinguished point at infinity, denoted ∞. (The coordinates here are to be chosen from a fixed finite field of characteristic not equal to 2 or 3, or the curve equation will be somewhat more complicated.)

This set together with the group operation of elliptic curves is an abelian group, with the point at infinity as an identity element. The structure of the group is inherited from the divisor group of the underlying algebraic variety.

{\displaystyle \mathrm {Div} ^{0}(E)\to \mathrm {Pic} ^{0}(E)\simeq E,\,}


Cryptographic schemes

Several discrete logarithm-based protocols have been adapted to elliptic curves, replacing the group

{\displaystyle (\mathbb {Z} _{p})^{\times }}

with an elliptic curve:

At the RSA Conference 2005, the National Security Agency (NSA) announced Suite B which exclusively uses ECC for digital signature generation and key exchange. The suite is intended to protect both classified and unclassified national security systems and information.[8]

Recently, a large number of cryptographic primitives based on bilinear mappings on various elliptic curve groups, such as the Weil and Tate pairings, have been introduced. Schemes based on these primitives provide efficient identity-based encryption as well as pairing-based signatures, signcryption, key agreement, and proxy re-encryption.


Reference :


Reading :

An Introduction to the Theory of Elliptic Curves Joseph H. Silverman Brown University and NTRU Cryptosystems, Inc.


Craig Costello A gentle introduction to elliptic curve cryptography. Summer School on Real-World Crypto and Privacy



Guide to Elliptic Curve Cryptography BOOK


You tube Reference :

Elliptic Curve Cryptography Overview


Elliptic Curve Diffie Hellman


Elliptic Curve Point Addition


Elliptic curves

Explore the history of counting points on elliptic curves, from ancient Greece to present day. Inaugural lecture of Professor Toby Gee.


Martijn Grooten – Elliptic Curve Cryptography for those who are afraid of maths


Elliptic Curve Cryptography, A very brief and superficial introduction


ECC intro Broer

Hello world!

Welcome to After you read this, you should delete and write your own post, with a new title above. Or hit Add New on the left (of the admin dashboard) to start a fresh post.

Here are some suggestions for your first post.

  1. You can find new ideas for what to blog about by reading the Daily Post.
  2. Add PressThis to your browser. It creates a new blog post for you about any interesting  page you read on the web.
  3. Make some changes to this page, and then hit preview on the right. You can alway preview any post or edit you before you share it to the world.