1.

Introduction
1.1 Introduction
The key concepts on which the following project is based are anti-plagiarism
and Steganography.
Plagiarism is the "use or close imitation of the language and thoughts of
another author and the representation of them as one's own original work."
Plagiarism is not copyright infringement. While both terms may apply to a
particular act, they are different transgressions. Copyright infringement is a
violation of the rights of a copyright holder, when material protected by
copyright is used without consent. On the other hand, plagiarism is
concerned with the unearned increment to the plagiarizing author's
reputation that is achieved through false claims of authorship.
Steganography is the art of communicating a message by embedding into
multimedia data. The purpose is to send maximum hidden information while
preserving security against detection by an unauthorized person. A
Steganography system is perfectly secure when the statistics of the ‘cover
data’ (multimedia file) and ‘stegodata’ (encrypted message) are identical.
Experimental results with existing technology gave small video distortions
after hiding some information. The proposed system is aimed without losing
quality and size.
1.2 Previous Related Work

The first recorded uses of stegnography can be traced back to 440 BC when
Herodotus mentions two examples of stegnography in The Histories of
Herodotus. Demaratus sent a warning about a forthcoming attack to Greece
by writing it directly on the wooden backing of a wax tablet before applying
its beeswax surface. Wax tablets were in common use then as reusable
writing surfaces, sometimes used for shorthand. Another ancient example is
that of Histiaeus, who shaved the head of his most trusted slave and tattooed
a message on it. After his hair had grown the message was hidden. The
purpose was to instigate a revolt against the Persians.

In the past, most of the effort on stegnography has been concentrated on

various media data types such as an image, an audio file, or even a video
file. However, there is relatively little stegnography work on 3D models.
With the development of 3D hardware, 3D computing or visualization has
become much more efficient than ever. This leads to the widespread use of
3D models in various applications such as digital archives, entertainment,
Web3D, MPEG4, and game industry.
In recent years, some perceptual encryption schemes have been proposed for
G.72 speech MP3 music, JPEG images, wavelet-compressed (such as
JPEG2000) images and videos and MPEG videos. The selective encryption
algorithms proposed in can be considered as special cases of the perceptual
encryption for images compressed with wavelet packet decomposition. In
some research papers, a different term, “transparent encryption”, is used
instead of “perceptual encryption” emphasizing the fact that the encrypted
multimedia data are transparent to all standard-compliant decoders.
However, transparency is actually an equivalent of another feature called
“format-compliance” (or “syntax awareness”) which does not mean that
some partial perceptible information in plaintexts still remains in cipher
texts. In other words, a perceptual cipher must be a transparent cipher, but a
transparent cipher may not be a perceptual cipher. Generally, perceptual
encryption is realized by selective encryption algorithms with the format-
compliant feature. This paper chooses to use the name of “perceptual
encryption” for such a useful feature of multimedia encryption
algorithms.More precisely; the focus is on the perceptual encryption of
MPEG videos. After identifying some problems of the existing perceptual
encryption schemes, a more effective design of perceptual MPEG video
encryption is proposed.

1.3 Problem Statement

This project mainly aims at preventing plagiarism and piracy. Thus it secures
a video file from unauthorized copying or distribution. The motive of the
project is to reach to the source or root of plagiarism and piracy. Any video
is composed of many numbers of frames. These frames are combined to
form a complete and continuous video .The process begins at hiding a
unique key behind each and every frame of the video file. The entire process
can be implemented in the following manner:

A ready video can be broken into subsequent frames and then the key is
hidden behind each frame. Then the frames are then re-combined to form
a video.

This key is unique for each copy that is created and distributed. Once the
hiding of key behind each frame is done, the frames are converted into a
movie. It also maintains a record of the keys and the owners who bought the
CD with the corresponding key on it. It maintains a record of who (customer
name) bought the CD and the corresponding unique key associated or hidden
in it. This record helps in tracing the source of piracy.

Conclusion
F5 Algorithm
Design of Algorithm

Password Random Number Generator

Discrete F5
Cosine Embedding Inverse
Quantization Permutation Permutation
Transform function

Bitmap Quality
Message Huffma
Carrier n
Encoder

