Anthony Overmars

Dr. Anthony Overmars

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
28 October 2021 in Systems
Verified
Journal Article
Open access
PDF file
Sitalakshmi VenkatramanSitalakshmi Venkatraman
Sitalakshmi Venkatraman
AOAnthony Overmars
Anthony Overmars
Minh Thong NguyenMinh Thong Nguyen
Minh Thong Nguyen
Smart home automation is expected to improve living standards with the evolution of internet of things (IoT) that facilitate the remote control of residential appliances. There are, however, several factors that require attention for broader successful consumer adoption. This paper focusses on three key barriers: (i) different underlying technologies requiring an integrated voice-based control for ease of use, (ii) lack of trust due to security and privacy concerns, and (iii) unawareness of the use of machine intelligence by users for exploiting the full potential of smartness. Voice-controlled home environments are possible with cloud-based solutions that are being deployed commercially. However, there are drawbacks due to non-standard voice channels and commands with delays in meeting the required response time for real-time services. Adoption is also required to meet with the expected goals of simplicity, security, and integration. To address these barriers, we propose a model integrating IoT services and wireless technologies for developing a secure smart home automation with a voice-controlled artificial intelligence system. We demonstrate the model’s application in a variety of practical use cases, by implementing a secure and smart voice-based system for an integrated control of several home devices seamlessly.

26 September 2020 in Technologies
Verified
Journal Article
Open access
PDF file
AOAnthony Overmars
Anthony Overmars
Sitalakshmi VenkatramanSitalakshmi Venkatraman
Sitalakshmi Venkatraman
Recent growth in the Internet of Things (IoT) looks promising for realizing a smart environment of the future. However, concerns about the security of IoT devices are escalating as they are inherently constrained by limited resources, heterogeneity, and lack of standard security controls or protocols. Due to their inability to support state-of-the-art secure network protocols and defense mechanisms, standard security solutions are unsuitable for dynamic IoT environments that require large and smart IoT infrastructure deployments. At present, the IoT based smart environment deployments predominantly use cloud-centric approaches to enable continuous and on-demand data exchange that leads to further security and privacy risks. While standard security protocols, such as Virtual Private Networks (VPNs), have been explored for certain IoT environments recently, the implementation models reported have several variations and are not practically scalable for any dynamically scalable IoT deployment. This paper addresses current drawbacks in providing the required flexibility, interoperability, scalability, and low-cost practical viability of a secure IoT infrastructure. We propose an adaptive end-to-end security model that supports the defense requirements for a scalable IoT infrastructure. With low-cost embedded controllers, such as the Raspberry Pi, allowing for the convergence of more sophisticated networking protocols to be embedded at the IoT monitoring interface, we propose a scalable IoT security model integrating both the IoT devices and the controller as one embedded device. Our approach is unique, with a focus on the integration of a security protocol at the embedded interface. In addition, we demonstrate a prototype implementation of our IoT security model for a smart water monitoring system. We believe that our modest first step would instill future research interests in this direction.

Verified
Journal Article
Open access
PDF file
AOAnthony Overmars
Anthony Overmars
Sitalakshmi VenkatramanSitalakshmi Venkatraman
Sitalakshmi Venkatraman
Semi-prime factorization is an increasingly important number theoretic problem, since it is computationally intractable. Further, this property has been applied in public-key cryptography, such as the Rivest–Shamir–Adleman (RSA) encryption systems for secure digital communications. Hence, alternate approaches to solve the semi-prime factorization problem are proposed. Recently, Pythagorean tuples to factor semi-primes have been explored to consider Fermat’s Christmas theorem, with the two squares having opposite parity. This paper is motivated by the property that the integer separating these two squares being odd reduces the search for semi-prime factorization by half. In this paper, we prove that if a Pythagorean quadruple is known and one of its squares represents a Pythagorean triple, then the semi-prime is factorized. The problem of semi-prime factorization is reduced to the problem of finding only one such sum of three squares to factorize a semi-prime. We modify the Lebesgue identity as the sum of four squares to obtain four sums of three squares. These are then expressed as four Pythagorean quadruples. The Brahmagupta–Fibonacci identity reduces these four Pythagorean quadruples to two Pythagorean triples. The greatest common divisors of the sides contained therein are the factors of the semi-prime. We then prove that to factor a semi-prime, it is sufficient that only one of these Pythagorean quadruples be known. We provide the algorithm of our proposed semi-prime factorization method, highlighting its complexity and comparative advantage of the solution space with Fermat’s method. Our algorithm has the advantage when the factors of a semi-prime are congruent to 1 modulus 4. Illustrations of our method for real-world applications, such as factorization of the 768-bit number RSA-768, are established. Further, the computational viabilities, despite the mathematical constraints and the unexplored properties, are suggested as opportunities for future research.

