\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={Efficient Authentication in RFID Devices Using Et Al's Algorithm},
 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-01-15 (revised: 15 January 2012)}
\def\TheID{\makeatother }
\def\TheDate{2012-01-15}
\title{Efficient Authentication in RFID Devices Using Et Al's Algorithm}
\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]{Dr. Vinita  Sharma}

             \affil[1]{  SR Group of Institution, CSE Campus  Jhansi, India.}

\renewcommand\Authands{ and }

\date{\small \em Received: 12 December 2011 Accepted: 5 January 2012 Published: 15 January 2012}

\maketitle


\begin{abstract}
        


Security plays a vital role during the transmission of private data from one sender to the other. Although there are many security algorithms implemented but here we are providing the security algorithms on the RFID devices. The authentication techniques implemented in RFID is based on the new algorithm based on smart cards. The data send through the tags can be made secure using the proposed algorithm so that the un-authorised users can?t access the data without any further unique numbers.

\end{abstract}


\keywords{RFID, tags, reader, authentication, counterfeiting, privacy, security.}

\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
adio Frequency Identification (RFID) system is the latest technology that plays an important role for object identification as ubiquitous infrastructure. RFID has many applications in access control, manufacturing automation, maintenance, supply chain management, parking garage management, automatic payment, tracking, and inventory control.\par
RFID tag: is a tiny radio chip that comprises a simple silicon microchip attached to a small flat aerial and mounted on a substrate. The whole device can then be encapsulated in different materials (such as plastic) dependent upon its intended usage. The tag can be attached to an object, typically an item, box, or pallet, and read remotely to ascertain its identity, position, or state. For an active tag there will also be a battery. Reader or Interrogator: sends and receives RF data to and from the tag via antennas. A reader may have multiple antennas that are responsible for sending and receiving radio waves.\par
RFID offer several advantages over barcodes: data are read automatically, line of sight not required, and through non conducting materials at high rate and far distance. The reader can read the contents of the tags by broadcasting RF signals via antennas. The tags data acquired by the readers is then passed to a host computer, which may run middleware (API). Middleware offers processing modules or services to reduce load and network traffic within the back-end systems. RFID basic operations can be summarized as in Figure  {\ref .} RFID systems are vulnerable to a broad range of malicious attacks ranging from passive eavesdropping to active interference. Unlike in wired networks, where computing systems typically have both centralized and host-based defenses (e.g. firewalls), attacks against RFID networks can target decentralized parts of the system infrastructure, since RFID readers and RFID tags operate in an inherently unstable and potentially noisy environment. Additionally, RFID technology is evolving quickly -the tags are multiplying and shrinking -and so the threats they are susceptible to, are similarly evolving.\par
Basic Operations of RFID RFID tags may pose a considerable security and privacy risk to organizations and individuals using them. Since a typical tag answers its ID to any reader and the replied ID is always the same, an attacker can easily hack the system by reading out the data of a tag and duplicating it to bogus tags. Unprotected tags may have vulnerabilities to eavesdropping, location privacy, spoofing, or denial of service (DoS). Unauthorized readers may compromise privacy by accessing tags without adequate access control. Even when the content of the tags is protected, individuals may be tracked through predictable tag responses. a) Security Issues 1. Security of the tag and the reader as well as the server: As the data from tag moves to the reader, security has to be maintained during the flow of data. Hence the security is maintained at the tag and the reader for the better efficiency of the data. 2. The original data stored at the receiver side: The original data from the tag is readed by the reader and is stored at the server, if the server can be accessed in an unauthorized manner and if the server damages the data will be lost, hence chances of fault tolerance. 3. Low computational and storage cost: During the manufacturing of tag and the reader devices various functions have been designed for the better authorization of the data, hence when this function are been implemented the tag and the reader should not increase the computational and the storage cost. 4. Various security features implemented in various protocols: The table shown below is the various security features that are implemented in various protocols used in RFID devices. Hence the protocol that doesn't contain these security features is not very efficient and can be attacked by the external or internal user. 5. Chances of eavesdropping: The protocols that are implemented for the security of the data from tag to reader should be authenticated so that the chance of eavesdropping has been reduced. 6. Synchronization between tag and the reader:\par
Synchronization between the tag and the reader is the flow of control from tag to the reader. The data moved from tag to the reader should be synchronized such that the data can't be lost and the chance of congestion has been reduced. 
\section[{b) Performance}]{b) Performance}\par
RFID schemes cannot use computationally intensive cryptographic algorithms for privacy and security because tight tag cost requirements make tagside resources (such as processing power and storage) scarce.\par
? Capacity minimization: The volume of data stored in a tag should be minimized because of the limited size of tag memory. It should be able to identify multiple tags using the same radio channel \hyperref[b3]{[11]}. Performing an exhaustive search to identify individual tags could be difficult when the tag population is large [6]. 
\section[{II.}]{II.} 
\section[{Related works}]{Related works}\par
Most of the security protocols implemented in RFID are based on cryptographic and hash functions. But these security protocols are not much secure. The OSK protocol was proposed by Ohkubo, Suzuki and Kinoshita (OSK) in 2004. Its aim is to assure the valid answer of the tag even under an active attack. In this scheme each tag is initialized with a secret value xi and two unidirectional functions h1 and h2. When a tag receives a request from a reader, it updates the value xi with the new value obtained from the computation of ht 1(xi).\par
Weis, Sarma, Rivest and Engels proposed in 2003 the use of hash-locks in RFID devices. A first approach, called Deterministic hash locks, was presented in. A tag is usually in a \textbackslash locked" state until it is queried by a reader with a specific temporary metaidentifier Id. This is the result of hashing a random value (nonce) selected by the reader and stored into the tag. The reader stores the Id and the nonce in order to be able to interact with the tag. The reader can unlock a tag by sending the nonce value. When a tag receives it, the value is checked \hyperref[b13]{[22]}.\par
Most of the security protocols implemented in RFID are based on cryptographic and hash functions. But these security protocols are not much secure. The OSK protocol was proposed by Ohkubo, Suzuki and Kinoshita (OSK) in 2004 \hyperref[b5]{[13]}. Its aim is to assure the valid answer of the tag even under an active attack. In this scheme each tag is initialized with a secret value xi and two unidirectional functions h1 and h2. When a tag receives a request from a reader, it updates the value xi with the new value obtained from the computation of ht 1(xi)  {\ref [8]}.\par
YA-TRAP (Yet-Another Trivial RFID Authentication Protocol) was proposed by Tsudik in 2006 \hyperref[b6]{[14]}. This protocol describes a technique for the inexpensive untraceable identification of RFID tags. YA-TRAP involves minimal interaction between devices and a low computational load on the back-end server. With these features, this scheme is attractive for applications where the information is processed in data groups  {\ref [8]}.\par
Weis, Sarma, Rivest and Engels proposed in 2003 \hyperref[b7]{[15]} the use of hash-locks in RFID devices. A first approach, called Deterministic hash locks, was presented in. A tag is usually in a \textbackslash locked" state until it is queried by a reader with a specific temporary metaidentifier Id. This is the result of hashing a random value (nonce) selected by the reader and stored into the tag. The reader stores the Id and the nonce in order to be able to interact with the tag. The reader can unlock a tag by sending the nonce value. When a tag receives it, the value is checked  {\ref [8]}.\par
In 2012, Dr.S.Suja proposed an RFID Authentication protocol for security and privacy which is based on Cyclic Redundancy Check (CRC) and Hamming Distance Calculation in order to achieve reader-to-tag authentication and the memory read command is used to achieve tag-to reader authentication. It will resist against tracing and cloning attacks in the most efficient way  {\ref [1]}.\par
In 2011, Liangmin WANG, Xiaoluo YI, implies improved protocol merely uses CRC and PRNG operations supported by Gen-2 that require very low communication and computation loads. They also develop two methods based on BAN logic and AVISTA to prove the security of RFID protocol. BAN logic is used to give the proof of protocol correctness, and AVISTA is used to affirm the authentication and secrecy properties  {\ref [2]}.\par
In 2008, Tieyan Li analyze the security vulnerabilities of a family of ultra-lightweight RFID mutual authentication protocols: LMAP, M2AP and EMAP \hyperref[b9]{[17]}*, which are proposed by Peris-Lopez et al. Here they identify two effective attacks, namely de-synchronization attack and full disclosure attack, against their protocols. The former permanently disables the authentication capability of a RFID tag by destroying synchronization between the tag and the RFID reader  {\ref [3]}.\par
The weakness of this authentication protocol comes from the fact that each round the advesary gets some information from the same key. So a quick way to counter our attack is to include a key-updating mechanism similar to OSK \hyperref[b10]{[18]} at the end of the protocol using a one-way function. In this case, adversaries do not get more than P equations for each key so that the security proof and reduction to the SAT problem become sound. The resulting protocol is even forwardprivate providing that adversaries do not get sidechannel information from the reader [28]. D. N. Duc, J. Park, H. Lee, and K. Kim. Enhancing security of EPCglobal gen-2 RFID tag against traceability and cloning. In Symposium on Cryptography and Information Security -SCIS 2006, Hiroshima, Japan[7],\par
Hash-based Access Control (HAC), as defined by Weis et al. \hyperref[b8]{[16]}*, is a scheme which involves locking a tag using a vone-way hash function. A locked tag uses the hash of a random key as its metaID. When locked, a tag responds to all queries with its metaID. However, the scheme allows a tag to be tracked because the same metaID is used repeatedly  {\ref [5]}.\par
In \hyperref[b5]{[13]} Ohkubo, Suzki, and Kinoshita (OSK) propose an RFID privacy protection scheme providing indistinguishability (i.e. a tag output is indistinguishable from a truly random value and unlinkable to the ID of the tag) and backward untraceability. This scheme uses a low-cost hash chain mechanism to update tag secret information to provide these two security properties. 
\section[{III.}]{III.} 
\section[{Problem statement}]{Problem statement}\par
The attack on SASI is a passive one. Passive attacks are achievable in practice since they only necessitate only eavesdropping, which is a typical hazard or threat in RFID setting where the physical wireless communication station or channel is open to parties within communication and transmission. The security provided by the SASI might be more but for the passive attacks only and the chances of eavesdropping is more.\par
IV. 
\section[{Proposed solution}]{Proposed solution}\par
Registration Phase -In the registration phase, Tag Ti wants to register himself/herself in remote server S. Firstly Tag chooses his/her ID and PW. Before register on Server, registration authority computes h (ID) and h (ID||PW) and sends to Reader R over a secure channel. Upon receiving the registration request from Tag Ti. Reader R computes same parameters related to the Tag Ti. Where Tu is current time when login request proceed. And send the login request massage \{Fi, Ei, Cid, Tu, h (ID)\} to remote Reader R.\par
Verification Phase-Upon receiving the login request massage \{Fi, Ei, Cid, Tu, h (ID)\}. Reader verifies the validity of time delay between Tu" and Tu. Where Tu' is the travel time of the massage. Tu'-Tu ? Î?"T where Î?"T denotes expects valid time interval for transmission delay. Then Reader accepts the login request and go to next process, otherwise the Reader reject login request. V.  The proposed scheme requires little more computation cost and equal to related user authentication scheme, Because our proposed scheme has strong secure mutual authentication scheme is resistance to insider attack, resistance to masquerade attacks, parallel session attack, replay attack, password attack, secure password change, protecting server spoofing attack, session key generation and agreement and other possible attack, that why some cost of execution are little more.    
\section[{Result analysis}]{Result analysis} 
\section[{Storages}]{Storages}\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.09927007299270073\textwidth}P{0.1551094890510949\textwidth}P{0.21094890510948905\textwidth}P{0.18613138686131386\textwidth}P{0.19854014598540146\textwidth}}
\tabcellsep Our\tabcellsep Yoon Yoo\tabcellsep Liou al\tabcellsep R.Song al\\
/Scheme\tabcellsep Scheme\tabcellsep al et. [3]\tabcellsep et. [7]\tabcellsep et.[10]\\
Tag\tabcellsep 480 bits\tabcellsep 480 bits\tabcellsep 480 bits\tabcellsep 320 bits\\
Server\tabcellsep 160 bits\tabcellsep 320 bits\tabcellsep 320 bits\tabcellsep 480 bits\end{longtable} \par
 
