Polynomial Basis Squaring

Finally have successfully found some spare time to do coding to solve this polynomial squaring:

And this is the result, x^5 + x + 1 :

• rudi 9:37 pm on May 30, 2013 Permalink | Reply

bu, akan lebih cantik kalo nulis polinomnya pake latex,
$x^5 + x+1$

• CG 11:00 am on May 31, 2013 Permalink | Reply

iya belum sempet dirapihin 😀 biasanya saya pake latex for wordpress

• Akshay 11:18 pm on July 26, 2013 Permalink | Reply

Hey please mail me this complete C code. sorry I’m not execute this ….please help me…please ..

Crypto vs Code

Cryptography is the study of mathematical techniques related to aspects of information security such as confidentiality, data integrity, entity authentication, and data origin authentication. [Handbook of Applied Cryptography – Alfred J. Menezes Paul C. van Oorschot Scott A. Vanstone]

Coding is needed for efficient reliable digital transmission and storage. [Error Control Coding – Shu Lin, Daniel J. Costello]. Coding theory is is the study of the properties of codes and their fitness for a specific application. Codes are used for data compression, cryptography, error-correction and more recently also for network coding. Codes are studied by various scientific disciplines—such as information theory, electrical engineering, mathematics, and computer science—for the purpose of designing efficient and reliable data transmission methods. This typically involves the removal of redundancy and the correction (or detection) of errors in the transmitted data. [Wikipedia]

Nggak pakai Alice & Bob?

Simple Finite State Machine

A good article about Finite State Machine here.

• zakimath 2:08 pm on July 31, 2012 Permalink | Reply

Wah, itu menarik sekali untuk dibahas lho, apalagi dari sisi matematisnya, bisa sampe menggunakan teori kategori dan fungtor, coba tanya bu Intan… 🙂

How to Select Cryptographic Key Size?

A good article offering guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm based cryptosystems both over finite fields and over groups of elliptic curves over prime fields.

• Joachim Strömbergson 4:01 pm on May 30, 2012 Permalink | Reply

Aloha!

Another really good paper/report is the ECRYPT II Yearly Report on Algorithms and Keylengths. Last updated in the autumn 2011 and provides up to date key size comparisons and more.

http://www.ecrypt.eu.org/

Comparison between (shift) register and logic gates

Does anybody know comparison between (shift) register and logic gates in terms of area usage and speed?

*I know this may be technology-dependent, but some kind of rough estimate would be appreciated. Thx!*

• Zalfany 4:34 pm on March 15, 2012 Permalink | Reply

I can’t understand the question. Shift register comprises of logic gates (i.e. when you want to build a shift register, you use logic gates as its building blocks), so why the need to compare between the two?

Care to clarify more of what do you mean by “shift register” and “logic gates”?

• CG 6:06 pm on March 15, 2012 Permalink | Reply

don’t bother, i already got the answer.

what i meant was how to count area complexity of a register or shift register in terms of logic gates (AND, XOR etc).

but thx for the response anyway 🙂

• Fernando 5:34 am on April 12, 2012 Permalink

Hi… I hope eveything is ok. I was wondering, how do you solve it?

• CG 9:27 am on April 14, 2012 Permalink

I made assumptions 🙂

• forextradingsystemcourse.info 7:58 pm on June 23, 2013 Permalink | Reply

port might be something you want to look into.
I know your resource site is about port but seriously.

I have seen sites like yours branch out into other
areas and its been to their benefit.

Our Poster Paper

This is our poster paper to be appeared on

Pameran Hasil Penelitian

Program Riset ITB dan Program Hibah DIKTI DIPA ITB 2011

Galeri Utama Campus Centre Timur ITB

29 – 30 November 2011

Note: We do not follow the template because the posters have been printed before we found out that there is a template! 🙂

So let us present our research in contemporary design 😀

Drawing Elliptic Curve with Geometer Sketchpad

Point Doubling:

Associative:

[*Note: Big thanks for Fajar Yuliawan for his brilliant tutorial 😉 ]

• Budi Rahardjo 2:39 pm on November 4, 2011 Permalink | Reply

yay! good stuff …

Learning Information Theory

I took a course on Information Theory years ago when I was taking master degree and completely forgot about everything when I need to learn it quickly to use the theory to support my arguments for an cryptographic issues.

I read some books that only caused more desperation, so I decided to google some introductions about information theory, and find these brilliant video tutorials:

Sometimes video tutorial seems to offer more advantages to me than reading textbooks. It’s easier to understand and does not cause dizziness or sleepiness, ha ha ah. OK now I have enough understanding to continue on writing next publication, and using information theory as one of the arguments. Yay 🙂

• CG 2:20 pm on August 19, 2011 Permalink | Reply

youtube is a great source of useful information! high-speed bandwidth is mandatory! 🙂

• jarwadi 1:48 pm on August 19, 2011 Permalink | Reply

cg’s hand writing …

• CG 2:22 pm on August 19, 2011 Permalink | Reply

is it decipherable? 🙂

• andika 8:12 pm on August 19, 2011 Permalink

kok mirip tulisan tangan BR ya?

• CG 4:42 pm on August 20, 2011 Permalink

mas andika: bagusan tulisan saya, hihihihhh tapi mudah2an artinya saya nantinya bisa sehebat BR dan lulus s3 *hloh

• amirul 1:52 pm on August 19, 2011 Permalink | Reply

bingung bos..

Setting up curves with different numbits for ElGamal

This book and the software is very useful for doing experiments of encrypting using elliptic curve cryptography. I’ve been reading some thread with questions on how to change curve parameters, and here’s how:

To change the number of bits, you have to set it in field2n.h

Choose the polynomial irreducible in polymain.c

Set the message to be encrypted in elgamal.c (important note: the length of the message depends on the numbits of the curve)

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