A new construction of multi-sender authentication codes from polynomials over finite fields.

MaRDI QIDQ2822836zbMATH OpenFDO

Authors Xiuli Wang

Publication date 5 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

finite fieldsmulti-sender authentication codespolynomialsprimitive element

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A new construction of multisender authentication codes from polynomials over finite fields
• A construction of multi-sender authentication codes from pseudo-symplectic geometry over finite fields
• A novel construction of optimal multi-sender authentication code from singular pseudo-symplectic geometry over finite fields
• A new construction of multisender authentication codes from symplectic geometry over finite fields.
• A new construction of multisender authentication codes from pseudosymplectic geometry over finite fields

Cited in

(4)

• A new construction of multisender authentication codes from polynomials over finite fields
• scientific article; zbMATH DE number 6707359 (Why is no real title available?)
• scientific article; zbMATH DE number 1303147 (Why is no real title available?)
• A construction of multi-sender authentication codes from eigenvalues and eigenvectors of the matrix over finite fields

This page was built for publication: A new construction of multi-sender authentication codes from polynomials over finite fields.

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