\caption{\label{tab_1}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_2}Table 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.4741839762611276\textwidth}P{0.0075667655786350145\textwidth}P{0.0857566765578635\textwidth}P{0.09332344213649851\textwidth}P{0.09584569732937685\textwidth}P{0.09332344213649851\textwidth}}
\multicolumn{2}{l}{Resistance to / Scheme}\tabcellsep Our Scheme\tabcellsep Yoon Yoo et al. [3]\tabcellsep Liou et al. [7]\tabcellsep R.Son g et al.[10]\\
Insider attack\tabcellsep \tabcellsep Yes\tabcellsep No\tabcellsep Yes\tabcellsep No\\
Masquerade attack\tabcellsep \tabcellsep Yes\tabcellsep No\tabcellsep Yes\tabcellsep Yes\\
\multicolumn{2}{l}{Parallel session attack}\tabcellsep Yes\tabcellsep No\tabcellsep Yes\tabcellsep No\\
\multicolumn{2}{l}{Replay attack}\tabcellsep Yes\tabcellsep Yes\tabcellsep Yes\tabcellsep No\\
\multicolumn{2}{l}{Offline password attack}\tabcellsep Yes\tabcellsep No\tabcellsep Yes\tabcellsep No\\
Secure\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{password change process}\tabcellsep Yes\tabcellsep Yes\tabcellsep Yes\tabcellsep Yes\\
\multicolumn{2}{l}{Denial of service}\tabcellsep Yes\tabcellsep No\tabcellsep Yes\tabcellsep No\\
Session\tabcellsep key\tabcellsep \tabcellsep \tabcellsep \\
\multicolumn{2}{l}{generation and}\tabcellsep Yes\tabcellsep No\tabcellsep No\tabcellsep Yes\\
agreement\tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_4}Table 3 :}\end{figure}
 			\footnote{© 2012 Global Journals Inc. (US)} 			\footnote{© 2012 Global Journals Inc. (US)Efficient Authentication in Rfid Devices Using Et Al's Algorithm} 			\footnote{© 2012 Global Journals Inc. (US)Global Journal of Computer Science and Technology} 		 		\backmatter  			 
\subsection[{Year}]{Year}\par
VI. 
\subsection[{Conclusion}]{Conclusion}\par
In this paper we show that the other authentication techniques involved in RFID are not so much secure and have high communication cost. We showed that our scheme is vulnerable to Denial-of-Service attack, Insider attack, Offline password attack Forward secrecy attacks. We present an efficient and secure ID-base remote user authentication scheme. The proposed scheme is proved to be able to withstand the various possible attacks. The proposed algorithm provides here provides a more authenticated protocol using the concept of pre shared secrete key for the authenticity between the tags and the reader using the technique of card generation.  
\subsection[{References Références Referencias}]{References Références Referencias}			 			  				\begin{bibitemlist}{1}
\bibitem[Brief Survey On et al.]{b13}\label{b13} 	 		\textit{},  		 			Rfid Brief Survey On 		,  		 			Privacy 		,  		 			J Security 		,  		 			A Aragones-Vilella\textunderscore  		,  		 			A Martinez-Ballest\textunderscore E 		,  		 			Solanas 		.  		 		 			CRISES Reserch Group UNESCO Chair in Data Privacy Dept. of Computer Engineering and Mathematics, Rovira I Virgili University 		 	 
\bibitem[Medeiros ()]{b1}\label{b1} 	 		\textit{18] m. ohkubo, k. suzki, and s. kinoshita. Cryptographic approach to "privacy-friendly" tags. In rfid privacy workshop, mit, ma, usa},  		 			T 		,  		 			B Medeiros 		.  		 \url{http://www.rfidprivacy.us/2003/agenda.php}  		2007/051, iacr, 2007. november 2003.  	 	 (Forward secure rfid authentication and key exchange) 
\bibitem[Liou et al. (2006)]{b12}\label{b12} 	 		‘A New Dynamic ID Based Remote User Authentication Scheme using Smart Cards’.  		 			Y P Liou 		,  		 			J Lin 		,  		 			S S Wang 		.  	 	 		\textit{Proc. 16th Information Security Conference},  				 (16th Information Security ConferenceTaiwan)  		2006. July. 21. R. Song. 2010. June. 32 p. .  	 	 (Computer Standards \& Interfaces) 
\bibitem[computer engineering and mathematics, rovira i virgili university]{b0}\label{b0} 	 		\textit{computer engineering and mathematics, rovira i virgili university},  				 	 
\bibitem[Kinoshita ()]{b5}\label{b5} 	 		‘Efficient hash chain based rfid privacy protection scheme’.  		 			M 		,  		 			S Kinoshita 		.  	 	 		\textit{international con-ference on ubiquitous computingubicomp, workshop privacy: current status and future directions},  				2004.  	 
\bibitem[Weis ()]{b7}\label{b7} 	 		\textit{Engels: a brief survey on rfid privacy and security. Crises reserch groupunesco chair in data privacy},  		 			Sarma Weis 		.  		2003.  	 
\bibitem[Hernandez-Castro ()]{b3}\label{b3} 	 		‘esteveztapiador, and a. ribagorda. m2ap: a minimalist mutual-authentication protocol for low-cost rfid tags’.  		 			P Hernandez-Castro 		.  	 	 		\textit{proc. of international conference on ubiquitous intelligence and computing uic'06, lncs 4159},  				 (of international conference on ubiquitous intelligence and computing uic'06, lncs 4159)  		2006. springer-verlag. p. .  	 
\bibitem[
			P
		 (2006)]{b4}\label{b4} 	 		‘hernandez-castro, j. m. esteveztapiador, and a. ribagorda. emap: an efficient mutual authentication protocol for low-cost rfid tags’.  		 			P 		.  	 	 		\textit{otm federated conferences and workshop: is workshop},  				november 2006.  	 
\bibitem[
			P
		 (2006)]{b2}\label{b2} 	 		‘hernandez-castro, j. m. esteveztapiador, and a. ribagorda. lmap: a real lightweight mutual authentication protocol for low-cost rfid tags’.  		 			P 		.  	 	 		\textit{proc. of 2nd workshop on rfid security},  				 (of 2nd workshop on rfid security)  		july 2006.  	 
\bibitem[Yoon ()]{b11}\label{b11} 	 		‘More efficient and secure remote user authentication scheme using smart card’.  		 			E Yoon 		,  		 			Yoo 		.  	 	 		\textit{proceeding of 11th international conference on Parallel and Distributed System},  				 (eeding of 11th international conference on Parallel and Distributed System)  		2005. p. .  	 
\bibitem[Md and Hoque ()]{b10}\label{b10} 	 		\textit{protecting privacy and ensuring security of rfid systems using private authentication protocols" marquette university},  		 			Md 		,  		 			Hoque 		.  		2010.  	 
\bibitem[Boyeon Song ()]{b8}\label{b8} 	 		\textit{rfid authentication protocol for low-cost tags" wisec'08},  		 			Boyeon Song 		.  		2008 acm 978-1-59593-814-5/08/03. march 31-april 2, 2008. alexandria, virginia, usa.  	 
\bibitem[Tieyan Li and Deng (2008)]{b9}\label{b9} 	 		‘security analysis on a family ofultra-lightweight rfid authentication protocols’.  		 			Robert H Tieyan Li 		,  		 			Deng 		.  	 	 		\textit{journal of software}  		march 2008. 3  (3) .  	 
\bibitem[Tsudik ()]{b6}\label{b6} 	 		‘Ya-trap: yet another trivial rfid authentication protocol’.  		 			G Tsudik 		.  	 	 		\textit{fourth annual ieee international conference on pervasive computing and communications work-shops (percomw'06)},  				2006. p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}