Proceedings oI International ConIerence on Computing Sciences

WILKES100 ICCS 2013

ISBN: 978-93-5107-172-3
A secure avenue to satellite image encryption and authentication
with ECC & voice components (MFCC, Pitch)
Vikas Pardesi
1
* and Aayush Agarwal
2

1
Assistant Professor, Department of Computer Science and Engineering, Lovely Professional University, Phagwara, 144402, PB, India
2
Assistant Professor, Department of Computer Science and Engineering, Rafshiri Institute of technologv, Bareilv, India
Abstract
Speech Processing is an area in which we can Iind such unique components (Mel Frequency Cepstrum CoeIIicients, Pitch
value, zero crossing rates etc.) in voice segment Ior recognition oI any individual and pre-processing Ior Iurther synthesis. In
this paper it is presented a easy and secure approach to satellite image authentication with MFCC (Mel Frequency Cepstrum
CoeIIicients) and Pitch and image Encryption through Elliptic Curve Cryptography. Because oI ECC great advantages (small
key size, no solution to discrete logarithmic problem) Ior handheld, portable devices. Applying MFCC and Pitch with various
methods on various encrypted images which is encrypted by Elliptic Curve Cryptography and at the receiver side we do
reverse process oI this approach Ior authentication and decryption oI image .With this approach authentication is being done
oI an image through voice segment which is advantageous because speech is a natural way to interact with people, Not
required to sit and work with a keyboard and Iinally no speciIic training is required Ior end users.
2013 Elsevier Science. All rights reserved.
Keywords: Elliptic curve cryptography, MFCC, Pitch value, public key cryptography, Speech Processing
1. Introduction
Today, in this inIormation era we are just totally dependent on the computers, internet and such other
inIormation technology. Security is a very small term to understand but it is very diIIicult to implement a better
security approach in transIerring oI the data. In area oI inIormation security |1| there are many algorithms and
techniques which is being used Ior secure transIerring oI the data like data encryption standard |1|, elliptic curve
cryptography |2| and RSA |1| technique. Apart Irom this iI talking about speech processing |3| area then it
should be no hyperbole that it is a very vast area Ior research. Speech is biometric Ior human being that is Ireely
available to every individual. Speech oI any individual has many properties such as it is a unique Ieature oI every
individual, processing oI speech is very easy, easy input given method (no need oI computer keyboard Ior
inserting data).
In this paper it is described secure approach to image security through Elliptic curve cryptography and voice
components (MFCC |4| & Pitch |4|), Iirst it is seen that how a voice can be helpIul Ior processing oI images in
secure environment. Any human being speech or voice has many unique properties or we can say components
such as Mel Frequency Cepstrum CoeIIicients |4|, Pitch oI voice |4|, Iundamental Irequency |4|, Iundamental
Iormants |4|, linear predictive coeIIicients |4|, Cepstrum coeIIicients, line spectral Pairs, 2-D, 3-D-spectrogram
etc. now main motive is to Iind the Mel Irequency Cepstrum coeIIicients and pitch value through best approach.
Mel Irequency Cepstrum can be deIined as the short time power spectrum |16| oI a speech signal. It can be
calculated as linear cosine transIorm oI the log power spectrum on a nonlinear Mel scale oI Irequency. Mel
Irequency Cepstrum coeIIicients are the unique Ieatures that can be acquired Irom the voice segment.
174 Elsevier Publications, 2013
*Corresponding Author: Vikas Pardesi
Vikas Pardesi and Aayush Agarwal
2595*log(1 )
700
F
MelFrequency = +
.(1)
As in equation (1) Where F is the linear Irequency. Procedure and method is given in separate section in detail
to calculate Mel Irequency Cepstrum coeIIicients. Pitch oI any human being`s voice is also unique Ieature. Voice
speech is generated when the excitation comes Irom a periodic pulse train generated by vocal cords |15|. These
vocal cords vibrate with their natural Irequency oI vibration like a tuning Iork and generate pulses at regular
interval. A speech signal consists oI diIIerent Irequencies which are harmonically related to each other in the
Iorm oI a series. The lowest Irequency oI this series is known as the Iundamental Irequency or pitch Irequency.
Pitch calculation can be done with Iour method (1) Autocorrelation method |6|, Average Magnitude diIIerence
method |6|, these methods were in time domain (2) Parallel processing approach |6|, (3) pitch period using
spectral domain |6| or Irequency domain, (4) pitch period using Cepstrum domain. For example With Auto-
correlation method
. Rxx=
2
0
( )* ( )
lim
2 1
N
i
N w
a i a i k
N
=

+
+

...(2)
As in equation (2) Where a(i) is the sample number and k is the interval and N is the total number oI samples,
Rxx is the resultant.
Now we will see a brieI introduction to encryption and decryption oI image. In encryption method we are
taking those points which are satisIying the elliptic curve, Irom these points we take one point AF(x, y) which is
aIIine point and a base point BP(x, y). Base point is the smallest (x, y) point i.e., satisIying the Elliptic curve
y2x3axb where 4a327b2=0. Each value oI a` and b` can give a diIIerent curve. We take one aIIine point
and then we take each pixel value one by one onto image. Now perIorm point multiplication operation with two
entity i.e., pixel value and aIIine point SPI*AF(x, y). Where PI is pixel value. In Elliptic Curve Cryptography
point multiplication is the basic operation which consists oI two operation point addition & point doubling. AIter
multiplication operation a point is achieved i.e. cipher text as N*BP(x, y)} where N is the random number and
BP is the base point and (x, y) one point we get aIter multiplication. Ultimately we get our Cipher Text CTT
(x1, y1), (x2, y2)} Where (x1,y1) we got Irom N and BP multiplication and (x2, y2) is (S N*PKB) where
SPI*AF and PI is scalar value i.e. pixel value and AF is aIIine point. And N is a random number and PKB is
public key oI user B so at last we got encrypted message in co-ordinate Iormat, namely (N*BP, S N*PKB).
In Decryption oI the encrypted Image, use the private key oI the user B i.e. PRK
B
on the Iirst element i.e.
N*BP. This will be subtracted Irom the other term (SN*PK
B
) to recover the S. In last apply Discrete
Logarithmic problem |7| to recover our pixel value i.e., P
I
.Due to using discrete logarithmic approach it is also
advantageous that no solution till now Iound Ior breaking this. Biggest use oI the ECC in security due to it`s
smallest key.
2. Concept of extraction the MFCC Feature through Voice Segment
In Auditory System as a Iilter bank gives a clear indication that critical band Iilters must be Iormed but the shape and the
structure oI the Iilter is not clear. Two commonly used Irequency scales they are bark scale |13| and Mel scale |13|, here we
describes about Mel Irequency and Mel scale. Basis oI the Mel scale is pitch perception and Iilter is used in this i.e., triangular
Iilter. The scale is linear below 1000 Hz and non-linear (logarithmic) above 1000 Hz. We can convert normal Irequency to
Mel Irequency with Iormula Mel Irequency2595*log (1linear Irequency/700).
175 Elsevier Publications, 2013
A secure avenue to satellite image encryption and authentication with ECC & voice components (MFCC, Pitch)
Fig-1.1 Mapping oI Irequency in Mel Scale
Now Mel Irequency Cepstrum can be described as the short time power spectrum oI a speech segment,
which can be computed as linear cosine transIorm oI the log power spectrum on a non-linear Mel scale oI
Irequency. MFCC are the coeIIicients we got in the MFC representation. Now consider about the diIIerence
about Cepstrum |9| and MFC, in MFC Irequency band are equally spaced on the Mel scale. Mel scale
approximates the human auditory response very much closed to than the linearly-spaced Irequency bands used in
the case oI spectrum. Mel scale wrap up the Irequency and allows better representation similar to the human
auditory system.
Procedure for calculating the Mel frequency Cepstrum coefficients:
Take the FFT |14| (Iast Fourier transIorm oI a windowed signal).calculate its squared magnitude i.e.,
power spectrum.
Pre analysis the spectrum to approximate the unequal sensitivity oI human hearing at diIIerent
Irequencies.
Combined the power spectrum within the overlapping critical band Iilter response. This integration is
being done through triangular overlapping windows called Mel Iilters. This reduces the Irequency
sensitivity over the original spectral estimate; basically on higher Irequencies are analyzed because oI
the wider band.
Compress the spectral amplitude by taking log. Optionally the combination oI log power spectrum |8|
may be done.
Take the IDFT (inverse discreet cosine transIorms). This gives the cepstral coeIIicients.
PerIorm spectral smoothing this is achieved by the truncating the spectrum, lower 12 or 14 coeIIicients
are used out oI 20 or more coeIIicients.
Algorithm-
Step-1 open the audio voice segment with FOpen()command;
Step-2 Read this voice segment with Fread ();
Step-3 Iix the number oI samples as you required and Iind FFT oI this segment oI voice.
Step-4 Find the log oI the previous step output.
Step-5 Ior 1 to sample number
Convert linear Irequency to Mel Irequency
Step-6 using Iunction melcepst() Ior Iinding the Mel Irequency Cepstrum coeIIicients.
Generally our speech does not Iollow linear way so this natural Irequency we have to convert into Mel
Irequency or in any kind oI Irequency on which we can do analysis or synthesis oI our speech signal. Above we
discussed how can we convert our normal Irequency to Mel Irequency and also that how can we Iind the Mel
Irequency Cepstrum coeIIicients.
0 2000 4000 6000 8000 10000 12000
0
1000
2000
3000
4000
5000
6000
7000
8000
mapping of frequency in Hz to Mel scale
frequency in Hz
M
e
l

