A new construction of multisender authentication codes from polynomials over finite fields

DOI10.1155/2013/320392MaRDI QIDQ2375496zbMATH OpenOpenAlexWikidataFDO

Authors Xiuli Wang

Publication date 14 June 2013

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2013/320392

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• A new construction of multi-sender authentication codes from polynomials 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
• A construction of multisender authentication codes with sequential model from symplectic geometry over finite fields
• A construction of multi-sender authentication codes from pseudo-symplectic geometry over finite fields

Cites work

• scientific article; zbMATH DE number 1302798 (Why is no real title available?)
• scientific article; zbMATH DE number 1303147 (Why is no real title available?)
• scientific article; zbMATH DE number 1107681 (Why is no real title available?)
• scientific article; zbMATH DE number 1772585 (Why is no real title available?)
• Codes Which Detect Deception

Cited in

(3)

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

This page was built for publication: A new construction of multisender 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 Q2375496)