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

DOI10.1515/jmc-2017-0057zbMath1435.94133OpenAlexW2809670899WikidataQ129627056 ScholiaQ129627056MaRDI QIDQ1787190

Wachirapong Jirakitpuwapat, Phatiphat Thounthong, Parin Chaipunya, Poom Kumam, Sompong Dhompongsa

Publication date: 4 October 2018

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2017-0057

zbMATH Keywords

authentication codefinite commutative ringgeometry of classical groups

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Other finite linear geometries (51E26)

Related Items (2)

Unnamed Item ⋮ A quantum key distribution on qudits using quantum operators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Orthogonal graphs over finite commutative rings of odd characteristic
• A generalization of the formulas for intersection numbers of dual polar association schemes and their applications
• Symplectic graphs over finite commutative rings
• Authentication codes and bipartite graphs
• Logarithm Cartesian authentication codes.
• Two new constructions of Cartesian authentication codes from symplectic geometry
• Two constructions of optimal cartesian authentication codes from unitary geometry over finite fields
• Structure of unitary groups over finite group rings and its application
• A CONSTRUCTION OF CARTESIAN AUTHENTICATION CODE FROM ORTHOGONAL SPACES OVER A FINITE FIELD OF ODD CHARACTERISTIC
• Authentication Theory/Coding Theory
• Codes Which Detect Deception
• Linear authentication codes: bounds and constructions

This page was built for publication: New methods of construction of Cartesian authentication codes from geometries over finite commutative rings