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

MaRDI QIDQ5267505zbMATH OpenFDO

Authors Shangdi Chen, Xue Li, Wenjing Tian

Publication date 13 June 2017

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)

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

Cited in

(6)

• Authentication codes for nontrusting parties obtained from rank metric codes
• scientific article; zbMATH DE number 1676652 (Why is no real title available?)
• scientific article; zbMATH DE number 1789834 (Why is no real title available?)
• scientific article; zbMATH DE number 1394290 (Why is no real title available?)
• A new construction of authentication codes with arbitration using vector space over finite fields
• scientific article; zbMATH DE number 1504564 (Why is no real title available?)

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)