A novel subset-based polynomial design for enhancing the security of short message-digest with inflated avalanche and random responses
The data breach and the integrity violation of remote data remain significant issues in the domain of information security. A provably-secure hash function aids in providing solutions to integrity-related issues. Nevertheless, the choice of a provably-secure hash function has to be made with caution...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2023-01-01
|
| Series: | Journal of King Saud University: Computer and Information Sciences |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S1319157822004189 |
| _version_ | 1797942088785985536 |
|---|---|
| author | P. Karthik P. Shanthibala Akashdeep Bhardwaj Salil Bharany Heejung Yu Yousaf Bin Zikria |
| author_facet | P. Karthik P. Shanthibala Akashdeep Bhardwaj Salil Bharany Heejung Yu Yousaf Bin Zikria |
| author_sort | P. Karthik |
| collection | DOAJ |
| description | The data breach and the integrity violation of remote data remain significant issues in the domain of information security. A provably-secure hash function aids in providing solutions to integrity-related issues. Nevertheless, the choice of a provably-secure hash function has to be made with caution from the perspective of security. This research study attempts to identify the weakness of contemporary keyless hash functions and proposes an algorithm called a provably secure subset hash function (PSSHF). The objectives of the studies are reinforcing the internal structure of random oracle (RO), intensifying stochastic deportment, presenting computationally infeasible conditions for reverse decoding, and forestalling block-level and differential attacks through subsets and polynomial functions. The avalanche response of PSSHF is 50.06% and is higher than that of its contemporary variants. Likewise, the Near-collision response of PSSHF is 49.94% and is the least among its other similitudes. The empirical analysis of the effect of avalanche proves the novel design modifies 93.78% of output symbols besides excelling its other counterparts on random behavior. The runtime response proves the PSSHF processes short messages with acceptable delay. Therefore, the proposed PSSHF can be considered a perfect replacement for its similitudes in respect of the short messages for higher security. |
| first_indexed | 2024-04-10T20:02:07Z |
| format | Article |
| id | doaj.art-08c367dd3e2042a887ad74c542d6815f |
| institution | Directory Open Access Journal |
| issn | 1319-1578 |
| language | English |
| last_indexed | 2024-04-10T20:02:07Z |
| publishDate | 2023-01-01 |
| publisher | Elsevier |
| record_format | Article |
| series | Journal of King Saud University: Computer and Information Sciences |
| spelling | doaj.art-08c367dd3e2042a887ad74c542d6815f2023-01-27T04:18:46ZengElsevierJournal of King Saud University: Computer and Information Sciences1319-15782023-01-01351310323A novel subset-based polynomial design for enhancing the security of short message-digest with inflated avalanche and random responsesP. Karthik0P. Shanthibala1Akashdeep Bhardwaj2Salil Bharany3Heejung Yu4Yousaf Bin Zikria5Department of Computer Science, School of Engineering and Technology, Pondicherry University, Puducherry, IndiaDepartment of Computer Science, School of Engineering and Technology, Pondicherry University, Puducherry, IndiaDepartment of Computer Science, University of Petroleum and Energy Studies, Dehradun, IndiaDepartment of Computer Engineering & Technology, Guru Nanak Dev University, Amritsar, IndiaDepartment of Electronics and Information Engineering, Korea University, Sejong 30019, South Korea; Corresponding authors at: Department of Electronics and Information Engineering, Korea University, Sejong 30019, South Korea (H. Yu); Department of Information and Communication Engineering, Yeungnam University, Gyeongsan 38541, South Korea (Y.B. Zikria)Department of Information and Communication Engineering, Yeungnam University, Gyeongsan 38541, South Korea; Department of Computer Science and Information Technology, Abu Dhabi University, Abu Dhabi, UAE; Corresponding authors at: Department of Electronics and Information Engineering, Korea University, Sejong 30019, South Korea (H. Yu); Department of Information and Communication Engineering, Yeungnam University, Gyeongsan 38541, South Korea (Y.B. Zikria)The data breach and the integrity violation of remote data remain significant issues in the domain of information security. A provably-secure hash function aids in providing solutions to integrity-related issues. Nevertheless, the choice of a provably-secure hash function has to be made with caution from the perspective of security. This research study attempts to identify the weakness of contemporary keyless hash functions and proposes an algorithm called a provably secure subset hash function (PSSHF). The objectives of the studies are reinforcing the internal structure of random oracle (RO), intensifying stochastic deportment, presenting computationally infeasible conditions for reverse decoding, and forestalling block-level and differential attacks through subsets and polynomial functions. The avalanche response of PSSHF is 50.06% and is higher than that of its contemporary variants. Likewise, the Near-collision response of PSSHF is 49.94% and is the least among its other similitudes. The empirical analysis of the effect of avalanche proves the novel design modifies 93.78% of output symbols besides excelling its other counterparts on random behavior. The runtime response proves the PSSHF processes short messages with acceptable delay. Therefore, the proposed PSSHF can be considered a perfect replacement for its similitudes in respect of the short messages for higher security.http://www.sciencedirect.com/science/article/pii/S1319157822004189Provably secure subset hash functionsOne-way secure subset hash functionpolynomial digest for MDCRandom oracle design with polynomial functionPolynomial digest function |
| spellingShingle | P. Karthik P. Shanthibala Akashdeep Bhardwaj Salil Bharany Heejung Yu Yousaf Bin Zikria A novel subset-based polynomial design for enhancing the security of short message-digest with inflated avalanche and random responses Journal of King Saud University: Computer and Information Sciences Provably secure subset hash functions One-way secure subset hash function polynomial digest for MDC Random oracle design with polynomial function Polynomial digest function |
| title | A novel subset-based polynomial design for enhancing the security of short message-digest with inflated avalanche and random responses |
| title_full | A novel subset-based polynomial design for enhancing the security of short message-digest with inflated avalanche and random responses |
| title_fullStr | A novel subset-based polynomial design for enhancing the security of short message-digest with inflated avalanche and random responses |
| title_full_unstemmed | A novel subset-based polynomial design for enhancing the security of short message-digest with inflated avalanche and random responses |
| title_short | A novel subset-based polynomial design for enhancing the security of short message-digest with inflated avalanche and random responses |
| title_sort | novel subset based polynomial design for enhancing the security of short message digest with inflated avalanche and random responses |
| topic | Provably secure subset hash functions One-way secure subset hash function polynomial digest for MDC Random oracle design with polynomial function Polynomial digest function |
| url | http://www.sciencedirect.com/science/article/pii/S1319157822004189 |
| work_keys_str_mv | AT pkarthik anovelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses AT pshanthibala anovelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses AT akashdeepbhardwaj anovelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses AT salilbharany anovelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses AT heejungyu anovelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses AT yousafbinzikria anovelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses AT pkarthik novelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses AT pshanthibala novelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses AT akashdeepbhardwaj novelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses AT salilbharany novelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses AT heejungyu novelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses AT yousafbinzikria novelsubsetbasedpolynomialdesignforenhancingthesecurityofshortmessagedigestwithinflatedavalancheandrandomresponses |