Elliptical curve cryptography (ECC)
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
computer science crazy
Super Moderator

Posts: 3,048
Joined: Dec 2008
22-09-2008, 09:37 AM

ECC is a public key encryption technique based on elliptic curve theory. ECC can be used to create faster, smaller and more efficient cryptographic keys. It generates keys through the properties of the elliptic curve equation rather than the traditional method of generation, as the product of very large prime numbers. This technology can be used in conjunction with most of the public key encryption methods such as RSA and Diffie-Hellman.

ECC can yield a level of security with a 164-bit key compared with other systems that require a 1,024-bit key. Since ECC provides an equivalent security at a lower computing power and battery resource usage, it is widely used for mobile applications. ECC was developed by Certicom, a mobile e-business security provider and was recently licensed by Hifn, a manufacturer of integrated circuitry and network security products. Many manufacturers, including 3COM, Cylink, Motorola, Pitney Bowes, Siemens, TRW and VeriFone have incorporated support for ECC in their products .
Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
computer science topics
Active In SP

Posts: 610
Joined: Jun 2010
29-06-2010, 12:58 AM

Elliptical Curve Cryptography
Elliptical curve cryptography (ECC) is a public key encryption technique based on elliptic curve theory that can be used to create faster, smaller, and more efficient cryptographic keys. ECC generates keys through the properties of the elliptic curve equation instead of the traditional method of generation as the product of very large prime numbers. The technology can be used in conjunction with most public key encryption methods, such as RSA, and Diffie-Hellman. ECC can yield a level of security with a 164-bit key that other systems require a 1,024-bit key to achieve. Because ECC helps to establish equivalent security with lower computing power and battery resource usage, it is becoming widely used for mobile applications. ECC was developed by Certicom, a mobile e-business security provider, and was recently licensed by Hifn, a manufacturer of integrated circuitry and network security products. Many manufacturers, including 3COM, Cylink, Motorola, Pitney Bowes, Siemens, TRW, and VeriFone have included support for ECC in their products.
Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
Active In SP

Posts: 1,124
Joined: Jun 2010
13-10-2010, 10:11 PM

.ppt   Cryptography.ppt (Size: 121 KB / Downloads: 392)


Secret Key Cryptography
Key Exchange
Public Key Cryptography
Digital Signatures
Internet applications


Scenario: Alice wants to send a message (plaintext p) to Bob. The communication channel is insecure and can be eavesdropped by Trudy. If Alice and Bob have previously agreed on an encryption scheme (cipher), the message can be sent encrypted (ciphertext c)

What is a good cipher?
What is the complexity of encrypting/decrypting?
What is the size of the ciphertext, relative to the plaintext?
If Alice and Bob have never interacted before, how can they agree on a cipher?

Traditional Cryptography

Ciphers were already studied in ancient times
Caesar’s cipher:
replace a with d
replace b with e
replace z with c
A more general monoalphabetic substitution cipher maps each letter to some other letter.
seminar class
Active In SP

Posts: 5,361
Joined: Feb 2011
19-03-2011, 04:07 PM

Ayesha Farhin

.ppt   18816402-Cryptography.ppt (Size: 491 KB / Downloads: 78)
Cryptography considered as a branch of both mathematics and computer science.
Affiliated closely with information theory, computer security, and engineering.
 Cryptography comes from the Greek words Kryptos, meaning hidden, and Graphen, meaning to write.
 Thus Cryptography is the study of secret (crypto-) writing (-graphy)
 Cryptography deals with all aspects of secure messaging, authentication, digital signatures, electronic money, and other applications.
 The practitioner of Cryptography is called Cryptographer
Cryptography Through History
 Cryptography has a history of at least 4000 years.
 Ancient Egyptians enciphered some of their hieroglyphic writing on monuments.
 Ancient Hebrews enciphered certain words in the scriptures.
 2000 years ago Julius Caesar used a simple substitution cipher, now known as the Caesar cipher.
 Roger Bacon in the middle ages described several methods in 1200s.
 Geoffrey Chaucer included several ciphers in his works (e.g. Canterbury Tales).
 Leon Alberti devised a cipher wheel, and described the principles of frequency analysis in the 1460s.
 Blaise de Vigenère published a book on cryptology in 1585, & described the polyalphabetic substitution cipher.
 Increasing use, especially in diplomacy & war over centuries.
Areas of Study
Computer Security:
Cryptanalysis, Cryptology, Cryptography
Cipher Text
 The study of principles and methods of transforming an unintelligible message back into an intelligible message without knowledge of the key is called Cryptanalysis.
 Also called “code breaking” sometimes.
 Practitioners of cryptanalysis are cryptanalysts.
 Cryptology is the branch of mathematics that studies the mathematical foundations of cryptographic methods.
 Cryptology is actually the study of codes and ciphers.
 Cryptology = both cryptography and cryptanalysis
 In cryptographic terminology, the message is called plaintext or cleartext.
 Encoding the contents of the message in such a way that hides its contents from outsiders is called encryption.
 A method of encryption and decryption is called a cipher - The name cipher originates from the Hebrew word "Saphar," meaning "to number.”
 The encrypted message is called the ciphertext.
 The process of retrieving the plaintext from the ciphertext is called decryption.
 Encryption and decryption usually make use of a key, and the coding method is such that decryption can be performed only by knowing the proper key.
