Computer Internet Security-a Social Evil

Only available on StudyMode
  • Topic: Cryptography, Encryption, Elliptic curve cryptography
  • Pages : 5 (1329 words )
  • Download(s) : 77
  • Published : August 3, 2011
Open Document
Text Preview
1.Information security: Information security is a term related to network security which means protecting information and its related systems (this includes system software and hardware which is used to store, transmit that information) from unauthorized access, use, modification etc. 2.Contents: As per our study on Information Security, we can categorize it into two parts-Steganography and Encryption. Steganography means hiding the information within other information by protecting both the communicating parties (sender-receiver) and the messages. As for example Sachin Tendulkar can be expressed as ST by taking two first letters from two words(Subset of two words). Encryption means protecting encoded data from interception by unauthorized users, i.e., it protects only the messages not the communicating parties. Here the terms which are co-related with Encryption are-Plain text, Cipher text, Key. Plain text means the text which are given as input in unencrypted format. Cipher text represents the output of the encrypted data in incomprehensible format. And key be the parameterized function which is used to encrypt the data known only to the sender or receiver. 3. Cryptography

Above figure (Data Encryption Standard) shows that Amit can send some private messages to Prabir by considering two algorithms - Encryption which can convert the plain text into cipher text and Decryption which can convert the cipher text into the plain text as the sender sent with the help of Secret and shared(sender and receiver) key . 4.Key Handling algorithms: Though there are mainly three types of key handling algorithms-Symmetric key, Asymmetric or Public key and Hash function, we concentrate our works on Elliptic Curve Cryptography(ECC), a geometrical representation of Public key cryptography which was proposed by Victor Miller & Neal Kolbitz in 1985 . Let the eqn be y2=x3+ax+b, a & b are constants, where 4a3+27b2 ≠ 0, each value of a & b will give different curves. A pt. on the curve represents public key and a random no. is private key. This random number can be generated by different types of operations-Scalar multiplication, Addition, Point doubling etc. 5.Domain of research : There are so many domains in ECC - Scalar Multiplication, Lightweight Cryptography, E-payment security, Hardware/ Software implementation of ECC etc.

Scalar multiplication can be obtained by multiplying scalar k (secret key) with P and get Q. i.e., Q=kP. Here P & Q be two points on the elliptic curve. The operations are done on Galois fields through two ways -one is Galois field on prime field (GF(P)) other is on Binary field (GF(2m)). Some recent works on scalar multiplication are- reducing the execution cost by replacing field multiplication by which Secure Side Channel Attack(SSCA) can be protected, Atomicity principle(which can counter react to SSCA ) in scalar multiplication. Interesting matter is that SCA was prevented by ECC at first. But there are some unveil topics in ECC-we consider some standard curves, but there are some other curves (Lopez-Dahab, Jacobians etc) which may be consider to optimize the point multiplication. Also new multibase scalar multiplication may be consider for further research. Lightweight cryptography which is provided for pervasive devices(portable and handled devices) may be the trendy topic of ECC. For its shorter key length ECC can be used in smaller devices like RFID tags, smart card, e-passport for faster response time and low power consumption, low memory usage and low CPU utilization. But as these pervasive...
tracking img