Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —

Abstract

:The Digital Signature Algorithm (DSA) was l~Oposed in 1991 by the US National Institute of Standards and Technology to provide an appropriate core fur applications requiring digital signatures. Undoubtedly, many applications will include this standard in the future and thus, the foreseen domination of DSA as a legal certification tool is sufficiently important to focus research endeavours on the suitebility of this scheme to various sitnatic~s.In this paper, we prcsant s~x new DSA-based protocols for :9 Perforn~ng a quick batch-verification of, signatures. The proposed scheme allows to make the economy of = 450, modular multiplications. 9 Avoiding the cumbersome calculation of 1 / k rood q by the signer. 9 Compressing sets ofDSA transact/ons into shorter archive signatures. 9 Generating signatures from poe-calculated "Use & Throw" 224-bit signature-coupons. 9 Self-~.ertifying the moduli and bit-patterning directly q on p (gain of 60.4% in key size).All our schemes combine in a natural way full DSA compatibility and flexible U'ade-offs between computational complexity, transmission overheads and key sizes.

Based Scheme of Batch Identification for Invalid Signatures using Game Theory Model in Wireless Mobile Networks

“…A batch verification algorithm is used to determine whether a set of signatures contain invalid ones. In 2008, considering that the verification of massive messages may induces huge time cost in mobile networks, Yu et al proposed an efficient identity-based batch verification scheme to reduce the delay in network coding [6]. Zhang et al [7] discussed a batch signature verification scheme for the communications between vehicles and infrastructure to lower the total verification time.…”

“…Lee et al [7] proposed a method to identify bad signatures in RSA-type batches. Later, Law and Matt [6] presented the quick binary and exponentiation method, to find invalid signatures in the pairing based signature schemes. Stanek [7] showed that method was flawed, and proposed an improved protocol to ©IJRASET (UGC Approved Journal): All Rights are Reserved resist attacks.…”

“…The generic batch identification methods utilize the group testing technique to find invalid signatures with the minimal number of tests, which can be applied with any signature types. Pastuszak et al designed a divide-andconquer verifier [6], which split a batch instance into sub ones, and applied the generic test to each sub-batch recursively, until all bad signatures are identified. Zaverucha et al [8] presented and compared some group testing algorithms for finding invalid signatures.…”

Fast batch modular exponentiation with common-multiplicand multiplication

“…Batch verification, which is firstly introduced by Naccache et al [40], is used to verify multiple signatures simultaneously consuming less time than verifying total individual signatures. Successive research results have achieved improvements in terms of efficiency and security [1,3,4,5,8,9,21,27,51].…”

Generating RSA Moduli with a Predetermined Portion

“…For instance, all members of a group of users may share some fixed number of bits of their RSA moduli, or users may want to include a binary representation of their personal data in their RSA modulus. For DSA keys with a predetermined portion see [13].…”