The Key
 All modern algorithms use a key to control encryption and decryption; a message can be decrypted only if the key matches the encryption key.
 The key used for decryption can be different from the encryption key, but for most algorithms they are the same.
seminar ideas
Super Moderator

Posts: 10,003
Joined: Apr 2012
30-04-2012, 04:29 PM

Elliptical curve cryptography (ECC)

.ppt   KrishanGupta-EllypticCurve.ppt (Size: 120.5 KB / Downloads: 83)


ECC was introduced by Victor Miller and Neal Koblitz in 1985.
For DSA, RSA we need larger key length.
ECC requires significantly smaller key size with same level of security.
Benefits of having smaller key sizes : faster computations, need
less storage space.
ECC ideal for constrained environments : Pagers ; PDAs ;
Cellular Phones ; Smart Cards

ECC Key Validation

A public key Q = (xQ,yQ) associated with a domain parameter
(q, a, b, G, n, h) is validated for an entitiy A using the following
procedure :

Check that Q O
Check that xQ and yQ are properly represented elements of GF(q).
Check that Q lies on the elliptic curve defned by a and b.
Check that nQ = O.

Elliptic Curve Digital Signature Algorithm (ECDSA)

Proposed by Abdalla, Bellare and Rogaway in 1999.
Entity A has domain parameters D = (q, a, b, G, n, h) and
public key QA and private key dA. And entity B has authentic
copies of D and QA.
 To sign a message m, A does the following:
Select a random integer k from [1,n-1].
Compute kG = (x1,y1) and r = x1 mod n. If r = 0 then go to step 1.
Compute k-1 mod n. Compute e = SHA-1(m).
Compute s = k-1{e + dA . r} mod n.
If s = 0 then go to step 1.
A's signature for the message m is (r, s).

seminar flower
Super Moderator

Posts: 10,120
Joined: Apr 2012
18-08-2012, 11:13 AM

Elliptical curve cryptography (ECC)

.doc   ELLIPTICAL-CRYPTO.doc (Size: 1.46 MB / Downloads: 764)


Sensor networks have applications in many areas, such as military, homeland security, health care, environment, agriculture, manufacturing, and so on. Most previous work on sensor networks considered homogeneous sensor networks, i.e., all sensor nodes have the same capability in terms of communication, computation, energy supply, storage space, reliability, etc. However, a homogeneous ad hoc network has poor fundamental limits and performance. Use of heterogeneous nodes in sensor networks is not new. Recently deployed sensor network systems are increasingly following heterogeneous designs, incorporating a mixture of sensors with widely varying capabilities.


Security is critical to sensor networks deployed in hostile environments, such as military battlefield. Security issues in homogeneous sensor networks have been extensively studied. Key management is an essential cryptographic primitive upon which other security primitives are built. Several key management schemes have been proposed for homogeneous sensor networks. In [9], Eschenauer and Gligor first present a key probabilistic pre-distribution scheme for key management in sensor networks. Later, a few other key pre-distribution schemes (e.g., [10~13]) have been proposed. Probabilistic key pre-distribution is a promising scheme for key management in sensor networks. To ensure the scheme works well, the probability that each sensor has at least one shared key with a neighbor sensor (referred to as key-sharing probability) should be high.


In Most existing key management schemes for sensor networks are designed to establish shared keys for all pairs of neighbor sensors, no matter whether they communicate with each other or not, and this causes large overhead. To achieve better security and performance, we adopt a Heterogeneous Sensor Network (HSN) model.


Probabilistic key pre-distribution is a promising scheme for key management in sensor networks. To ensure the scheme works well, the probability that each sensor has at least one shared key with a neighbor sensor (referred to as key- sharing probability) should be high. For the key pre-distribution scheme, each sensor randomly selects its key ring from a key pool of size P. When the key pool size is large, each sensor needs to pre-load a large number of keys to achieve a high key-sharing probability. For example, when P is 10,000, each sensor needs to pre-load more than 150 keys for a key sharing probability of 0.9 [9]. If the key length is 256 bits, then 150 keys require a storage space of 4,800 bytes. Such a storage requirement is too large for many sensor nodes. For example, a smart dust sensor [14] has only 8K bytes of program memory and 512 bytes of data memory. The above discussion shows that many existing key management schemes (e.g., [9-13]) require a large storage space for key pre-distribution and are not suitable for small sensor nodes.


In Proposed System, we propose a novel routing-driven key management scheme, which only establishes shared keys for neighbor sensors that may communicate with each other. Recent work has demonstrated the feasibility of implementing Elliptic Curve Cryptography on small sensor nodes. We utilize Elliptic Curve Cryptography to design an efficient key management scheme for HSN. The performance evaluation and security analysis show that our key management scheme can provide better security with significant saving on sensor storage space and energy consumption than some existing key management schemes.


