Zobrazeno 1 - 10
of 45
pro vyhledávání: '"Terry Shue Chien Lau"'
Autor:
Siti Nabilah Yusof, Muhammad Rezal Kamel Ariffin, Sook-Chin Yip, Terry Shue Chien Lau, Zahari Mahad, Ji-Jian Chin, Choo-Yee Ting
Publikováno v:
Heliyon, Vol 10, Iss 4, Pp e25470- (2024)
In 1999, the Polynomial Reconstruction Problem (PRP) was put forward as a new hard mathematics problem. A univariate PRP scheme by Augot and Finiasz was introduced at Eurocrypt in 2003, and this cryptosystem was fully cryptanalyzed in 2004. In 2013,
Externí odkaz:
https://doaj.org/article/23b139b89183424daf571094d07fe185
Autor:
Terry Shue Chien Lau, Muhammad Rezal Kamel Ariffin, Sook-Chin Yip, Ji-Jian Chin, Choo-Yee Ting
Publikováno v:
Heliyon, Vol 10, Iss 2, Pp e24185- (2024)
In recent research, Durandal, a signature scheme based on rank metrics following Schnorr's approach, was introduced to conceal secret key information by selectively manipulating the vector subspace of signatures. Later, an enhancement, namely the SHM
Externí odkaz:
https://doaj.org/article/65b21a6b8f4946629b44e8509afe622a
Autor:
Abderrahmane Nitaj, Muhammad Rezal Bin Kamel Ariffin, Nurul Nur Hanisah Adenan, Terry Shue Chien Lau, Jiahui Chen
Publikováno v:
IEEE Access, Vol 10, Pp 53788-53796 (2022)
The RSA is one of the current default cryptosystems that provides security with applications such as encryptions and digital signatures. It is important to further study the weak characteristics of the RSA to ensure correct utilisation in order not t
Externí odkaz:
https://doaj.org/article/829d16518b2143b9b486c45d5215640e
Autor:
Siti Nabilah Yusof, Muhammad Rezal Kamel Ariffin, Terry Shue Chien Lau, Nur Raidah Salim, Sook-Chin Yip, Timothy Tzen Vun Yap
Publikováno v:
Axioms, Vol 12, Iss 3, p 304 (2023)
The Polynomial Reconstruction Problem (PRP) was introduced in 1999 as a new hard problem in post-quantum cryptography. Augot and Finiasz were the first to design a cryptographic system based on a univariate PRP, which was published at Eurocrypt 2003
Externí odkaz:
https://doaj.org/article/5deb407a58a04eaab4d1fea16d60461b
Autor:
Vaishnavi Nagaraja, Muhammad Rezal Kamel Ariffin, Terry Shue Chien Lau, Nurul Nur Hanisah Adenan, Ji-Jian Chin, Sook-Chin Yip, Timothy Tzen Vun Yap
Publikováno v:
Mathematics, Vol 11, Iss 5, p 1139 (2023)
The identification protocol is a type of zero-knowledge proof. One party (the prover) needs to prove his identity to another party (the verifier) without revealing the secret key to the verifier. One can apply the Fiat–Shamir transformation to conv
Externí odkaz:
https://doaj.org/article/f017742270784ba48a1614fea5d86bf1
Autor:
Terry Shue Chien Lau, Chik How Tan
Publikováno v:
Advances in Mathematics of Communications. 17:353-366
Recently, Ivanov et al. proposed a new approach to construct code-based cryptosystems, namely the \begin{document}$ {\sf IKKR} $\end{document} public-key encryptions (PKE) in the International Workshop on Code-Based Cryptography (CBCrypto 2020) [ 9 ]
Autor:
Nurul Nur Hanisah Adenan, MUHAMMAD REZAL KAMEL ARIFFIN, Sook Chin Yip, Ji-Jian Chin, Vaishnavi Nagaraja, Timothy Tzen Vun Yap, Terry Shue Chien Lau
Publikováno v:
Mathematics
Volume 11
Issue 5
Pages: 1139
Volume 11
Issue 5
Pages: 1139
The identification protocol is a type of zero-knowledge proof. One party (the prover) needs to prove his identity to another party (the verifier) without revealing the secret key to the verifier. One can apply the Fiat–Shamir transformation to conv
Autor:
Terry Shue Chien Lau, Kok Bin Wong
Publikováno v:
Bulletin of the Iranian Mathematical Society. 48:2981-2993
Autor:
Terry Shue Chien Lau, Chik How Tan
Publikováno v:
Designs, Codes and Cryptography. 90:695-717
Autor:
Terry Shue Chien Lau, Kok Bin Wong
Publikováno v:
Linear Algebra and its Applications. 630:179-203
Let S n be the symmetric group on [ n ] = { 1 , 2 , … , n } and Z n ( s ) = { α ∈ S n : α is an s -cycle } where 2 ≤ s ≤ n . In this paper, we determine all the partitions associated with the smallest eigenvalues of the Cayley graph Γ ( S