Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Enhancing the resistance of password hashing using binary randomization through logical gates

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 14 No. 5 (2024)

DOI
10.11591/ijece.v14i5.pp5400-5407
ISSN
2722-2578, 2088-8708
Published
2024-10-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Digitalization in various sectors makes information security issues very crucial. Information security follows the authentication, authorization, and accounting (AAA) principle, where one of the most important parts is authentication. The most widely used authentication method is username-password. The best method to secure a user-pass is to convert the plaintext using a hash so that the converted plaintext cannot be recovered. However, with higher technology, hackers can crack the ciphertext using brute force. This research proposes a username-password scrambling algorithm before it is fed into the hash function to improve resilience from attacks. This algorithm is named logical gates (LG). It works by converting the user pass into binary form, adding salt, and scrambling it with certain logical gates before inserting it into the hash function. Testing is divided into two: time of execution and attack resistance. Time of execution results show that LG takes 0.0443432033 s, while without LG takes 0.01403197646 s. The resistance of attack results show that the plaintext of the hash amplified by LG cannot be cracked at all and increases the attack time by 321.3% at prefix and 161.3% at postfix, while without LG, the plain text can be found for a certain duration of time.

Collaboration network of the authors

6 authors · 6 co-authorship links · 2 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Sunan Kalijaga State Islamic University Yogyakarta
  • Islamic University of Indonesia
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Ahmad SubkiIslamic University of Indonesia1
Yudi PrayudiIslamic University of Indonesia1
Rahmadhan GatraSunan Kalijaga State Islamic University Yogyakarta1
Rizki DewantaraAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Enhancing the resistance of password hashing using binary randomization through logical gates</dc:title><dc:creator>Anbari, Muhamad Zaki</dc:creator><dc:creator>Sugiantoro, Bambang</dc:creator><dc:description>&lt;jats:p&gt;Digitalization in various sectors makes information security issues very crucial. Information security follows the authentication, authorization, and accounting (AAA) principle, where one of the most important parts is authentication. The most widely used authentication method is username-password. The best method to secure a user-pass is to convert the plaintext using a hash so that the converted plaintext cannot be recovered. However, with higher technology, hackers can crack the ciphertext using brute force. This research proposes a username-password scrambling algorithm before it is fed into the hash function to improve resilience from attacks. This algorithm is named logical gates (LG). It works by converting the user pass into binary form, adding salt, and scrambling it with certain logical gates before inserting it into the hash function. Testing is divided into two: time of execution and attack resistance. Time of execution results show that LG takes 0.0443432033 s, while without LG takes 0.01403197646 s. The resistance of attack results show that the plaintext of the hash amplified by LG cannot be cracked at all and increases the attack time by 321.3% at prefix and 161.3% at postfix, while without LG, the plain text can be found for a certain duration of time.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2024-10-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v14i5.pp5400-5407</dc:identifier><dc:identifier>10.11591/ijece.v14i5.pp5400-5407</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 14 No 5 (2024); 5400</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/35537/17680</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>