Optimising Bcrypt Parameters: Finding the Optimal Number of Rounds for Enhanced Security and Performance

Indra Listiawan, Zaidir Zaidir, Sugeng Winardi, Mohammad Diqi

Submitted : 2024-02-06, Published : 2024-05-31.

Abstract

Recent advancements in the field of information security have underscored the imperative to fine-tune Bcrypt parameters, particularly focusing on the optimal number of rounds as the objective of research. The method of research is a Brute Force Search method to find the optimal value of bcrypt rounds. The primary focal point of optimization lies in the number of Bcrypt rounds due to its direct impact on security levels. Elevating the number of rounds serves to fortify the security of the Bcrypt algorithm, rendering it more resilient against brute-force attacks. The execution of the Bcrypt rounds in the experimental method mirrors real-world scenarios, specifically in the evaluation of Bcrypt parameters with a focus on entropy assessment of the hash. The selection of the number of rounds should consider the specific needs of the system, where security takes precedence or faster performance is a crucial factor.

Keywords

Security, Round, Optimal ,BCrypt

References

A. Esser and E. Bellini, “Syndrome Decoding Estimator,” in Public-Key Cryptography – PKC 2022, vol. 13177, G. Hanaoka, J. Shikata, and Y. Watanabe, Eds., in Lecture Notes in Computer Science, vol. 13177. , Cham: Springer International Publishing, 2022, pp. 112–141. doi: 10.1007/978-3-030-97121-2_5.

B. Alabdullah, N. Beloff, and M. White, “E-ART: A New Encryption Algorithm Based on the Reflection of Binary Search Tree,” Cryptography, vol. 5, no. 1, p. 4, Jan. 2021, doi: 10.3390/cryptography5010004.

M. Curty, K. Azuma, and H.-K. Lo, “A quantum leap in security,” Phys. Today, vol. 74, no. 3, pp. 36–41, Mar. 2021, doi: 10.1063/PT.3.4699.

I. Hwang, S. Kim, and C. Rebman, “Impact of regulatory focus on security technostress and organizational outcomes: the moderating effect of security technostress inhibitors,” Inf. Technol. People, vol. 35, no. 7, pp. 2043–2074, Jan. 2022, doi: 10.1108/ITP-05-2019-0239.

T. P. Batubara, S. Efendi, and E. B. Nababan, “Analysis Performance BCRYPT Algorithm to Improve Password Security from Brute Force,” J. Phys. Conf. Ser., vol. 1811, no. 1, p. 012129, Mar. 2021, doi: 10.1088/1742-6596/1811/1/012129.

C. Carlet, “Parameterization of Boolean functions by vectorial functions and associated constructions,” Adv. Math. Commun., 2022, doi: 10.3934/amc.2022013.

A. Shafique, J. Ahmed, W. Boulila, H. Ghandorh, J. Ahmad, and M. U. Rehman, “Detecting the Security Level of Various Cryptosystems Using Machine Learning Models,” IEEE Access, vol. 9, pp. 9383–9393, 2021, doi: 10.1109/ACCESS.2020.3046528.

G. Wu, F. Guo, and W. Susilo, “Generalized public-key cryptography with tight security,” Inf. Sci., vol. 504, pp. 561–577, Dec. 2019, doi: 10.1016/j.ins.2019.07.041.

B. R. Curtis and R. Player, “On the Feasibility and Impact of Standardising Sparse-secret LWE Parameter Sets for Homomorphic Encryption,” in Proceedings of the 7th ACM Workshop on Encrypted Computing & Applied Homomorphic Cryptography, London United Kingdom: ACM, Nov. 2019, pp. 1–10. doi: 10.1145/3338469.3358940.

A. B. Ammar and A. A. Minalla, “An Algorithm Based on Self-balancing Binary Search Tree to Generate Balanced, Intra-homogeneous and Inter-homogeneous Learning Groups,” Int. J. Adv. Comput. Sci. Appl., vol. 14, no. 6, 2023, doi: 10.14569/IJACSA.2023.0140622.