f
r
e
q
u
e
n
c
y
176 Elsevier Publications, 2013
Vikas Pardesi and Aayush Agarwal
3. Find Pitch Value from Voice Segment
There are diIIerent Irequencies in the speech signal which are periodically related to each other in a manner.
The lowest Irequency oI this series is known as the pitch Irequency or Iundamental Irequency. Basic Irequency oI
the vibrations oI the vocal cords is called pitch Irequency. vocal cords generate this Irequency in the Iorm oI
periodic excitation passes via the vocal tract Iilter and become convolved with the impulse response oI the Iilter
to produce a voice or speech signal because speech is a convolved signal. The number oI samples aIter which the
waveIorm repeats itselI will reveal the pitch period in terms oI number oI samples. We can also Iind the time
corresponding to these samples and calculate the inverse oI time period then we get Irequency in Hz.in time
domain main theory is used Ior pitch detection i.e., Iind the similarity between the original speech and it`s shiIted
speech. There are many methods Ior Iinding the pitch they are as Iollows.
3.1 Time Domain Approach
3.1.1 Autocorrelation Method for finding pitch Frequency:
Autocorrelation is the correlation oI a signal with itselI. We can say that this is a measure oI the similarity
between samples as a Iunction oI the time separation between them. It can be considered as a mathematical tool
to Iind repeating patterns and their periods. Autocorrelation methods need at least two pitch periods to detect
pitch.
R
xx
=
2
0
( )* ( )
lim
2 1
N
i
N w
a i a i k
N
=

+
+

...(3)
As in equatin (3) Where a(i) is the ith sample number and N is total number oI samples and K is the interval
and Rxx is the result.
3.1.2 Average Magnitude Difference Function:
We make the diIIerence signal D by delaying the input speech by various amounts, subtracting the delayed
waveIorm Irom the original, and summation oI the magnitude oI the diIIerence between sample values. Finally
we take the average oI the diIIerence Iunction over the number oI samples. DiIIerence signal is always zero at
delay zero.
AMDF (k) =
1
| ( ) ( )|
N
i
abs a i a i k
N
=
+

.....(4)
As in equation (4) Where a(i) is the current sample and N is the total number of samples and k is the interval.
3.2 Frequency Domain Approach
3.2.1 FFT (fast Fourier transform) based method in Spectral domain:
First we have to know about spectral domain so we studied in above approach that are time domain approach
and now we discuss about Frequency domain approach, in Irequency domain we work with speech spectrum so it
is called spectral domain. Generally there are Iour method Ior Iinding pitch in Irequency domain they are as
Iollows (a) FFT based Method, (b) Harmonic peak detection method, (c) spectrum similarity method, (d) spectral
autocorrelation method. Here we discuss only one i.e., FFT based method. In this FFT is a very Iast algorithm Ior
computing the discrete Fourier transIorm. When we say take K130 point DFT, we will get 130 DFT
coeIIicients. The nth DFT coeIIicients X (n) oI any sampled signal x (k) is given by in equation (5).
|1| Where W is
4 /
2
j N
e
W

=
..(5)
177 Elsevier Publications, 2013
A secure avenue to satellite image encryption and authentication with ECC & voice components (MFCC, Pitch)
|2|
|3|
1
0
(n) x(k)(W)
K
nk
n
X

=
=

|4|
|5| Algorithm-
Step-1 Take the voiced Segment oI speech containing N samples.
Step-2 Take a N-samples point FFT and plot it.
Step-3 Track First Frequency as Iundamental Irequency.// resolution oI the Iundamental Irequency measurement
is achieved by the number oI points in the FFT. Say a N point FFT, the Irequency resolution will improve to
(basic Irequency)/N. Using FFT is not sure that it gives exact pitch , it depends on the DFT domain resolution.
Step-4 Iundamental Irequency is the FFT point number (Iirst peak) multiplied by the Irequency resolution.
Step-5 Note the position oI the Iirst peak and multiply with step (4).
Step-6 END.
Fig-1.2 Plot oI voiced part oI a signal and FFT oI that signal
For example we took a speech segment and Iirst we separate the voiced part and unvoiced part oI the signal
then we Iind nth pitch value through Fast Fourier TransIorm. Above given graph is showing plot oI voiced part oI
the signal and plot oI FFT oI the voiced part oI the signal. From our example we Iind our Iirst peak occurs at 16th
position and has a value oI 12560. Resolution Irequency is 10.80 Hz so Iundamental Irequency is 10.8*16 i.e.,
172.26 Hz. It is a valid pitch Irequency and Iurther we will use in our implementations.
4. Secure Approach and Implementation Results
The main area oI interest oI this paper is here because it has two layer approach and applied this on an image.
to Iind Mel Irequency Cepstrum coeIIicients with the above given Iormulas. So here one speech segment is
considered.
178 Elsevier Publications, 2013
Vikas Pardesi and Aayush Agarwal
0 50 100 150 200 250 300
80
100
120
140
160
plot of voiced part of a signal
sample no.
a
m
p
l
i
t
u
d
e
0 1000 2000 3000 4000 5000 6000 7000 8000
-5
0
5
10
plot of log spectrum in Mel scale for voiced speech
Frequency in Mel scale
A
m
p
l
i
t
u
d
e

i
n

d
B
Fig-1.3 Plot oI Voiced part oI signal
Start with one speech segment and Iind its voiced part Iirst and then we Iind the log spectrum in Mel scale
Irequency. Here it got above given plot oI that result. Now Iind the MFCC Ior voiced speech |25| then below
given graph is showing that 14 coeIIicients we are getting and they are plotted s Iollows.
0 2 4 6 8 10 12 14
0
1
2
3
4
5
6
plot of MFCC for voiced speech
Frequency in Mel scale
A
m
p
l
i
t
u
d
e

i
n

d
B
Fig-1.5 Plot oI MFCC Ior voiced part oI Speech
We got array oI 14 coeIIicients Iig(1.5) they are as Iollows 5.6999, 1.0993, 0.7545, 0.5487, 0.2899, 0.4800,
0.2525, 0.2825, 0.2831, 0.3480, 0.3459, 0.1003, 0.2398 and 0.2271.plot a graph then the graph will show actual
Ilow oI the data in voiced part.
Iind these coeIIicients Irom MATLAB command melcepst` Irom voice box, but you have to Iirst install that
tool box into your MATLAB soItware. Now we have to perIorm operation and apply these coeIIicients and pitch
value to an image with this approach-
14
1
( ) *P
14
i
Xi
R
=
=

