Disposition to trust, interpersonal trust and institutional trust of mobile banking in Malaysia

Mobile banking refers to the use of smart phones or other mobile devices to perform tasks online banking from your home computer, such as monitoring the account balances, transfer of funds between accounts, pay bills and prepaid top-up. Mobile banking is a new strategy for the bank to enhance their latest technology in a new dynamic marketing environment.The low penetration of mobile banking in Malaysia, especially in terms of adoption patterns is becoming the research interest, especially when compared to the total number of cellular telephone subscriptions. The penetration rate of mobile banking in Malaysia is still in the minority.One of the issues identified by a few researchers is the perception of trust. This article will discuss along the trust issue and its constituents and then after the intention to use of mobile banking services. The bank should enhance their strategy to improve and develop new strategy in order to gain more utilization and adoption on intention to use. This article attempts to discuss on the element of trust to benefit the service provider in Malaysia

Efficient methods to overcome Rabin cryptosystem decryption failure

Rabin cryptosystem is an efficient factoring-based scheme, however, its decryption produces 4-to-1 output, which leads to decryption failure. In this work, in order to overcome the 4-to-1 decryption problem for the Rabin cryptosystem, we propose two distinct methods using the modulus of the type N=p2q coupled with the restriction on the plaintext space M. In the first method, the plaintext space is limited to M ∈ Zpq. For the second method, we restrict the plaintext in the range of M ∈ (0,22n−2). Importantly, we prove that the decryption output of the proposed methods is unique and without decryption failure. The results in this work indicate that the decryption problem of Rabin cryptosystem is overcome

Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem

We propose a new efficient method to overcome the 4 to 1 decryption failure for the Rabin cryptosystem by reducing the phase space of plaintext from M ε ℤ to M ε 22n-2, 22n-1 ⊂ ℤpq, where pq is a product of 2 strong primes and pq ε 22n, 22n+2. Instead of utilizing the pubic modulus N = pq, we use N = p2q. Upon decrypting by using the private modulus d = pq via the Chinese Remainder Theorem, we prove that there exist only one plaintext from the 4 roots obtained that will reside within the interval 22n, 22n+2. As a result, the decryption failure is overcome and this technique also enhances the decryption process for the Rabin cryptosystem. Furthermore, we make analytical comparison with other methods designed in previous literature to overcome the Rabin cryptosystem problem

On the correlation of theory and experiment for transversely isotropic nonlinear incompressible solids

A novel strain energy function for finite strain deformations of transversely isotropic elastic solids which is a function five invariants that have immediate physical interpretation has recently been developed. Three of the five invariants are the principal stretch ratios and the other two are squares of the dot product between the preferred direction and two principal directions of the right stretch tensor. A strain energy function, ex- pressed in terms of these invariants, has a symmetrical property almost similar to that of an isotropic elastic solid written in terms of principal stretches. This constitutive equation is attractive if principal axes techniques are used in solving boundary value problems and experimental advantage is demonstrated by showing a simple triaxial test can vary a single invariant while keeping the remaining invariants fixed. Explicit expressions for the weighted Cauchy response functions are easily obtained since the response function basis is almost mutually orthogonal. In this paper a specific form of the strain energy function for incompressible materials which is linear with respect to its physical parameters is developed. When a curve fitting method is (sensibly) applied on an experimental data, the values of the parameters are obtained uniquely via a linear positive definite system of equations. The theory compares well with experimental data and the performance of the proposed specific form is discussed. A constitutive inequality, which may reasonably be imposed upon the material parameters, is discussed

AAβ public-key cryptosystem - a practical implementation of the new asymmetric

This paper aims to provide a practical implementation one of a probabilistic cipher proposed by M.R.K. Ariffin, M.A. Asbullah and N.A. Abu called as AAβ. We provide details on designing and implementing the AAβ algorithm. Furthermore, to support our understanding by providing a statistical analysis of times taken to implement the key generation, encryption and decryption algorithm for the key sizes 3072, 6144, 9216 and 12288 bits for message spaces of 4n where n = 512, 1024, 1536 and 2048 bits. We show the working of the AAβ algorithm purely from a practical standpoint to justify if it is practically implementable even for large data sets operating on large key sizes

AAβ public key cryptosystem - a comparative analysis against RSA and ECC

This paper aims to provide a comparative analysis between probabilistic and deterministic security models. We provide a benchmark by practically implementing and comparing three ciphers - AAβ, RSA and ECC. This paper provides the algorithms to implement these ciphers as well as highlights the operating time and performance for varying key sizes of 128/1024/3072, 160/2048/6144 and 192/4096/12288 bits. We target our implementation to justify if the probabilistic model - AAβ, can perform equivalently against deterministic models so as to be considered to be used in practical scenarios today

A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q

In this paper, we introduce a new scheme based on the hardness of factoring integers of the shape N = p2q. Our scheme uses a combination of modular linear and modular squaring. We show that the decryption is 1-to-1 which is a great advantage over Rabin's cryptosystem. Its encryption speed has a complexity order faster than RSA and ECC. For decryption its speed is better than RSA and is marginally behind ECC. Constructed using a simple mathematical structure, it has low computational requirements and would enable communication devices with low computing power to deploy secure communication procedures efficiently