Two constructions of A^2-codes with secrecy from polynomials over finite fields

zbMATH Open1367.94356MaRDI QIDQ5267505FDOQ5267505

Authors: Shangdi Chen, Xue Li, Wenjing Tian 

Publication date: 13 June 2017

Recommendations

• A new construction of authentication codes with arbitration using vector space over finite fields
• scientific article; zbMATH DE number 1789834
• scientific article; zbMATH DE number 1676652
• scientific article; zbMATH DE number 1303980
• A2-code = Affine resolvable + BIBD

zbMATH Keywords

finite fieldpolynomialsecrecy\(A^2\)-code

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial aspects of finite geometries (05B25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25) Authentication, digital signatures and secret sharing (94A62)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Authentication codes for nontrusting parties obtained from rank metric codes
• A new construction of authentication codes with arbitration using vector space over finite fields
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Two constructions of \(A^2\)-codes with secrecy from polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267505)