By Topic

A Construction of Cartesian Authentication Codes from Vector Space over Finite Field

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhang Ying ; Dept. of Math., Dalian Maritime Univ., Dalian, China ; Yue Dian-Wu

In this paper, a construction of Cartesian authentication codes from vector space over finite fields is presented and its size parameters are computed. Under the assumption that the choose of encoding rules and source states obeys uniform probability distribution, the probabilities PI of a successful impersonation attack and PS of a successful substitution attack of these codes are also computed.

Published in:

Wireless Communications Networking and Mobile Computing (WiCOM), 2010 6th International Conference on

Date of Conference:

23-25 Sept. 2010