Steganogram
(JPEG)
The F5 steganographic algorithm was introduced by German researchers
Pfitzmann and Westfeld in 2001. The goal of their research was to develop
concepts and a practical embedding method for JPEG images that would
provide high steganographic capacity without sacrificing security. Guided by
their χ2 attack, they challenged the paradigm of replacing bits of information
in the cover-image with the secret message while proposing a different
paradigm of incrementing image components to embed message bits.

The F5 algorithm embeds message bits into randomly-chosen DCT

coefficient and employs matrix embedding that minimizes the necessary
number of changes to embed a message of certain length.

 Overall algorithm the same as F4.

 Extends F4 by adding two distinct features:
 Permutative straddling
  Matrix encoding

 F4 embeds the data into the next available non-zero coefficient.

 F5 will scatter the entire message throughout the carrier.
 Uses permutation to equalize the spread of embedded data.
 ALGORITHM:

• Start
• Accept an mpeg file as an input for encrypting purpose.
• Divide the movie into frames.
• Generate the key using the key generator.
• Save it in a file
• With the help of Steganography algorithm insert a compact disk [CD]
key behind the frames.

• After the inserting the key behind the frames, re-group the frames to
form the movie again.
• This movie is given as the output.
• Accept this movie as the input for decrypting purpose.
• Again divide the movie into frames.
• With the help of the Steganography algorithm derive the hidden key
from the frames.
• Stop.

2. Literature Survey
Introduction

Until modern times cryptography referred almost exclusively to encryption,

which is the process of converting ordinary information (plaintext) into
unintelligible gibberish (i.e., ciphertext).Decryption is the reverse, in other
words, moving from the unintelligible ciphertext back to plaintext. A cipher
(or cypher) is a pair of algorithms that create the encryption and the
reversing decryption. The detailed operation of a cipher is controlled both by
the algorithm and in each instance by a key. This is a secret parameter
(ideally known only to the communicants) for a specific message exchange
context. Keys are important, as ciphers without variable keys can be trivially
broken with only the knowledge of the cipher used and are therefore less
than useful for most purposes. Historically, ciphers were often used directly
for encryption or decryption without additional procedures such as
authentication or integrity checks.

In colloquial use, the term "code" is often used to mean any method of
encryption or concealment of meaning. However, in cryptography, code has
a more specific meaning. It means the replacement of a unit of plaintext (i.e.,
a meaningful word or phrase) with a code word (for example, apple pie
replaces attack at dawn). Codes are no longer used in serious cryptography
—except incidentally for such things as unit designations (e.g., Bronco
Flight or Operation Overlord) —- since properly chosen ciphers are both
more practical and more secure than even the best codes and also are better
adapted to computers.

Some use the terms cryptography and cryptology interchangeably in English,

while others (including US military practice generally) use cryptography to
refer specifically to the use and practice of cryptographic techniques and
cryptology to refer to the combined study of cryptography and cryptanalysis.
English is more flexible than several other languages in which cryptology
(done by cryptologists) is always used in the second sense above. In the
English Wikipedia the general term used for the entire field is cryptography
(done by cryptographers).

The study of characteristics of languages which have some application in

cryptography (or cryptology), i.e. frequency data, letter combinations,
universal patterns, etc. is called cryptolinguistics.

Literature Domain
Encryption is the process of converting normal data or plaintext to
something incomprehensible or cipher-text by applying mathematical
transformations. These transformations are known as encryption algorithms
and require an encryption key. Decryption is the reverse process of getting
back the original data from the cipher-text using a decryption key. The
encryption key and the decryption key could be the same as in symmetric or
secret key cryptography, or different as in asymmetric or public key
cryptography.

Algorithms

A number of encryption algorithms have been developed over time for both
symmetric and asymmetric cryptography. The ones supported by the default
providers in J2SE v1.4 are: DES, TripleDES, Blowfish,
PBEWithMD5AndDES, and PBEWithMD5AndTripleDES. Note that these
are all symmetric algorithms.

