SITI NOOR FARWINA MOHAMAD ANWAR ANTONY

Dr. SITI NOOR FARWINA MOHAMAD ANWAR ANTONY

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 April 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
GMGaeithry Manoharam
Gaeithry Manoharam
MKMohd Shareduwan Mohd Kasihmuddin
Mohd Shareduwan Mohd Kasihmuddin
SASITI NOOR FARWINA MOHAMAD ANWAR ANTONY
SITI NOOR FARWINA MOHAMAD ANWAR ANTONY
NRNURUL ATIQAH ROMLI
NURUL ATIQAH ROMLI
NRNur ‘Afifah Rusdi
Nur ‘Afifah Rusdi
MMMohd. Asyraf Mansor
Mohd. Asyraf Mansor
Choosing the best attribute from a dataset is a crucial step in effective logic mining since it has the greatest impact on improving the performance of the induced logic. This can be achieved by removing any irrelevant attributes that could become a logical rule. Numerous strategies are available in the literature to address this issue. However, these approaches only consider low-order logical rules, which limit the logical connection in the clause. Even though some methods produce excellent performance metrics, incorporating optimal higher-order logical rules into logic mining is challenging due to the large number of attributes involved. Furthermore, suboptimal logical rules are trained on an ineffective discrete Hopfield neural network, which leads to suboptimal induced logic. In this paper, we propose higher-order logic mining incorporating a log-linear analysis during the pre-processing phase, the multi-unit 3-satisfiability-based reverse analysis with a log-linear approach. The proposed logic mining also integrates a multi-unit discrete Hopfield neural network to ensure that each 3-satisfiability logic is learned separately. In this context, our proposed logic mining employs three unique optimization layers to improve the final induced logic. Extensive experiments are conducted on 15 real-life datasets from various fields of study. The experimental results demonstrated that our proposed logic mining method outperforms state-of-the-art methods in terms of widely used performance metrics.

Verified
Journal Article
Open access
PDF file
SASITI NOOR FARWINA MOHAMAD ANWAR ANTONY
SITI NOOR FARWINA MOHAMAD ANWAR ANTONY
Muhammad Fatihin Afiq BahariMuhammad Fatihin Afiq Bahari
Muhammad Fatihin Afiq Bahari
One of the challenges in securing wireless sensor networks (WSNs) is the key distribution; that is, a single shared key must first be known to a pair of communicating nodes before they can proceed with the secure encryption and decryption of the data. In 1984, Blom proposed a scheme called the symmetric key generation system as one method to solve this problem. Blom’s scheme has proven to be λ-secure, which means that a coalition of λ+1 nodes can break the scheme. In 2021, a novel and intriguing scheme based on Blom’s scheme was proposed. In this scheme, elliptic curves over a finite field are implemented in Blom’s scheme for the case when λ=1. However, the security of this scheme was not discussed. In this paper, we point out a mistake in the algorithm of this novel scheme and propose a way to fix it. The new fixed scheme is shown to be applicable for arbitrary λ. The security of the proposed scheme is also discussed. It is proven that the proposed scheme is also λ-secure with a certain condition. In addition, we also discuss the application of this proposed scheme in distributed ledger technology (DLT).

1 January 2024 in AIP Conference Proceedings
Verified
Conference Paper
Closed access
PDF file
CYClement Hii Kiing Yion
Clement Hii Kiing Yion
SASITI NOOR FARWINA MOHAMAD ANWAR ANTONY
SITI NOOR FARWINA MOHAMAD ANWAR ANTONY
Elliptic curve cryptography (ECC) has gained popularity over the RSA cryptosystem as it preserves the same security level with lower key sizes. In ECC-based enc Elliptic curve cryptography (ECC) has gained popularity over the RSA cryptosystem as it preserves the same security level with lower key sizes. In ECC-based enc

28 June 2018 in AIP Conference Proceedings
Verified
Conference Paper
Closed access
PDF file
SASITI NOOR FARWINA MOHAMAD ANWAR ANTONY
SITI NOOR FARWINA MOHAMAD ANWAR ANTONY
Hailiza KamarulhailiHailiza Kamarulhaili
Hailiza Kamarulhaili
In this paper, we revisited the elliptic scalar multiplication method namely the Integer Sub-Decomposition (ISD) method. This method was proposed in 2013 and it is an extension from a well-known GLV method. But the original ISD method deals with trivial endomorphism which only works on integer number field. By extending the ISD method into complex quadratic field, more solutions can be obtained. And allowing ISD method to work in complex quadratic field will enable the ISD method to be applicable on special curves, such as curves with j-invariant 0. The curves with j-invariant 0 has one special endomorphism over complex number field. And since in ISD method, three endomorphisms are needed, the second and third endomorphism is chosen in such a way that they belong to the same field as the first endomorphism.

1 January 2017
Verified
Conference Paper
Closed access
SASITI NOOR FARWINA MOHAMAD ANWAR ANTONY
SITI NOOR FARWINA MOHAMAD ANWAR ANTONY
Hailiza KamarulhailiHailiza Kamarulhaili
Hailiza Kamarulhaili
In this paper, we reviewed and revisited two integer decomposition methods, namely the four dimensional GLV method and the ISD method. In 2001, Gallant, Lambert and Vanstone (GLV) introduced the GLV method. Number of variants of GLV methods were developed since then mainly focusing on the extension of the GLV method to higher dimension. Starting with two dimensional GLV up to eight dimensional GLV method was proposed until the year 2014. All these variants adopted single layer decomposition. However, in 2014 the ISD method was proposed where this method employed a two layers decomposition technique. The ISD method is similar to the four dimensional GLV method in terms of number of decompositions performed, but it involved sub-decomposition process. Both methods used similar approaches to compute the decomposed scalars, namely the lattice method, shortest vector problem and efficiently computable endomorphism. In the four dimensional GLV method, two endomorphism were used, Frobenius endomorphism and GLV endomorphism while in the ISD method three GLV endomorphism were used to compute the decomposed scalars.

27 September 2024 in Malaysian Journal of Mathematical Sciences
Verified
Journal Article
Closed access
SASITI NOOR FARWINA MOHAMAD ANWAR ANTONY
SITI NOOR FARWINA MOHAMAD ANWAR ANTONY
CYC. H. K. Yion
C. H. K. Yion
HKH. Kamarulhaili
H. Kamarulhaili
MAM. R. K. Ariffin
M. R. K. Ariffin
FYF. Yunos
F. Yunos
Elliptic curve cryptography involves numerous scalar multiplications, incurring high operational costs. In view of this, fast endomorphism is used to represent scalar multiplications, kP on elliptic curves. In the past, techniques such as Gallant-Lambert-Vanstone (GLV) method and Integer Sub-Decomposition (ISD) method have been proposed to reduce the cost of scalar multiplication on elliptic curves by using fast endomorphism. The GLV method employs a single-layer decomposition, breaking k into k1 and k2, while the ISD method uses a bilayer decomposition. The existence of fast endomorphisms which are constructed based on the concept of isogeny increase the computational efficiency of the GLV approach and reduce the operation count on the ISD method. This paper embeds the fast endomorphisms in the scalar multiplications on one of the family of elliptic curves with j-invariant 0, E0, which is the 192-bit Koblitz curve (Secp192k1). The performance of the ISD method in computing certain scalar multiplications on Secp192k1 in conjunction with fast endomorphisms and other various techniques such as binary representation, NAF representation, w-NAF and sliding windows are computed. The results demonstrated that the ISD method together with fast endomorphism, yields the most promising outcomes. This underscores the advantages of using fast endomorphisms in the ISD method on E0. .