\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Wireless Adhoc Networks Security Principles, Issues \& Applications},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2012-06 2012-01-15 (revised: 2012 June 15 January 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-06 2012-01-15}
\title{Wireless Adhoc Networks Security Principles, Issues \& Applications}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Ramesh  Kait}

             \author[2]{Dr. Kuldeep  Kherwal}

             \author[3]{Dr.C. Nelson Kennedy  Babu}

             \affil[1]{  Singhania University Rajsthan}

\renewcommand\Authands{ and }

\date{\small \em Received: 13 December 2011 Accepted: 2 January 2012 Published: 15 January 2012}

\maketitle


\begin{abstract}
        


Privacy and itegrity of packets on wireless adhoc netwoks should be expected by the algorithmic mechanisms. This privacy and integrity is very much is to be mandated by regulations. In tardition the security is only based on cryptographic techniques which is not so much secure and leads to unsecure and unauthenticated information. As the packets of information is to be routed on networks so it needs some new security and digital signature based algorithm. Digital signature methods provides the solution to many of these new concerns. So in this paper we will discuss new paradigma of digital signature based techniques along with merit & demerits ,applications and isues related with it.

\end{abstract}


\keywords{Digital Signature, Cryptography, Security, RSA, Hash Function.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{Introduction}]{Introduction}\par
ith the advent of wireless network as packet radio networks in the 1970's, it became an interesting research subjects in computer world \hyperref[b0]{[1,}\hyperref[b1]{2,}\hyperref[b4]{5,}\hyperref[b6]{7,}\hyperref[b11]{12]}, and in these three fold decades tremendous improvement is made in the research. Wireless adhoc networks are a new paradigm of wireless communication for mobile hosts (which we call nodes). Wireless communication devices, could form an ad hoc network when they roam in a battlefield. Wireless networks can also be used for emergency, law enforcement, and rescue missions. Since an ad hoc network can be deployed rapidly with relatively low cost, it becomes an attractive option for commercial uses such as sensor networks or virtual classrooms. 
\section[{II.}]{II.} 
\section[{Issues of Security}]{Issues of Security}\par
As security is a complex objective, in order to achieve this objective, the issues is to be clearly defined:\par
? Authentication: Are user who they say they are? ? Access Privileges: What applications and information can a particular user read, writes, or modify? ? Accountability: Did the person responsible for the information?\par
? Traceability: What is the change and review history of the information? There can be a sure attack on the wireless adhoc network system because the attackers always think a one step ahead to the network designer, so there must be some security design to achieve the security objective. 
\section[{III.}]{III.} 
\section[{Concept of Secure System Model}]{Concept of Secure System Model}\par
In order to maintain the security of wireless adhoc network using digital signature technique is very much suitable because it is based on mathematical formula and enables the unauthenticated person to break it very hard. A digital signature/Scheme is a mathematical scheme \hyperref[b4]{[5,}\hyperref[b5]{6,}\hyperref[b7]{8,}\hyperref[b8]{9]} for demonstrating the authenticity of a digital message or document. A valid digital signature gives a recipient reason to believe that the message was created by a known sender, and that it was not altered in transit. Digital signatures are commonly used for software distribution, financial transactions, and in other cases where it is important to detect forgery/Tempering. 
\section[{IV.}]{IV.} 
\section[{Encryption for Privacy}]{Encryption for Privacy}\par
Encryption refers to algorithmic schemes that encode plain text into non-readable form or Cipher text, providing privacy. The receiver of the encrypted text uses a "key" to decrypt the message, returning it to its original plain text form. The key is the trigger mechanism to the algorithm.\par
Until the advent of the Internet, encryption was rarely used by the public, but was largely a military tool. Today, with online marketing, banking, healthcare and other services, even the average householder is aware of encryption.\par
There are many types of encryption and not all of it is reliable. The same computer power that yields strong encryption can be used to break weak encryption schemes. Initially, 64-bit encryption was thought to be quite strong, but today 128-bit encryption is the standard with DES Schemes, and this will undoubtedly change again in the future. The figure1.0 gives the process of the scheme how it works. There can be the two techniques of Cryptography can be used the description is as bellows General Description of Symmetric (Private Key) Cryptography also known as most popular Symmetric  
\section[{Cryptography}]{Cryptography}\par
? m is the message to be sent from A and B, ? Eb is the encryption algorithm using B's public key,\par
? Db is the decryption algorithm using B's private key.\par
A sender encrypts the message m using Eb (m) and transmits the results to B, B decrypts using Db (Eb (m)) and recovers the message m.\par
As the above figure  {\ref 1}.0 shows that the digital signature is formed in two First, A computes the hash value of her message; next, she encrypts the hash value with her private key. Upon receipt of the digital signature, B recovers the hash value calculated by A by decrypting the digital signature with A's public key. B can then apply the hash function to A's original message, which he has already decrypted. If the resultant hash value is not the same as the value supplied by A, then B knows that the message has been altered; if the hash values are the same, B should believe that the message he received is identical to the one that A sent.\par
This scheme also provides Non repudiation since it proves that A sent the message; if the hash value recovered by B using A's public key proves that the message has not been altered, then only A could have created the digital signature. B also has proof that he is the intended receiver; if he can correctly decrypt the message, then he must have correctly decrypted the session key meaning that his is the correct private key. Symmetric key (also called private key or secret key) cryptography \hyperref[b6]{[7,}\hyperref[b7]{8]} uses the same key to encrypt and decrypt. The name "private key" derives from the need to keep the key private. A major challenge associated with symmetric key cryptosystems is the secure distribution of keys. Asymmetric key encryption (also called public key encryption) uses two keys: a public and a private key. Data encrypted with one key can be decrypted only with the other key. Asymmetric cryptography solves the challenge of secure distribution of secret keys.\par
Anyone with the public key can use it to perform a validity check of digital signatures created by the private key. Only a digital signature created by the appropriate private key decrypts and validates properly with the public key. If a different private key was used to sign the data, the validity check fails. If the contents of digitally signed data or the digital signature have been tampered with or are corrupted, the validity check also fails. Valid digital signatures can be used to perform the following functions: Advantage of Digital signature is eliminating the possibility of committing fraud by an imposter signing since the digital signature cannot be altered, this makes forging the signature impossible. Beside this it helps in legal requirement and message integrity also. But implementation of this scheme is costly. Disadvantage of encrypting all data to provide a digital signature is impractical for three reasons:\par
? The cipher text signature is the same size as the corresponding plaintext, so message sizes are doubled, consuming large amounts of bandwidth and storage space. ? Public key encryption is slow and places heavy computational loads on computer processors, so network and computer performance can be significantly degraded and to overcome these issues we use Digital signature using RSA.\par
V. 
\section[{Hash function}]{Hash function}\par
A hash function takes a block of data, generally called the message, and returns a fixed-size string, which can be called the hash, hash value or message digest. The main reason for creating a hash value of a message is that any accidental or intentional change to it will result in a completely different hash value. Hashes are not unique. A good hash function should produce message digests that are impossible to brute force in a reasonable amount of time. The hash function should also have statistically evenly distributed collisions. This is called strong collision resistance. Some properties of a good cryptographic hash function are: ? It is easy to compute the hash value for any given message.\par
? It is very difficult to find a message that has a given hash. ? It is also very difficult to modify a message without the hash being changed. ? It is not possible to find two different messages with the same hash. ? It can apply to any block size of data.\par
? It should produce a fixed-length of output data Hash algorithms that are in common use today are:\par
? Message Digest (MD) algorithms: A series of byteoriented algorithms that produce a 128-bit hash value from an arbitrary-length message.\par
? Secure Hash Algorithm (SHA): Algorithm for NIST's Secure Hash Standard (SHS). SHA-1 produces a 160-bit hash value ? RIPEMD : A series of message digests and 128-bit hash functions.\par
? HAVAL (Hash of Variable Length) : a hash algorithm with many levels of security. It can create hash values that are 128, 160, 192, 224, or 256 bits in length.\par
? Whirlpool : A relatively new hash function .It operates on messages less than 2 256 bits in length, and produces a message digest of 512 bits. 
\section[{VI.}]{VI.} 
\section[{One way hash Function}]{One way hash Function}\par
The main role of hash function is in provision of digital signature. Hash functions are faster than digital signature. One-way chains are an important cryptographic primitive in many security applications. As one-way hash functions are very efficient to verify, they recently became increasingly popular for designing security protocols for resource-constrained mobile devices and sensor networks, as their low-powered processors can compute a one-way function within milliseconds, but would require tens of seconds or up to minutes to generate or verify a traditional digital signature \hyperref[b0]{[1]}. A one way function is a mathematical function that is significantly easier to perform in one direction .Despite the computational efficiency of oneway functions, one-way hash function is still challenging to use in resource-constrained environments, such as on small mobile devices or sensor networks. Especially some of the proposed sensor networks have significant resource limitations, as they use minimal hardware to lower the energy consumption \hyperref[b1]{[2]}. Generally all modern hash algorithms produce hash values of 128 bits and higher .Sometime called Trapdoor functions also. 
\section[{VII.}]{VII.} 
\section[{Fully hash function}]{Fully hash function}\par
The Full Domain Hash (FDH) is an RSAbased signature \hyperref[b8]{[9,}\hyperref[b11]{12,}\hyperref[b12]{13]} scheme that follows the hash-and-sign paradigm. It is more secure than one way hash function. In the RSA digital signature process, the private key is used to encrypt only the message digest. The encrypted message digest becomes the digital signature and is attached to the original data. To verify the contents of digitally signed data, the recipient generates a new message digest from the data that was received, decrypts the original message digest with the originator's public key, and compares the decrypted digest with the newly generated digest. If the two digests match, the integrity of the message is verified. The identity of the originator also is confirmed because the public key can decrypt only data that has been encrypted with the corresponding private key. RSA rely upon ``Key Certification Authority'' (CA) that is responsible for issuing and/or certifying keys. The primary role of a key certification authority is to provide assurance that a user's public key is accurate. It is used in most of applications around the world.\par
Advantage of RSA is that it can recover the message digest from signature.( D D D D )\par
Disadvantage of RSA is that, it's a time consuming process and create a problem when M> n situation arise, where M is message and n is Block length.\par
For resolve this problem we should use Hash and sign at a time. There are several reasons to sign such a hash (or message digest) instead of the whole document.\par
? For efficiency: The signature will be much shorter and thus save time since hashing is generally much faster than signing in practice.\par
? For compatibility: Messages are typically bit strings, but some signature schemes operate on other domains (such as, in the case of RSA, numbers modulo a composite number N). A hash function can be used to convert an arbitrary input into the proper format.\par
? For integrity: Without the hash function, the text "to be signed" may have to be split (separated) in blocks small enough for the signature scheme to act on them directly. However, the receiver of the signed blocks is not able to recognize if all the blocks are present and in the appropriate order.\par
RSA is used in verification than signing because RSA public exponent is usually smaller than RSA private exponent. this is desirable because a message is signed by individual only once but check for verification several times .hence , RSA signature verification is faster .RSA allow both the public and private key to be used for encryption. If a message is encrypted with someone's private key it can only be decrypted with the corresponding public key. This feature can be used to create digital signatures VIII. 
\section[{Proposed Plan for security Mechanisms}]{Proposed Plan for security Mechanisms}\par
We proposed solution for the authenticated broadcasting in wireless network to achieve many security goals for many applications that has to be achieved. Some of the measures that can be incorporated are:  
\section[{Conclusion}]{Conclusion}\par
Hash functions, for example, are well-suited for ensuring data integrity because any change made to the contents of a message will result in the receiver calculating a different hash value than the one placed in the transmission by the sender. Since it is highly unlikely that two different messages will yield the same hash value, data integrity is ensured to a high degree of confidence. The value of hash function is should be long enough to protect attacks. Secret key cryptography, on the other hand, is ideally suited to encrypting messages, thus providing privacy and confidentiality. The sender can generate a session key on a per-message basis to encrypt the message; the receiver, of course, needs the same session key to decrypt the message. Asymmetric schemes can also be used for non-repudiation and user authentication; if the receiver can obtain the session key encrypted with the sender's private key, then only this sender could have sent the message. Public-key cryptography could, theoretically, also be used to encrypt messages although this is rarely done because secret-key cryptography operates about 1000 times faster than public-key cryptography. In last , we suggest for Hash and RSA scheme combination. Further improvement is PKI public key infrastructure is key management to ensure safe public key i.e. signature verification key. It improves WANetworks system effectiveness and efficiency and is the solution for the problem, how to ensure public key signature verification. 
\section[{X.}]{X.}\par
Bibliography\begin{figure}[htbp]
\noindent\textbf{2012}\includegraphics[]{image-2.png}
\caption{\label{fig_0}W © 2012}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US) Global Journal of Computer Science and Technology} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[ Mobile Ad Hoc Networking Working Group -AODV]{b11}\label{b11} 	 		\textit{},  		 \url{http://www.ietf.org/rfc/rfc3561.txt}  	 	 		\textit{Mobile Ad Hoc Networking Working Group -AODV}  		 	 
\bibitem[Royer and Toh ()]{b10}\label{b10} 	 		\textit{A review of current routing protocols for adhoc mobile wireless networks},  		 			Elizabeth M Royer 		,  		 			Chai-Keong Toh 		.  		1999.  		 			University of California and Georgia Institute of Technology, USA 		 	 	 (Technical report) 
\bibitem[Cocks ()]{b7}\label{b7} 	 		‘An identity based encryption scheme based on quadratic residues’.  		 			C Cocks 		.  	 	 		\textit{Proceedings of IMA 2001},  				 (IMA 2001)  		2001. Springer-Verlag. p. .  	 
\bibitem[O'shea and Roe ()]{b3}\label{b3} 	 		‘Child-proof authentication for mipv6 (cam)’.  		 			G O'shea 		,  		 			M Roe 		.  	 	 		\textit{SIGCOMM Computer. Communication Rev}  		2001. 31 p. .  	 
\bibitem[Shamir ()]{b5}\label{b5} 	 		‘Identity-based cryptosystems and signature schemes’.  		 			A Shamir 		.  	 	 		\textit{Proceedings of CRYPTO '84},  				 (CRYPTO '84)  		1984. Springer-Verlag. p. .  	 
\bibitem[Boneh and Franklin ()]{b6}\label{b6} 	 		‘Identity-based encryption from the weil pairing’.  		 			D Boneh 		,  		 			M Franklin 		.  	 	 		\textit{Proceedings of CRYPTO 2001},  				 (CRYPTO 2001)  		2001. Springer-Verlag. p. .  	 
\bibitem[Mobile Ad Hoc Networking Working Group -DSR]{b12}\label{b12} 	 		 \url{http://www.ietf.org/rfc/rfc4728.txt}  		\textit{Mobile Ad Hoc Networking Working Group -DSR},  				 	 
\bibitem[Schiller ()]{b8}\label{b8} 	 		\textit{Mobile Communications},  		 			Jochen Schiller 		.  		2000. Addison-Wesley.  	 
\bibitem[Kahn et al.]{b1}\label{b1} 	 		‘Mobile networking for smart dust’.  		 			J M Kahn 		,  		 			R H Katz 		,  		 			K S Pister 		.  	 	 		\textit{ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom'99)},  				 (Seattle, WA, August99)  		 	 
\bibitem[Brown et al. (2000)]{b0}\label{b0} 	 		‘PGP in constrained wireless devices’.  		 			M Brown 		,  		 			D Cheung 		,  		 			D Hankerson 		,  		 			J Hernandez 		,  		 			M Kirkup 		,  		 			A Menezes 		.  	 	 		\textit{Proceedings of the 9th USENIX Security Symposium},  				 (the 9th USENIX Security Symposium)  		August 2000. USENIX. p. .  	 
\bibitem[Sivalingam ()]{b9}\label{b9} 	 		 			Krishna Moorthy Sivalingam 		.  		\textit{Tutorial on Mobile Ad Hoc Networks},  				2003.  	 
\bibitem[Montenegro and Castelluccia ()]{b4}\label{b4} 	 		‘Statistically unique and cryptographically verifiable (sucv) identifiers and addresses’.  		 			G Montenegro 		,  		 			C Castelluccia 		.  	 	 		\textit{Proceedings of the Network and Distributed System Security Symposium (NDSS)},  				 (the Network and Distributed System Security Symposium (NDSS))  		2002.  	 
\bibitem[Weimerskirch and Westhoff ()]{b2}\label{b2} 	 		‘Zero commonknowledge authentications for pervasive networks’.  		 			A Weimerskirch 		,  		 			D Westhoff 		.  	 	 		\textit{In: Selected Areas in Cryptography}  		2003. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
