Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order

Details Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order

2010-10-02

arxiv.org/abs/1010.0280v1

Computer Science

Cryptography and Security

to appear in Advances in Mathematics of Communications (accepted September 2010)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinite Families of Optimal Splitting Authentication Codes Secure Against Spoofing Attacks of Higher Order will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-519235