Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Chapter 1
INTRODUCTION
1.1 Preface
1.2 Statement of the problem
1.3 Organization of report
1. INTRODUCTION
An image (from Latin imago) is an artifact, usually two-dimensional (a picture), that has
a similar appearance to some subject—usually a physical object or a person.
The word image is also used in the broader sense of any two-dimensional figure such as a
map, a graph, a pie chart, or an abstract painting. In this wider sense, images can also be
rendered manually, such as by drawing, painting, carving, rendered automatically by
printing or computer graphics technology, or developed by a combination of methods,
especially in a pseudo-photograph.
A volatile image is one that exists only for a short period of time. This may be a
reflection of an object by a mirror, a projection of a camera obscura, or a scene displayed
on a cathode ray tube. A fixed image, also called a hard copy, is one that has been
recorded on a material object, such as paper or textile by photography or digital
processes.
Still image
A still image is a single static image, as distinguished from a moving image (see below).
This phrase is used in photography, visual media and the computer industry to emphasize
that one is not talking about movies, or in very precise or pedantic technical writing such
as a standard. A film still is a photograph taken on the set of a movie or television
program during production, used for promotional purposes.
A still image of a person's face from many years ago can only tell us about the face, not
what the person is feeling at the time of the photograph (1997:46). Therefore we can only
guess what they are thinking, and come up with our own conclusions about the image.
When a person visits the video store and wants to borrow a movie, the first thing they
may often look at is the image on the case. The phrase Never judge a book by its cover is
often said, however it is a common technique that is used to determine what we choose is
worth looking at and what is not.
Moving image
A moving image is typically a movie (film), or video, including digital video. It could
also be an animated display such as a zoetrope. Paul Levinson states that, 'moving
pictures are individual photographic images presented to the eye so quickly that they give
the illusion of motion.' (1997:37)These means that it gives people a real life encounter of
a person's experience. With a video camera, a person is able to capture many moments in
time, unlike the still image.
This method is where the context of the image is altered. Objects are be removed or
added, for example, a person can be added or removed. The easiest way is to cut an
object from one image and insert it into another image – image editing software makes
this a simple task
the forged area visually because the original and copied parts of the foliage bear a
suspicious similarity. Figure 2 shows another Copy-Move forgery that is much harder to
identify visually. This image has been sent to the authors by a third party who did not
disclose the nature or extent of the forgery. We used this image as a real-life test for
evaluating our detection tools. A visual inspection of the image did not reveal the
presence of anything suspicious.
Figure 2 Forged test image “Jeep” (above) and its original version (below).
Chapter 2
LITERATURE SURVEY
2.1 Existing Methods
Chapter
2.2 2 Method
Proposed
LITERATURE SURVEY
2.1 Existing Methods
2.2 Proposed Method
The SHA hash functions are a set of cryptographic hash functions designed by the
National Security Agency (NSA) and published by the NIST as a U.S. Federal
Information Processing Standard. SHA stands for Secure Hash Algorithm.
The Three algorithms are denoted SHA-1, SHA-224, SHA-256.
These algorithms enable the determination of a message’s integrity
– any change to the message will, with a very high probability, result in a
different message digest
– This property is useful in the generation and verification of digital
signatures and message authentication codes, and in the generation of
random numbers (bits).
The words of the message schedule are labeled W0, W1,…, W63. The eight
working variables are labeled a, b, c, d, e, f, g, and h. The words of the hash value are
Chapter 3
labeled H0(i) ,H1( i)…… H(7)( i) ,which will hold the initial hash value, H(0), replaced by each
successive intermediate hash value (after each message block is processed), H(i), and
REQUIREMENT ANALYSIS AND
ending with the final hash value, H(N). SHA-256 also uses two temporary words, T1 and T2.
SPECIFICATION
3.1 Requirement Analysis
3.2 Requirement Specification
3.3 Functional & Non- Functional Requirements
Chapter 3
1. Reliability.
2. Availability.
3. Security.
4. Maintainability.
5. Portability
3.4 Hardware and Software Requirements
Hardware requirements:
RAM: 256mb
Hard disk: 100mb
Processor: Intel Pentium 4 processor
Processor speed: 1.3GHz
Software Requirements:
Chapter 4
SYSTEM DESIGN
Chapter 4
SYSTEM DESIGN
Basic Considerations
Algorithm
In this section a brief overview of the system design process is given. The design process
can be divided into the following sub sections.
In the design process, certain basic considerations were made which were
found to be essential, in order to design the system successfully.
• The Image should be of colour level..
• Images with jpg,bmp format are considered.
• Images are considered as array of pixels.
4.2 Algorithm
SHA-1 is the best established of the existing SHA hash functions, and is
employed in several widely used security applications and protocols. In 2005, security
flaws were identified in SHA-1, namely that a possible mathematical weakness might
exist, indicating that a stronger hash function would be desirable. Although no attacks
have yet been reported on the SHA-2 variants, they are algorithmically similar to SHA-1
and so efforts are underway to develop improved alternatives.
Slide attacks against block ciphers were introduced by Biryukov and Wagner in
1999 [4, 5], although similar techniques had previously been used by others.
To our knowledge, slide attacks against hash functions have not been previously
considered in the literature. Indeed it is difficult to see if and how “slid pairs” in the
compression function can be exploited to find collisions for the hash function. This
remains an open question.
However, it is interesting to consider the question whether or not slid pairs (which
are essentially linear relations between two inputs and outputs) can be easily found for
SHA-1. This is also related to Anderson’s classification of hash functions [1]. David
Wagner has considered a slide attack on 40 iterations of SHA-1 in unpublished work
[21]. SHA-1 exhibits some properties which are useful when mounting slide attacks. a)
The SHA-1 compression function consists of four different “rounds”. For 20 iterations of
each round the nonlinear function Fi and the constant Ki are unchanged there are only
three transitions between different iteration types (see Figure 1). b) The key schedule (i.e.
message expansion) can be slid.
We simply choose
W′i =Wi+1 for 0 _ i _ 14 andW′15 = (W1 _W7 _W12 _W15)n1. It is easy to see that
after the key expansion = Wi+1 for 0 _ x _ 78.
Thus the constant (K0/K20) is canceled out in both cases and a round collision occurs.
Similarly, for iteration pair 39/40 (parity-majority transition) we use:
IMPLEMENTATION
5.1 Tools Used
5.2 Organization of Source code
5.3 Implementation Details
5.4 Menu Structure
Chapter 5
IMPLEMENTATION
Basic Steps:
• Step1: Padding
• Step2: Appending length as 64 bit unsigned
• Step3: Initialize MD buffer 5 32-bit words
Store in big endian format, most significant bit in low address
A|B|C|D|E
A = 67452301
B = efcdab89
Dept Of CS&E, SJCE Mysore. 20
Project Detection Of Forged Image
C = 98badcfe
D = 10325476
E = c3d2e1f0
• Step 4: the 80-step processing of 512-bit blocks – 4 rounds, 20 steps each.
Each step t (0 <= t <= 79):
– Input:
• Kt – a constant.
– Output:
.NET
.NET is software that includes everything required for developing software for
web services. It integrates presentation technologies, component technologies and data
technologies on a single platform so as to enable users to develop Internet applications as
easily as on desktop systems.
.NET wraps the Windows operating system, via a class library with the largest
functionality created to date, in effect permitting an object-oriented interaction with the
operating system.
.NET framework
The .Net framework provides an environment for deploying and running web
services and other application. It consists of three distinct technologies as given.
Fewer bugs.
Chapter 6
The testing process involves the process of feeding in test data and getting the
output. In this process there may be any error that will be discovered. These errors are to
be corrected and tested again. This is an iterative process. The process is continued till all
the test cases yield positive results. The objective of testing is mainly based on the fact
that when testing is carried out some undiscovered error might be detected.
The common view is to eliminate program errors. This sometimes may be very
difficult, time consuming and there cannot be cent percent accuracy in the design. All that
can be done is to put the system through a “Fail Test” cycle and determine what will
make the system to fail. Hence a successful test is that one that finds an error.
6.2 Results
Front End
Chapter 7
LIMITATIONS, FUTURE
ENHANCEMENTS AND AREAS OF
APPLICATIONS
7.1 Limitations
7.2 Areas of Applications
Chapter 7 Enhancements
7.3 Future
LIMITATIONS, FUTURE
ENHANCEMENTS AND AREAS OF
APPLICATIONS
7.1 Limitations
7.2 Future Enhancements
7.3 Areas of Applications
7.1 Limitations
When accomplishing a project, that too within limited time span, limitations are
inevitable. Meanwhile, the same applies to our project. There are certain limitations; we
have considered accomplishing the project successfully.
Here in our project, we can only detect the forgery of an image if we have
another reference image to verify. A image is stored in the database, which is
cross checked against the given image.
Only the static image forgery can be detected, not the active forgery.
The project so implemented can be used only for offline, but not for online.
7.2 Applications
• We can detect the forgery of images by comparison.
• Forensic applications
• Check authentication.
• Pixel by pixel comparison.
• More than one type of forgery can be detected by enhancing the project.
• Skilled image forgery detection can be done.
Chapter 8
CONCLUSION
8. Conclusion
Digital image forgeries can be used to deceive the public and the authorities.
They are here to stay.
Until non destructible/ non removal digital watermarks are perfected, passive
authentication will remain necessary.
Currently no single passive authentication technique can detect all types of digital
forgeries.
References
2. “Methods for "Methods for Tamper Detection in Digital Images", Proc. ACM
Workshop on Multimedia and Security, Orlando, FL, October 30−31, 1999, pp. 19−23.
5. http://en.wikipedia.org
6: http://www.howstuffworks.com
7: http://www.reference.com