𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Construction of Cartesian authentication codes from unitary geometry

✍ Scribed by Zhe-Xian Wan

Publisher
Springer
Year
1992
Tongue
English
Weight
886 KB
Volume
2
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

✦ Synopsis

In the present paper several constructions of Cartesian authentication codes from unitary geometry over finite fields are presented and their size parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities Pt and Ps of a successful impersonation attack and a successful substitution attack, respectively, of these codes are also computed. Moreover, those codes so constructed, for which Pl and Ps are nearly optimal, are also determined.

πŸ“œ SIMILAR VOLUMES

Cartesian authentication codes from func
Cartesian authentication codes from functions with optimal nonlinearity
✍ Samuel Chanson; Cunsheng Ding; Arto Salomaa πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 173 KB

In this paper, we present several classes of authentication codes using functions with perfect nonlinearity and optimum nonlinearity. Some of the authentication codes are optimal. On the other hand, these authentication codes are easy to implement due to their simple algebraic structures.

Constructions of bipartite graphs from f
Constructions of bipartite graphs from finite geometries
✍ Keith E. Mellinger; Dhruv Mubayi πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 99 KB πŸ‘ 1 views

## Abstract We construct an incidence structure using certain points and lines in finite projective spaces. The structural properties of the associated bipartite incidence graphs are analyzed. These __n__ Γ— __n__ bipartite graphs provide constructions of __C__~6~‐free graphs with Ξ©(__n__^4/3^ edges