Abstract
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 P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">I</sub> of a successful impersonation attack and P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">S</sub> of a successful substitution attack of these codes are also computed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
