Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

New implementation of the abstract design for non-iterative hash functions with 1024 digest length NIHF-1024

IAES International Journal of Artificial Intelligence · Vol. 11 No. 4 (2022) · hlm. 1213–1222

DOI
10.11591/ijai.v11.i4.pp1213-1222
ISSN
2252-8938, 2089-4872
Terbit
2022-12-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

The non-iterative hash function design is a domain extension that uses a novel concept to fill a gap in existing cryptographic designs. This design avoids the structural issues that plagued prior paradigms, particularly those applying the Merkel-Damgârd design, by presenting a novel approach. Non-iterative hash function design, on the other hand, is an abstract idea that necessitates the specification of the internal transformation in order to test and experiment it. To achieve this goal, this article describes the algorithm that implements the internal transformation based on the main characteristics of the new model. The avalanche effect's results are provided in the experiment section, as well as a preliminary validation stage of the national institute of standards and technology (NIST's) cryptographic algorithm validation program (CAVP), which employs a set of test vectors to verify algorithm accuracy and implementation errors.

Kata kunci

Jaringan kolaborasi para penulis

6 penulis · 7 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Mohammed V University
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Abderrahmane Ez-ZahoutMohammed V University1
Mossaab Idrissi AlamiMohammed V University1
Abdallah AbouchouarAfiliasi tidak diketahui1
Khadija AchkounMohammed V University1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">New implementation of the abstract design for non-iterative hash functions with 1024 digest length NIHF-1024</dc:title>
	<dc:creator>Abdallah, Abouchouar</dc:creator>
	<dc:creator>Omary, Fouzia</dc:creator>
	<dc:subject xml:lang="en-US">Cryptography and security; cryptographic hash functions</dc:subject>
	<dc:subject xml:lang="en-US">Authentication; Cryptographic hash function; Domain extension; National institute of standards and technology; Security</dc:subject>
	<dc:description xml:lang="en-US">The non-iterative hash function design is a domain extension that uses a novel concept to fill a gap in existing cryptographic designs. This design avoids the structural issues that plagued prior paradigms, particularly those applying the Merkel-Damgârd design, by presenting a novel approach. Non-iterative hash function design, on the other hand, is an abstract idea that necessitates the specification of the internal transformation in order to test and experiment it. To achieve this goal, this article describes the algorithm that implements the internal transformation based on the main characteristics of the new model. The avalanche effect's results are provided in the experiment section, as well as a preliminary validation stage of the national institute of standards and technology (NIST's) cryptographic algorithm validation program (CAVP), which employs a set of test vectors to verify algorithm accuracy and implementation errors.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2022-12-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/21005</dc:identifier>
	<dc:identifier>10.11591/ijai.v11.i4.pp1213-1222</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 11, No 4: December 2022; 1213-1222</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v11.i4</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/21005/13509</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2022 Institute of Advanced Engineering and Science</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>