Pongpisit Wuttidittachotti
King Mongkut’s University of Technology North Bangkok

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

Authentication and password storing improvement using SXR algorithm with a hash function Jakkapong Polpong; Pongpisit Wuttidittachotti
International Journal of Electrical and Computer Engineering (IJECE) Vol 10, No 6: December 2020
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v10i6.pp6582-6591

Abstract

Secure password storing is essential in systems working based on password authentication. In this paper, SXR algorithm (Split, Exclusive OR, and Replace) was proposed to improve secure password storing and could also be applied to current authentication systems. SXR algorithm consisted of four steps. First, the received password from users was hashed through a general hash function. Second, the ratio and the number of iterations from the secret key (username and password) were calculated. Third, the hashed password and ratio were computed, and the hashed password was divided based on the ratio (Split) into two values. Both the values were applied to XOR equation according to the number of iterations, resulting in two new values. Last, the obtained values were concatenated and stored in the database (Replace). On evaluating, complexity analyses and comparisons has shown that SXR algorithm could provide attack resistance with a stronger hashed password against the aforementioned attacks. Consequently, even if the hackers hacked the hashed password, it would be challenging and would consume more time to decrypt the actual one, because the pattern of the stored password is the same as the one that has been hashed through the general hash function.
An asymmetric encryption method for 3D mesh model using elgamal with elliptic curve cryptography Pongpisit Wuttidittachotti; Pornsak Preelakha
Indonesian Journal of Electrical Engineering and Computer Science Vol 27, No 2: August 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v27.i2.pp959-969

Abstract

The 3D mesh (Polygon mesh) model has been widely used in multiple computer technology fields such as computer graphic design and modern 3D animation. 3D mesh repositories were created to support the contribution of many 3D artist-designers and have become an important data source. This research is aimed at introducing asymmetric encryption for a 3D mesh model to improve encryption using elgamal elliptic curve cryptography with Fischer-Yates shuffling. The researchers evaluated the performance of the proposed model using Entropy, mean squared error (MSE), and peak signal noise ratio (PSNR) as evaluation matrices. The results of a decrypted model using our approach with a double-precision floating point showed zero means squared error and infinite value of PSNR.
Improved ciphertext-policy time using short elliptic curve Diffie–Hellman Pongpisit Wuttidittachotti; Parinya Natho
International Journal of Electrical and Computer Engineering (IJECE) Vol 13, No 4: August 2023
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v13i4.pp4547-4556

Abstract

Ciphertext-policy attribute-based encryption (CP-ABE) is a suitable solution for the protection of data privacy and security in cloud storage services. In a CP-ABE scheme which provides an access structure with a set of attributes, users can decrypt messages only if they receive a key with the desired attributes. As the number of attributes increases, the security measures are strengthened proportionately, and they can be applied to longer messages as well. The decryption of these ciphertexts also requires a large decryption key which may increase the decryption time. In this paper, we proposed a new method for improving the access time to the CP using a new elliptic curve that enables a short key size to be distributed to the users that allows them to use the defined attributes for encryption and decryption. Each user has a specially created key which uses the defined attributes for encryption and decryption based on the Diffie-Hellman method. After the implement, the results show that this system saves nearly half of the execution time for encryption and decryption compared to previous methods. This proposed system provides guaranteed security by means of the elliptic curve discrete logarithmic problem.