Sze Ling Yeo

  • Citations Per Year
Learn More
Seamless handover over multiple access points is highly desirable to mobile nodes, but ensuring security and efficiency of this process is challenging. This paper shows that prior handover authentication schemes incur high communication and computation costs, and are subject to a few security attacks. Further, a novel handover authentication protocol named(More)
Weil descent methods have recently been applied to attack the Hidden Field Equation (HFE) public key systems and solve the elliptic curve discrete logarithm problem (ECDLP) in small characteristic. However the claims of quasi-polynomial time attacks on the HFE systems and the subexponential time algorithm for the ECDLP depend on various heuristic(More)
In this article we will discuss a new, mostly theoretical, method for solving (zero-dimensional) polynomial systems, which lies in between Gröbner basis computations and the heuristic first fall degree assumption and is not based on any heuristic. This method relies on the new concept of last fall degree. Let k be a finite field of cardinality qn and let k(More)
In this correspondence, we present 129 new linear codes over F<sub>8</sub> and F<sub>9</sub> based on the construction by Xing and Niederreiter using algebraic function fields and places of small degrees. In addition, we construct some global function fields in which the number of rational places improves the lower bounds given by van der Geer and van der(More)
In 1999, Mohammad Peyravian and Don Coppersmith from IBM proposed a structured symmetric key block cipher called CHAIN that supports variable block size, key size and number of rounds. In this paper, we initiate the study of CHAIN's security. More significantly, we show that CHAIN with various block sizes is insecure against impossible differential attack.(More)