scientific article; zbMATH DE number 4132087

MaRDI QIDQ3033699zbMATH OpenFDO

Authors Rafail E. Krichevsky

Publication date 1989

zbMATH Keywords

error correcting codeshashing algorithmpolynomial mappingsVarshamov-Gilbert bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• scientific article; zbMATH DE number 1088255
• Construction of secure and fast hash functions using nonbinary error-correcting codes
• Fast accumulated hashing
• Fast hash functions and convolution product
• Speeding up Collision Search for Byte-Oriented Hash Functions
• Source Coding Using Families of Universal Hash Functions
• Analysis of Fast Blockcipher-Based Hash Functions
• Efficient software implementations of code-based hash functions and stream-ciphers
• On linear hash codes
• Provably Good Codes for Hash Function Design

Cited in

(4)

• Complexity of Elias algorithm based on codes with covering radius three
• Source Coding Using Families of Universal Hash Functions
• scientific article; zbMATH DE number 1245630 (Why is no real title available?)
• Construction of secure and fast hash functions using nonbinary error-correcting codes

This page was built for publication:

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