Digital Signature Algorithm for M-Payment Applications Using Arithmetic Encoding and Factorization Algorithm

Abstract

Mobile communication systems employ an encoding-encryption model to ensure secure data transmission over the network. This model encodes the data and encrypts it before transmitting it to the receiver's end. A non-trivial operation is performed to generate a strong secret key through which the data is encrypted. To support the security level of this model, arithmetic encoding is performed upon the data before encryption. The encrypted data is hashed using a lightweight hashing algorithm to generate a small and fixed length hash digest to overcome the overheads before it is communicated to the other end. To authorize the message being sent by the sender to the receiver, signature plays an important role. To avoid forging using proxy signature, blind signature, etc., a hybrid scheme is proposed in this article. The mobile communication system is enhanced by introducing the hybrid encode-encrypt-hashing mechanism which stands secure against the plain text attacks, mathematical attacks, and increases confidentiality of the data, security of the key, and thereby enhances the security of the system. In this paper, the design is applied over the mobile payment system which is considered as one of the appreciable mobile services. It proves that the designed security model can ensure swift transactions in a secure way.

Practical algorithm substitution attack on extractable signatures

“…This is much more practical than existing works. We will give our subverted schemes for DSA [17], Modified ELGamal [19,20] and Schnorr [22] signature schemes to show the generality of our method. -The basic version of the subverted scheme only maintains a constant state and has a restriction that the message can not repeat.…”