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...
Gorde:
| Egile Nagusiak: | , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Springer
2022-05-01
|
| Saila: | Journal of King Saud University: Computer and Information Sciences |
| Gaiak: | |
| Sarrera elektronikoa: | http://www.sciencedirect.com/science/article/pii/S1319157819304215 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|
