Logo image
INFINITE FAMILIES OF OPTIMAL SPLITTING AUTHENTICATION CODES SECURE AGAINST SPOOFING ATTACKS OF HIGHER ORDER
Journal article   Peer reviewed

INFINITE FAMILIES OF OPTIMAL SPLITTING AUTHENTICATION CODES SECURE AGAINST SPOOFING ATTACKS OF HIGHER ORDER

Yeow Meng Chee, Xiande Zhang, Hui Zhang and Department of Mathematics, Zhejiang University, Hangzhou, Zhejiang 310027
Advances in mathematics of communications, Vol.5(1), pp.59-68
2011

Abstract

Computer Science Computer Science, Theory & Methods Mathematics Mathematics, Applied Physical Sciences Science & Technology Technology
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.

Metrics

1 Record Views

Details

Logo image