arXiv · 1010.0280
Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order
Abstract
We consider the problem of constructing optimal authentication codes with splitting. New infinite families of such codes are obtained. In particular, we establish the first known infinite family of optimal authentication codes with splitting that are secure against spoofing attacks of order two.
Explore related subjects
Keep this discovery
Yeow Meng Chee, Xiande Zhang, Hui Zhang. 2010-10-02. Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order. https://arxiv.org/abs/1010.0280
Cite the original work for its findings. Save a collection to share your selection of sources.