What is Java?

Java is an object oriented programming language developed by Sun Microsystems. Modeled on C++, java was designed to be small, simple and portable across platforms.
Java is also unusual in that each Java program is both compiled and interpreted. With a compiler, you translate a Java program into an intermediate language called Java byte codes--the platform-independent codes interpreted by the Java interpreter. With an interpreter, each Java byte code instruction is parsed and run on the computer. Compilation happens just once; interpretation occurs each time the program is executed. This figure illustrates how this works.
Every Java interpreter, whether it's a Java development tool or a Web browser that can run Java applets, is an implementation of the Java VM. The Java VM can also be implemented in hardware.

Java programs fall into two categories:


It is a program that we can execute from any operating system prompt. A special kind of application known as a server serves and supports clients on a network. Examples of servers include Web servers, proxy servers, mail servers, print servers, and boot servers. Another specialized program is a servlet. Servlets are similar to applets in that they are runtime extensions of applications. Instead of working in browsers, servlets run within Java servers, configuring the server.


It is a java program that executes inside a web page. It requires a java enabled browser which requires an interpreter. Applets are commonly used to enhance the interactivity of a web page, and deliver client-side content. Applets run in their own frame, and can display graphics, accept input from GUI components, and even open network connections. Due the potential security risks associated with running applets from external and potentially malicious sources, most web browsers limit file access, and impose additional restrictions on applets.
Stand-alone applications have no such restrictions, and a full range of functionality is provided for in the way of pre-written Java classes. Stand-alone applications can run as a console application (writing text to the screen or terminal window), or they can have a graphical user-interface, by opening a new window or dialog box.
The important thing required for writing stand-alone Java applications is a java compiler/interpreter. While there are commercial offerings available, such as Visual J++ and Borland JBuilder, a freely available SDK is available from Sun. It contains a compiler, interpreter, debugger.

Method overriding

Method Overriding, in object oriented programming, is a language feature that allows a subclass to provide a specific implementation of a method that is already provided by one of its super classes. The implementation in the subclass overrides (replaces) the implementation in the super class.
A subclass can give its own definition of methods which also happen to have the same signature as the method in its superclass. This means that the subclass's method has the same name and parameter list as the superclass's overridden method. Constraints on the similarity of return type vary from language to language, as some languages support covariance on return types.
Method overriding is an important feature that facilitates polymorphism in the design of object-oriented programs.
Some languages allow the programmer to prevent a method from being overridden, or disallow method overriding in certain core classes. This may or may not involve an inability to subclass from a given class.
In many cases, abstract classes are designed — i.e. classes that exist only in order to have specialized subclasses derived from them. Such abstract classes have methods that do not perform any useful operations and are meant to be overridden by specific implementations in the subclasses. Thus, the abstract superclass defines a common interface which all the subclasses inherit.


Ken Thompson and Dennis Ritchie developed UNIX in concert with the C language at Bell Telephone Laboratories, Murray Hill, New Jersey, in 1969. In 1978, Bill Joy was leading a project and implimentation at Cal Berkeley to add many new features to UNIX, such as virtual memory and full-screen display capabilities. By early 1984, just as Bill was leaving to found Sun Microsystems, he shipped 4.2BSD, commonly known as Berkeley UNIX.
4.2BSD came with a fast file system, reliable signals, interprocess communication, and, most important, networking. The networking support first found in 4.2 eventually became the de facto standard for the Internet. Berkeley’s implementation of TCP/IP remains the primary standard for communications with the Internet. The socket paradigm for interprocess and network communication has also been widely adopted outside of Berkeley.
Thinking To Register

31-03-2014, 08:33 PM

please let me know the tcl script for elliptic curve cryptography

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
Last Post: Guest
  Filter a curve with one of the mirror filter tools in HyperGraph, HyperView seminar projects maker 0 349 21-09-2013, 04:56 PM
Last Post: seminar projects maker
  CHAOTIC QUANTUM CRYPTOGRAPHY pdf study tips 0 326 09-09-2013, 03:31 PM
Last Post: study tips
  A Probabilistic Model of Visual Cryptography Scheme with Dynamic Group report study tips 0 601 05-06-2013, 01:02 PM
Last Post: study tips
  Number Theory Algorithms and Cryptography Algorithms PPT study tips 0 389 20-05-2013, 04:25 PM
Last Post: study tips
  Cryptography and Network Security Report study tips 0 512 25-02-2013, 03:36 PM
Last Post: study tips
  ppt on Cryptography study tips 0 420 14-02-2013, 10:48 AM
Last Post: study tips
  CRYPTOGRAPHY and SECURITY seminar tips 0 404 13-02-2013, 04:46 PM
Last Post: seminar tips
  Embedded Extended Visual Cryptography Schemes seminar tips 0 384 12-02-2013, 04:04 PM
Last Post: seminar tips
  SEMINAR QUANTUM CRYPTOGRAPHY pdf project girl 0 489 07-02-2013, 04:39 PM
Last Post: project girl