A new design paradigm for provably secure keyless hash function with subsets and two variables polynomial function

Provably secure keyless hash function uses Random Oracle (RO) or Sponge principles for the design and construction of security-centric hash algorithms. It capitalizes the aforesaid principles to produce outcomes like MD2, MD5, SHA-160, SHA-224/256, SHA-256, SHA-224/512, SHA-256/512, SHA-384/512, SHA...

ver descrição completa

Detalhes bibliográficos

Principais autores:	P. Karthik, P. Shanthi Bala
Formato:	Artigo
Idioma:	Inglês
Publicado em:	Springer 2022-05-01
coleção:	Journal of King Saud University: Computer and Information Sciences
Assuntos:	Provably secure hash function Polynomial hash function Subsets in hash design One-way collision resistant hash function Secured keyless hash function Subsets and polynomial function for cryptographic hash function
Acesso em linha:	http://www.sciencedirect.com/science/article/pii/S1319157819304215
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!