23 July 2019 in Computation
Verified
Journal Article
Open access
PDF file
Sitalakshmi VenkatramanSitalakshmi Venkatraman
Sitalakshmi Venkatraman
AOAnthony Overmars
Anthony Overmars
FWFiona Wahr
Fiona Wahr
The information and communications technology (ICT) industry workforce is now required to deal with ’Big Data’, and there is a need to fill the computational skill shortage in data analytics. The integrated skills of combining computer and mathematics capabilities is much sought after by every industry embarking on digital transformation. Studies conducted internationally and by the Australian Industry Group show the requirements for improving computational skills in the workplace. This research takes a positive step to address this issue by introducing visualization and experiential learning in the ICT curriculum in order to uplift mathematics skills required for data analytics. We present the use of such innovative methods adopted in a higher education setting. The results and positive impact achieved through this study are presented.

Verified
Journal Article
Open access
PDF file
AOAnthony Overmars
Anthony Overmars
Sitalakshmi VenkatramanSitalakshmi Venkatraman
Sitalakshmi Venkatraman
The security of RSA relies on the computationally challenging factorization of RSA modulus N=p1 p2 with N being a large semi-prime consisting of two primes p1and p2, for the generation of RSA keys in commonly adopted cryptosystems. The property of p1 and p2, both congruent to 1 mod 4, is used in Euler’s factorization method to theoretically factorize them. While this caters to only a quarter of the possible combinations of primes, the rest of the combinations congruent to 3 mod 4 can be found by extending the method using Gaussian primes. However, based on Pythagorean primes that are applied in RSA, the semi-prime has only two sums of two squares in the range of possible squares N−1, N/2 . As N becomes large, the probability of finding the two sums of two squares becomes computationally intractable in the practical world. In this paper, we apply Pythagorean primes to explore how the number of sums of two squares in the search field can be increased thereby increasing the likelihood that a sum of two squares can be found. Once two such sums of squares are found, even though many may exist, we show that it is sufficient to only find two solutions to factorize the original semi-prime. We present the algorithm showing the simplicity of steps that use rudimentary arithmetic operations requiring minimal memory, with search cycle time being a factor for very large semi-primes, which can be contained. We demonstrate the correctness of our approach with practical illustrations for breaking RSA keys. Our enhanced factorization method is an improvement on our previous work with results compared to other factorization algorithms and continues to be an ongoing area of our research.

15 August 2019 in Cryptography
Verified
Journal Article
Open access
PDF file
Sitalakshmi VenkatramanSitalakshmi Venkatraman
Sitalakshmi Venkatraman
AOAnthony Overmars
Anthony Overmars
The potential benefits of the Internet of Things (IoT) are hampered by malicious interventions of attackers when the fundamental security requirements such as authentication and authorization are not sufficiently met and existing measures are unable to protect the IoT environment from data breaches. With the spectrum of IoT application domains increasing to include mobile health, smart homes and smart cities in everyday life, the consequences of an attack in the IoT network connecting billions of devices will become critical. Due to the challenges in applying existing cryptographic standards to resource constrained IoT devices, new security solutions being proposed come with a tradeoff between security and performance. While much research has focused on developing lightweight cryptographic solutions that predominantly adopt RSA (Rivest–Shamir–Adleman) authentication methods, there is a need to identify the limitations in the usage of such measures. This research paper discusses the importance of a better understanding of RSA-based lightweight cryptography and the associated vulnerabilities of the cryptographic keys that are generated using semi-primes. In this paper, we employ mathematical operations on the sum of four squares to obtain one of the prime factors of a semi-prime that could lead to the attack of the RSA keys. We consider the even sum of squares and show how a modified binary greatest common divisor (GCD) can be used to quickly recover one of the factors of a semi-prime. The method presented in this paper only uses binary arithmetic shifts that are more suitable for the resource-constrained IoT landscape. This is a further improvement on previous work based on Euler’s method which is demonstrated using an illustration that allows for the faster testing of multiple sums of squares solutions more quickly.