DES keys are 64 bits in length, of which only 56 are effectively available as
one bit per byte is used for parity. This makes DES encryption quite
vulnerable to brute force attack. TripleDES, an algorithm derived from DES,
uses 128-bit keys (112 effective bits) and is considered much more secure.
Blowfish, another symmetric key encryption algorithm, could use any key
with size up to 448 bits, although 128-bit keys are used most often. Blowfish
is faster than TripleDES but has a slow key setup time, meaning the overall
speed may be less if many different keys are used for small segments of data.
Algorithms PBEWithMD5AndDES and PBEWithMD5AndTripleDES take
a password string as the key and use the algorithm specified in PKCS#5
standard.
Program Language Features
The project is implemented using JAVA as front end.
Introduction to Java
The java language was developed by sun Microsystems in 1992.sun begin a
project to run TV&VCR sets, interactive TV and VCR .in 1991, a group of
Sun Engineers, led by Patrick Naught on and Sun fellow James Gosling
wanted to design a small language which could be for interactive consumer
devices. In September 1992, the James Gosling office. However, since there
was already a language name “Oak” existing, Sun named it Java. It is a
trademark of Sun Microsystems.
Sun released the first version of java in early 1996. Java 1.3 a couple of
months followed it later. In 1998,Sun Microsystems released the latter
version as Java 1.3,which replaces the early toy-like GUI and graphics
toolkits with sophisticated and scalable versions that come closer to the
promise of “Write once, Run anywhere!” then their predecessors.
Features
 Java is one of the easiest programming languages in the
world now.
 Java is Object Oriented Language.
 Java is portable and architecturally neutral.
 Java is Distributed Language.
 Java provides high security
 Java is robust
 Java is a Multithread Langua
3. System Design

Introduction

The design phase is the one, where the technical problems are really
solved that makes the project a reality. In this phase the relationship of
the code, database, user interface, and classes begin to take shape in
the minds of the project team.

Use Case Diagram

ENCRYPTING

USER
DECRYPTING
Form Design

Main Form

×
FILE OPTIONS

VIDEO SECURITY
 Select Options Screen

Generate Key

Embedding

Generate Key

Generate Key

Close

Main Process window

Select Video Frames Browse Data hide Retrieve

Select key file Browse

Activity diagram

SELECT OPTIONS

ENCRYPTING DECRYPTING

SELECT VIDEO FRAMES

SELCT ENCRYPTED
VIDEO FRAMES

ENTER KEY

EXTRACT KEY

VIEW ENCRYPTED FILE

Sequence Diagram

ENCRYPTING DECRYPTING

user

SELECT VIDEO FRAMES SELECT ENCRYPTED VIDEO

FRAMES

Enter key
EXTRACT KEY

Display Process completed Process completed

DECRYPTED VIDEO
ENC RYPTED FILE
 System Requirements

HARDWARE CONFIGURATION:
PROCESSOR : PENTIUM IV
HARD DISK CAPACITY : 40 GB
INTERNAL MEMORY CAPACITY : 128 MB

SOFTWARE CONFIGURATION:

OPERATING SYSTEM : WINDOWS XP

FRONT END : JDK1.6.0
JMF
 Conclusion

The system is highly scalable and user friendly. Almost all the system
objectives have been met. The system has been tested under all criteria. The
system minimizes the problem arising in the existing manual system and it
eliminates the human errors to zero level.
All phases of development were conceived using methodologies. The
software executes successfully by fulfilling the objectives of the project.
Further extensions to this system can be made required with minor
modifications.
Module Description

The project contains following modules

1. Main module
2. Select Options
3. Generate key
4. Embedding

Brief Description
1. Main Module
This module provides the user interface to start the project
It is a frame with menu bar with menus for selecting options
and exiting from the software
2. Select Options
This module provides with two options
Generate Key
Embedding
3. Generate Key
This module is used to generate the key. The key is displayed in
a textbox and saved in a file (“key.txt”)
4. Embedding
 This module provides the user interface for selecting the video
file and dividing it into frames and hiding key inside the
frame .Also a retrieve button is added to extract data from the
video.

4 Future Work

The project hides the key behind the frames and the the key is extracted

In future , the concept can be expanded to maintain a database of the keys

with name of persons registered for it.
This can help in finding out the person responsible for piracy.

5. References

Books
[1] Patrick Naughton, Herbert Schildt, “Java™ 2: The Complete Reference”,
Third Edition, Tata McGraw-Hill Publishing Company Limited.
[2] David Flanagan, “Java in a Nutshell”, 2nd Edition, May 1997

[3] Dietel & Deitel, Java How to Program, BPB Publishers, New Delhi,
2000.

[4] O’reilly, Java Swings, Tata McGraw Hill, Fifth Edition, 2002.
[5] Broukshickle, Thinking in Java, Calgotia Publishers, New Delhi, 2001