Security aspects of the Cayley hash function using discrete Heisenberg group

DOI10.1080/09720529.2019.1638613zbMATH Open1495.94084OpenAlexW2972928704WikidataQ127240407 ScholiaQ127240407MaRDI QIDQ5036737FDOQ5036737

Authors: V. Vibitha Kochamani, P. L. Lilly 

Publication date: 23 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2019.1638613

Recommendations

• Recent developments in Cayley hash functions
• scientific article; zbMATH DE number 1456817
• Compositions of linear functions and applications to hashing
• Cryptographic hash functions and expander graphs: the end of the story?
• Navigating in the Cayley graph of \(\mathrm{SL}_2(\mathbb F_p)\) and applications to hashing

zbMATH Keywords

goodness-of-fit testdiscrete Heisenberg groupcryptographic hash functiondifferent attacks

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Geometric group theory (20F65) Algebraic systems of matrices (15A30) Authentication, digital signatures and secret sharing (94A62) Additive bases, including sumsets (11B13)

Cites Work

• Title not available (Why is that?)
• Rubik’s for Cryptographers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• More secure version of a Cayley hash function

This page was built for publication: Security aspects of the Cayley hash function using discrete Heisenberg group

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