A New Scheme on XOR Operation for Low-Cost RFID

Article Preview

Abstract:

In order to overcome the high complexity of the tag in RFID, a new XOR scheme is proposed based on the relationship between X and Z for X XOR (X + On) =Z. As only XOR and random number generator are required to be computed by tags,it is very suitable for low—cost Radio Frequency Identification(RFID) system .

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2207-2210

Citation:

Online since:

February 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Hawkes P, Rose G. Primitive specification and supporting documentation for sober-t16 sub-mission to nessie[EB / OL]. 2000( 2000-09-16 )[ 2006-01-01 ]. http: / homes . esat . kuleuven . be / ~ jlanof / stream / papers / sobert16hr . doc.

Google Scholar

[2] Ekdahl P, Johansson T. Snow—a new stream cipher[EB /OL]. 2000(2000-11-22[2006-01-0]. http: /www . it . lth . se / cryptology / snow / snow10 . pdf.

Google Scholar

[3] Rose G, Hawkes P. Turing: a fast stream cipher[C]/Johansson T. Fast Software Encryption 2003 . Berlin: Springerverlag, 2003: 290-306.

DOI: 10.1007/978-3-540-39887-5_22

Google Scholar

[4] Rueppel R. Analysis and design of stream ciphers[M]. Berlin: Springer-verlag, 1986: 182-187.

Google Scholar

[5] Ekdahl P, Johansson T. Distinguishing attacks on sober-t16 and t32[C]/ Daemen J, Rijmen v. Fast Software Encryption2002. Berlin: Springer-verlag, 2002: 210-224.

DOI: 10.1007/3-540-45661-9_16

Google Scholar

[6] Watanabe D, Biryukov A, Canniere C . A distinguishing attack of snow2. 0 with linear masking method[C]/Matsui M, Zuccherato R. Selected Areas in Cryptography 2003 . Berlin Springer-verlag, 2004: 222-233.

DOI: 10.1007/978-3-540-24654-1_16

Google Scholar

[7] Wallen J . Linear approximations of addition modulo 2I[C]/Johansson T. Fast Software Encryption 2003 . Berlin: Springer-verlag, 2003: 261-273.

DOI: 10.1007/978-3-540-39887-5_20

Google Scholar

[8] Maximov A. On linear approximation of modulo sum[C]/Roy B, Meier W. Fast Software Encryp-tion 2004 . Berlin: Springer-verlag, 2004: 483-484 . 02.

Google Scholar