Two new constructions of Cartesian authentication codes from symplectic geometry

1995 ◽  
Vol 10 (3) ◽  
pp. 345-356 ◽  
Author(s):  
Gao You ◽  
Zou Zengjia
Keyword(s):  
Symplectic Geometry ◽  
Authentication Codes ◽  
Cartesian Authentication Codes

scholarly journals Some New Constructions of Authentication Codes with Arbitration and Multi-Receiver from Singular Symplectic Geometry

2011 ◽  
Vol 2011 ◽  
pp. 1-18
Author(s):  
You Gao ◽  
Huafeng Yu
Keyword(s):  
Probability Distribution ◽  
Finite Fields ◽  
Symplectic Geometry ◽  
Authentication Codes ◽  
Uniform Probability ◽  
Different Types ◽  
Uniform Probability Distribution ◽  
New Construction

A new construction of authentication codes with arbitration and multireceiver from singular symplectic geometry over finite fields is given. The parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of deception are also computed.

scholarly journals A Construction of Multisender Authentication Codes with Sequential Model from Symplectic Geometry over Finite Fields

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Shangdi Chen ◽  
Chunli Yang
Keyword(s):  
Finite Fields ◽  
Symplectic Geometry ◽  
Authentication Codes ◽  
Sequential Model

Multisender authentication codes allow a group of senders to construct an authenticated message for a receiver such that the receiver can verify authenticity of the received message. In this paper, we construct multisender authentication codes with sequential model from symplectic geometry over finite fields, and the parameters and the maximum probabilities of deceptions are also calculated.

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.

Sign in / Sign up

Export Citation Format

Share Document