A Class of Cartesian Authentication Codes Constructed from PG(n,q)

2010 ◽  
Author(s):  
Xiuli Li
Keyword(s):  
Authentication Codes ◽  
Cartesian Authentication Codes

New methods of construction of cartesian authentication codes from geometries over finite commutative rings

2018 ◽  
Vol 12 (3) ◽  
pp. 119-136 ◽  
Author(s):  
Wachirapong Jirakitpuwapat ◽  
Parin Chaipunya ◽  
Poom Kumam ◽  
Sompong Dhompongsa ◽  
Phatiphat Thounthong
Keyword(s):  
Probability Distribution ◽  
Commutative Rings ◽  
Impersonation Attack ◽  
Authentication Codes ◽  
New Methods ◽  
Uniform Probability ◽  
Cartesian Authentication Codes ◽  
Uniform Probability Distribution ◽  
Finite Commutative Rings

Abstract In this paper, we construct some cartesian authentication codes from geometries over finite commutative rings. We only assume the uniform probability distribution over the set of encoding rules in order to be able to compute the probabilities of successful impersonation attack and substitution attack. Our methods are comfortable and secure for users, i.e., our encoding rules reduce the probabilities of successful impersonation attack and substitution attack.

A Generic Construction of Cartesian Authentication Codes

2007 ◽  
Vol 53 (6) ◽  
pp. 2229-2235 ◽  
Author(s):  
Cunsheng Ding ◽  
T. Helleseth ◽  
T. Klove ◽  
Xuesong Wang
Keyword(s):  
Authentication Codes ◽  
Cartesian Authentication Codes ◽  
Generic Construction

scholarly journals Cartesian authentication codes from functions with optimal nonlinearity

2003 ◽  
Vol 290 (3) ◽  
pp. 1737-1752 ◽  
Author(s):  
Samuel Chanson ◽  
Cunsheng Ding ◽  
Arto Salomaa
Keyword(s):  
Authentication Codes ◽  
Cartesian Authentication Codes
Sign in / Sign up

Export Citation Format

Share Document