Where Xi is the coeIIicients and P is the pitch value and R is the resultant. Apply this resultant in a 2D image
given below.
Fig-1.4 Original Image
179 Elsevier Publications, 2013
A ecure venue to atellite mage ncryption and uthentication with ECC & oice omponents (MFCC, Pitch)
For applying on each pixel oI the image we call a Iunction
MFCConIMAGE (A|N||M|, R)
Step-1 Ior (i0 to N-1)

For (j0 to M-1)

A|i| |j| A |i| |j|*R;
}
}
Step-2 Traverse on each pixel value oI the image to locate the pixel value.
Step-3 End;
AIter apply this approach below shown results are-
Where i and j is the pixel values at x axis and y axis respectively. R then got Irom above mentioned Iormula.
AIter applying MFCC value and pitch value oI image get distracted and will be noisy that is also good Ior secure
transIerring over network. Here result oI image is purely black and no one can identiIy any thing in the resultant
image.
Fig-1.5 MFCC coeIIicients and pitch value applied on Image
Now we have to apply ECC (Elliptic Curve Cryptography) on this output image Iig(1.5) and then we transIer
over network, so now task is how to encrypt the image with ECC Encryption so we have to understand some
points about ECC Encryption they are as Iollows-
ECC is a public key algorithm which works on private key and public key.
ECC designed and mainly used Ior handheld devices and small devices which are low in memory and resources.
ECC successIully implemented Iirst by Koblitz and miller |10|.
ECC encryption uses elliptic graph, onto this graph which points are generated that are taken Ior encryption.
Main use oI ECC is Ior those devices which can work only in constrained environment.
There is one operations involved in ECC which is Point Multiplication |11| which internally consists two
operation i.e., point addition and point doubling, in point doubling it doubles the point which is oI same kind with
point doubling Iormula i.e., say one point is T(XT, YT)
L(XL, Yl)2T(XT, YT)
XLS2-2XT mod p
YL-YTS(XT-XL) mod p
S(3XT2a)/(2YT) mod p
Where S is the tagent at point T and a is one oI the parameter chosen with the elliptic curve and p is a prime
number.
Now in point addition it is used Ior addition oI two points with point addition Iormula i.e., say two points P(XP,
YP) and
Q(XQ, YQ) then I(XI, YI)
XI S2-XP-XQ mod p
YI -YPS(XP-XI) mod p
S(YP-YQ)/(XP-XQ) mod p
Where S is the tagent passing through P and Q and p is a prime number.
ECC point generation
180 Elsevier Publications, 2013
Vikas Pardesi and Aayush Agarwal
According to elliptic curve y2(x3axb) mod p where 4a327b2=0 we have to generate points that lies on
elliptic curve. Let p39, a-1, b1 on which a` and b` value satisIying above equation. Iirst do encrypt so Iirst
oI all then generate all points that satisIies the elliptical curve Iollow this Iunction GeneratePoints (a, b, p)
Step 1 take x0 or any other positive integer
Step 2 loop until xp
Y2(x3axb) mod p
II y2 is perIect square
Print(x, square root (y))
Else
xx1;
Step 3 End
where p is a prime number, x and y are co-ordinates.
ECC Encryption
Step 1-For all PI (pixel value)
Find SPI *AFM //*PI is constant, AFM is random AIIine- point in elliptic curve. *//
Step 2- Find PKBPRKB*BP //*BP is the base point OI Elliptic curve, PRKB is the private key. *//
Step 3- End;
Encrypted data (N*BP, SN*PKP)
ECC decryption
Follow this method Ior decryption,
Let N*BP be the Iirst point and (SN*PKB ) be the second point PRKB *N*BPPRKB *Iirst point
Calculate SSN*PKB-PRKB*N*BP
Calculate the scalar value oI PI` Irom SM using discrete logarithmic problem |7|. Where PKA, PRKA and PKB,
PRKB is the public key and private key oI user A and B respectively.
Fig-1.6 AIter ECC decryption oI Image
In decryption (Iig 1.6) oI the ECC we will use the Discrete logarithmic Problem, aIter applying on each pixel we
get all the decrypted 2D-matrix i.e., image. Below histogram is shown oI above image and we can analyze this
histogram with original image`s histogram. It is approximately same. Above shown image is the decrypted image
aIter Discrete Logarithmic problem |7|. Now this image we got at the receiver side but we have to Iollow one
operation also i.e., remove the MFCC coeIIicients Irom encrypted image then we got our real image.
Fig-1.7 Remove MFCC and Pitch Irom Original Image
From Iigure 1.7 it can be seen that apply reverse operation Ior removing the MFCC and pitch value. Now we
can analyze our result image maximum Ieature oI the image can be identiIied and this method is better working
181 Elsevier Publications, 2013
A ecure venue to atellite mage ncryption and uthentication with ECC & oice omponents (MFCC, Pitch)
Ior satellite image Iurther more operation can be perIormed on the resultant image iI we want to enhance the
image.
5. Image Authentication through MFCC
As everyone know very well use oI images in now days is very much, in area oI cryptography, in area oI
Iorensic science, in daily liIe, images is the best option to hide the data and transIer over network. Main concern
in today`s liIe is to secure the images and authentication oI genuine images is very much. In inIormation security
there are many algorithms which are used Ior authentication such as digital signature, digital certiIicate etc. in
this paper our new idea is we are protecting the image Irom MFCC coeIIicients.
According to the paper here one sample voice segment is used and we Iind the MFCC coeIIicients and apply
on image and then we are applying MFCC on image and we all know very well that each human`s voice is
unique and MFCC also used Ior speaker veriIication so at the receiver side when we Iind same MFCC
coeIIicients Irom same voice then we will remove MFCC Ieature Irom the image and then we can veriIy our
image is that it is sent Irom genuine user or not. II anyone alters the message in between the network then real
image will not recover. Some malIunctioned image we will get and then that image will not be accepted so with
this we can also maintain the message integrity. So with MFCC coeIIicients we can do image authentication and
message integration.
6. Application & Future work
Cryptography has a very great advantage in inIormation security area that except oI the expert no one can do
harm to the inIormation and securely it can transIer the conIidential data to other party. Elliptic Curve
Cryptography is a new technology which came in existence since 1965 by Koblitz |10| and miller. A large
number oI researchers is going on ECC but ECC great advantage is its smaller key size compare to other
algorithms such as DES (Data Encryption Standard) and RSA. ECC works on small devices in a better way
compare to huge machines, ECC works on those device which are in constrained environment or use resources in
a limit. It enables us to make use oI MFCC in making Elliptic curve digital signature through MFCC coeIIicients.
Future work related to decrypted image and image recovered aIter removing the MFCC coeIIicients Irom
image, we can Iurther perIorm image enhancement techniques such as histogram equalization and contrast
stretching and noise removal Irom resultant image.
7. Future Scope
Proposed approach in this paper works better Ior satellite images and can better work Ior text data and Iurther
we can also us MFCC coeIIicients in other encryption algorithm because it is the unique Ieature Irom human
characteristics and Ireely available Irom every user. Here we mean to say each individual can use their voice Ior
authentication oI the data and this is more secure in public network. Generally in biometrics speech is available
easily and also can detect and synthesized in any condition and in any environment but there is a drawback i.e.,
noise. II your recording oI voice is in noisy environment then it will be a little bit more complex to detect easily
the data.
182 Elsevier Publications, 2013
Vikas Pardesi and Aayush Agarwal
References
|1| William Stallings, Cryptography & Network Security, Printce Hall, 5th Edition.
|2| Alessandro Cilardo, Luigi coppolino, Nicola Mazocca, and Luigi Roman, 'Elliptical Curve Cryptography Engineering, Proceedings oI
the IEEE, vol. 94, no 9, pp. 395-406, Feb. 2006 .
|3| 'SpeechProcessing,dea.brunel.ac.uk/cmsp/home./chapter13-speech20processing.pdI.
|4| en.wikipedia.org/wiki/Speechprocessing.
|5| G. Khare, M. Kulkarni, 'Generation oI excitation signal in voice excited linear predictive coding using discrete cosine transIorm,
TENCON 2005, IEEE region 10, page 1-4.
|6| S.S. Upadhyay , 'Pitch detection in time and Irequency domain, ICCICT 2012,IEEE, page 1-5.
|7| Adam J. Albirt, 'Understanding & Applied Cryptography and Data Security CRC press, Pearson
|8| G. Malherpe, O. Mesde and H. Riz, 'Acoustic synthesis and methodology Ior improving cochlear implant speech processing
techniques, Proc. OI the 25th annual international conIerence oI IEEE EMBS, 2003
|9| H.Nagahama, Y.Miyanaga and N.Ohtsuki, An adaptive speech analysis Ior speech recognition system, Proc. OI IEEE ISPACS 1999,
pp.745-748, Dec. 1999.
|10| N. Kolbitz, Elliptic Curve Cryptosystems, Mathematics oI Computation, vol.48, 1987, pp.203-209.
|11| Certicom website http://www.certicom.com/index.php? action ecctutorial, home.
|12| RaIael C. Gonzalez, 'Digital Image Processing, Third Edition.
|13| http://en.wikipedia.org/wiki/Melscale
|14| http://en.wikipedia.org/wiki/FFT
|15| H. TeIIahi, 'Relationship between control parameters and outputs in the two massmodel oI vocal cords, ICMCS , 2011 IEEE page 1-5.
|16| H.Hoge 'A parametric representation oI short time power spectrum based on the acoustic properties oI the ear, ICASSP 1984, speech
and signal processing page 49-51.
183 Elsevier Publications, 2013
Index

E
ECC decryption, 181
ECC encryption, 181
ECC point generation, 180181
Elliptic curve cryptography, 174175, 180, 182

F
Fast Fourier transform (FFT)
based method in spectral domain, 177178
FFT. see Fast Fourier transform (FFT)
Frequency domain approach
FFT based method in spectral domain, 177178

M
MATLAB command, 179
Mel-frequency cepstral coefficients (MFCC), 174
coefficients and pitch value applied, 180
cryptography, 182
image authentication, 182
voice segment, concept of extraction, 175176
MFCC. see Mel-frequency cepstral coefficients (MFCC)

S
Secure approach and implementation results, 178
MATLAB command, 179

T
Time domain approach
average magnitude difference function, 177
pitch frequency, autocorrelation method, 177

V
Voice Segment
MFCC feature, concept of extraction, 175176
pitch value from, 177178