Z. Yang, Y. Chang, and Y. Yang, “An Improved Algorithm of Binary Balanced Tree with Super Large-scale Data Set”.

S. Ibrahim and A. M. Abbas, “A Novel Optimization Method for Constructing Cryptographically Strong Dynamic S-Boxes,” IEEE Access, vol. 8, pp. 225004–225017, 2020, doi: 10.1109/ACCESS.2020.3045260.

Ph.D (Pursuing), Department of Computer Science, Madurai Kamraj University, Madurai (Tamil Nadu), India et al., “Improved Data Encryption Standard Algorithm using Zigzag Scan for Secured Data Transmission,” Int. J. Innov. Technol. Explor. Eng., vol. 12, no. 6, pp. 26–37, May 2023, doi: 10.35940/ijitee.F9516.0512623.

Y. Alemami, M. A. Mohamed, and S. Atiewi, “Advanced approach for encryption using advanced encryption standard with chaotic map,” Int. J. Electr. Comput. Eng. IJECE, vol. 13, no. 2, p. 1708, Apr. 2023, doi: 10.11591/ijece.v13i2.pp1708-1723.

W. Ady Putra, S. Suyanto, and M. Zarlis, “Performance Analysis Of The Combination Of Advanced Encryption Standard Cryptography Algorithms With Luc For Text Security,” SinkrOn, vol. 8, no. 2, pp. 890–897, Apr. 2023, doi: 10.33395/sinkron.v8i2.12202.

J. Khudair, K. Abd Ghan, and M. Rizuan Bin Baharon, “Comparative Study in Enhancing AES Algorithm: Data Encryption,” Wasit J. Pure Sci., vol. 2, no. 2, pp. 316–339, Jun. 2023, doi: 10.31185/wjps.100.

D. Shatokhin, “New Encryption Algorithm with Improved Security,” Glob. J. Res. Eng., pp. 33–40, Feb. 2023, doi: 10.34257/GJREJVOL23IS1PG33.

L. H. Clemmensen and R. D. Kjærsgaard, “Data Representativity for Machine Learning and AI Systems.” arXiv, Feb. 03, 2023. Accessed: Dec. 21, 2023. [Online]. Available: http://arxiv.org/abs/2203.04706

V. Keswani and L. E. Celis, “Auditing for Diversity using Representative Examples.” arXiv, Jul. 15, 2021. Accessed: Dec. 21, 2023. [Online]. Available: http://arxiv.org/abs/2107.07393

G. Blanc, “Subsampling Suffices for Adaptive Data Analysis.” arXiv, Sep. 20, 2023. Accessed: Dec. 21, 2023. [Online]. Available: http://arxiv.org/abs/2302.08661

A. Katsenou, F. Zhang, M. Afonso, G. Dimitrov, and D. R. Bull, “BVI-CC: A Dataset for Research on Video Compression and Quality Assessment,” Front. Signal Process., vol. 2, p. 874200, Apr. 2022, doi: 10.3389/frsip.2022.874200.

Shen Yang, Yi Lu, Mingshuang Gao, Ce Wang, Junnan Wang, and Yunfeng Guo, “Comprehensive evaluation of power information system security protection based on entropy weight-TOPSIS algorithm,” presented at the Proc.SPIE, Dec. 2022, p. 1247404. doi: 10.1117/12.2653831.

M. Panchenko, A. Bigdan, T. Babenko, and D. Tymofieiev, “DETECTING THE INFORMATION SECURITY ANOMALIES BASED ON AN ENTROPY ANALYSIS OF THE INFORMATION SYSTEM,” Energy Autom., vol. 59, no. 1, 2022, doi: 10.31548/energiya2022.01.072.

A. K. Kanaev, E. V. Oparin, and E. V. Oparina, “Ensuring Information Security for Clocked Network Synchronization System on the Basis of the System Entropy Analysis,” Proc. Petersburg Transp. Univ., vol. 19, no. 3, pp. 505–514, 2022.

Article Metrics

Abstract view: 72 times
Download     : 30   times Download     : 8   times

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Refbacks

  • There are currently no refbacks.