Journal of Global Research in Computer Sciences
MenuISSN: 2229-371X
ISSN: 2229-371X
| Vaishali C. Sanap*, Aditi Jahagirdar and Meenakshi A. Thalor Department of Information Technology, University Of Pune, Pune ,India |
| Corresponding Author: Vaishali C. Sanap, E-mail: sanapvaishali@rediff.com |
| Related article at Pubmed, Scholar Google |
Visit for more related articles at Journal of Global Research in Computer Sciences
Watermarking is a technique of hiding information in image including scanned text, figures, and signatures in such a way that it is difficult to intercept. In this paper, we proposed a digital image watermarking algorithm based on wavelet transform. Arnold transform and human visual characteristics is used to scramble the original watermark. In the embedding process two sub-bands which are in the same direction but in different resolution are selected when the carrier image is decomposed by two-layer wavelet transform. In the process of watermark extraction, the watermarks are detected by using the embedded position and scaling parameter a after the wavelet decomposition of the watermarked image and the original image.
INTRODUCTION |
| A digital signature scheme is a process by which a receiver can verify the authenticity of the origin of a message, as well as be assured of its integrity simultaneously. The scheme is based on the public-key cryptographic system [1] and requires that the signer maintain two keys – one private (or secret-key), and another, a public-key; the latter assumed to be safely maintained by a Trusted Centre (TC), and is available to anyone. The private-key is strictly and confidentially maintained by its owner. A message-digest of the file to be signed, is computed first, followed by applying the signing algorithm on this digest using the signer’s private key. Optionally, instead of the digest, the entire message can be used as well, however, using the digest instead of the message is computationally more efficient for signing purposes. The original file, the generated signature, and optionally the signer’s public-key, are sent to the receiver, who re-computes the digest and verifies the signature using the signer’s public-key. If the verification succeeds, the message is authentic (i.e. it is indeed the claimant who has sent the message), and it has not been altered in transit. The security of this scheme lies in the computational difficulty in solving the discrete logarithm problem [18], which would otherwise lead to the discovery of the signer’s private key from the corresponding public-key. |
| The signing process requires the generation of an integer, called the nonce or ephemeral key, which must be generated randomly or pseudo-randomly, and must be unique for all messages originating from that sender. If an attacker ever recovers the nonce that has been used to sign the message, perhaps by exploiting some properties of the pseudorandom number generator used to generate it, he/she can recover the signer’s private-key. Moreover, if the signer uses the same nonce to sign two messages, the attacker can recover the private-key even if he/she is unaware of the actual value of the nonce used [13] [14]. |
| The Digital Signature Standard (DSS) [2] suggests two ways for generating the nonce, but both suffer from being vulnerable to lattice attacks as shown by various papers [5] [7] [8] [9], due to the use of a Linear Congruential Random Bit Generator (RBG), which suffers from the flaw that they are predictable once the seed used to initialize it is revealed. RBGs are of the form: f(n)=(a+b×n)(mod m), where a, b, and m are parameters to the function. Seemingly random numbers are returned by the function because the numbers form a part of a very large sequence that is unavailable for instant comparison. However, the values for these parameters can be estimated if a large number of nonces are mistakenly revealed. |
| The nonce, when instead of being generated randomly, is rather chosen arbitrarily by the signer, reveals another flaw in the DSA scheme. There exists a subliminal channel [17] in DSA, through which the signer and the verifier can communicate secretly by exchanging messages through each signature. Since however the nonces must be random, and messages, by nature, are non-random – the signer must encrypt the messages, preferably using a one-time pad, and then use this encrypted random message as the nonce. It should be clear that the maximal length of the message should be that of the size of the nonce. The receiver, on the other hand should be aware of the signer’s private-key to obtain this nonce, and hence, the message. |
| Our proposed scheme generates nonces securely, and is not based on Linear Congruential number generators. Instead, it uses Cryptographically Secure Pseudo-Random Number Generators (CSPRNGs) as well as additional masking processes, to make the nonce generation process foreseeably secure. Section 2 of this paper recapitulates on the Digital Signature Algorithm as laid down in the NIST’s standard, followed by an overview of the attacks on DSA in Section 3, where several lattice as well as non-lattice attacks are mentioned, specifically targeted at the nonce generation process of DSA. Section 4.1 presents the proposed algorithm for secure nonce generation, and Sections 4.2 – 4.10 explain the key steps of the algorithm. Finally in Section 5, we conclude with our results and an informal security analysis of our algorithm, stating the advantages of implementing it in any signature generation scheme based on DSA. |
DIGITAL SIGNATURE ALGORITHM |
| The National Institute of Standards and Technology (NIST) of the U.S. Govt. published the Digital Signature Standard (DSS) under FIPS PUB 186-3 [2], which proposed an algorithm, known as Digital Signature Algorithm (DSA), for generation and verification of digital signatures. A brief review of the algorithm is given below. In DSA, a Trusted Center (TC) is responsible for generating and publishing system parameters for public usage. |
| Parameter Sizes |
| (L, N): it is a bit-length pair for generation of system parameters. For the purposes of our algorithm: L=2048 and N=224. |
| System Parameters |
| p: A prime modulus, where 2L-1 < p < 2L |
| q: A prime divisor of (p-1), where 2N-1 < q < 2N |
| g: h(p-1)/q (mod p), where h is a random integer with 1 < h < p |
| Private and Public Keys |
| x: each user selects an integer x as his private-key, with 1 < x < q |
| y: corresponding to x, the user computes y=gx (mod p) |
| Signature Generation |
| The signer computes the following values corresponding to a message m to be signed: |
| k: a secret number that is unique to each message; k is an integer, which is generated randomly or pseudo-randomly, in the range [1, q-1]. (From here on in this document, k is referred to as the “nonce”) |
| r=(gk (mod p) ) (mod q) |
| s=(k-1. (H(m)+x.r) ) (mod q) where, H(m) is a one-way keyless hash function |
| The pair (r, s) constitutes the digital signature of the message m, signed by the user with public-key y and private-key x. |
Signature Verification |
| To verify the signature pair (r, s), the recipient computes: |
| w=s-1 (mod q) |
| u1=(w×H(m) ) (mod q) |
| u2=(w×r) (mod q) |
| r'=(gu1×yu2 (mod p) ) (mod q) |
| If r=r' the signature is authentic, otherwise not. |
`ATTACKS ON DSA |
| Computational Basis of DSA Security |
| The security of DSA is based on the computational difficulty in solving the discrete logarithm problem in prime fields and its subgroups, and it can be proved under the random oracle model [3], which assumes that the hash function behaves like a random oracle, i.e. its values are independent and uniformly distributed. It is cautioned in the standard that if the nonce (k) is disclosed, the secret-key can be easily recovered. |
| The Insecurity of Standard RBG |
| Standard Random-Bit Generators (RBGs) are typically used to generate random bits in software/hardware using a Linear Congruential Generator (LCG). One of the most commonly used is the Knuth’s LCG [15]. It was shown by Belarre et al. [4] that the secret-key of DSA can be recovered if the nonce is generated by Knuth’s linear congruential generator with known parameters. This attack is provable and relies on Babai’s approximation algorithm [5], based on the LLL algorithm [6]. Howgrave-Graham and Smart [7] showed that, even if the nonce is known only partially, i.e. only some of its bits are revealed, for a reasonable number of signatures, a number of heuristic attacks are possible to recover the secret-key. Finally, Nguyen and Shparlinski [8] presented a provable polynomial-time attack against DSA when the nonces are partially known, under two assumptions: the size of q should not be too small compared to p, and the probability of collisions for the hash function H should not be too large compared to 1/q. Under these conditions, if for a certain number of random messages μM and random nonces k[1,q-1], about log(1/2) q least significant bits of k are known, then in polynomial time, one can recover the signer’s secret-key x. |
SECURE NONCE GENERATION |
| The Proposed Algorithm |
| Our algorithm proposes to augment the existing signature algorithm with a secure nonce-generation process in place of the existing schemes recommended by DSS. Our algorithm (Algorithm I) uses a cryptographically secure pseudorandom number generator (CSPRNG) instead of the simple RBG with additional processing to improve security. |
| A brief outline of our algorithm (Algorithm I) is as follows: |
| a) The algorithm takes two parameters as input; first is the message or data to be signed (the first 2048 bytes of it, if the message is larger than that), stored in the byte-vector M, and the second is the signer’s 224-bit private-key. The algorithm begins with padding and dividing the message into 512-bit blocks, while the 224-bit key goes through two rounds of key-expansions to generate a 512-bit key suitable for use in our algorithm. The initial key-expansion (Section 4.2) expands it from 224 bits to 256-bits. This is known as the Partially Expanded Key (PEK). The second round of expansion is the Rijndael expansion (Algorithm II), (which is the standard Rijndael key-expansion [10] routine performed twice), expanding it further to 512-bits (Section 4.4). This is now referred to as the Fully Expanded Key (FEK). |
| b) The algorithm then iterates 32 times, once for each of the 512-bit blocks. In each round, the following steps are performed: |
| i. A different 512-bit round-key is generated in each round using a CSPRNG. |
| ii. The 512-bit message-block for this round undergoes a block-substitution (Section 4.6, Algorithm III) using the PEK as the key, to obtain the Substituted-Message-Block (SMB). The substitution is achieved in a Feistel network of 8 rounds, and each round consists of the following: |
| a) A different 256-bit round-key is generated (Algorithm IV) for each round using the PEK as input. |
| b) The message-block is divided into two halves, of 32-bytes each. A copy of the left-half and the round-key are then encrypted (using Algorithm V). |
| c) The right-half is XOR-ed with the encrypted block, and finally, the data for the next round is formed by concatenation of the original left-half and the currently modified right-half. |
| iii. The SMB and the Round-Key is passed through the Shabal Key-Permutation Schedule [11] for a permutation operation (Section 4.7), to obtain a 896-bit output. |
| iv. The 896-bit permuted block undergoes a compression (Section 4.8, Figure 1) followed by a substitution (Section 4.9) using the non-invertible S-Box Z (see Table I) to obtain a 512-bit output, known as the Compressed-Permuted Message-Block (CPMB). |
| v. The FEK is modified to store the bitwise XOR of the CPMB and the current value of the FEK. |
| c) The modified FEK is hashed using HMAC SHA-512, using the PEK as the key, to obtain the digest (Section 4.8). |
| d) The digest obtained in the previous step is compressed (Section 4.8, Algorithm VI), from 512-bits to 224-bits, to finally generate the nonce. |
| A detailed description of the algorithm steps are outlined below. |
 |
| Initial Key Expansion |
| Our algorithm requires a 256-bit key, but the signer’s private-key is only of 224-bits. This calls for a key expansion, which randomly selects 4-bytes out of the 28-bytes making up the key. These 4-bytes are then appended to get a 32-byte key to be used for the subsequent steps. |
| Message Padding and Division into Blocks |
| The message or data is first null-padded to make it a multiple of 512-bits. It is then divided into equal blocks of 512-bits each. Only the first 2048 bytes of the message is considered. The value of n is set to the number of blocks so obtained, where 1≤ n ≤ 32. |
| Final Key Expansion (Rijndael Expansion) |
| The expanded secret-key (256-bit) and the constant A (see Table I) are passed to the 2nd key expansion routine for a further round of expansion, from 256-bits to 512-bits using the Rijndael [10] key-expansion algorithm (Algorithm II). The key-expansion is achieved by dividing the input into 2 sets of 128-bits each, and then expanding each set to 256 bits. The state array is a set of two 4x4 byte-matrix, and the key is copied to it in column-major fashion, and subsequently read out row-wise as 32-byte blocks. These are then XOR-ed with the message-block. The byte-substitution made by the subroutine G (from the standard Rijndael subroutine) uses the Rijndael S-Box to perform the substitution. The value returned by this subroutine is XOR-ed with the modified data-block to initialize an extended data-block. This is then used as the seed in the subsequent iterative rounds, in each step of which, an extended data-block is generated on the basis of the previous extended-block and its corresponding modified-data-block. The final 512-bit output is generated by alternate concatenations of one data-block and one extended-data-block. |
 |
| Secure Random Key Generation |
| The algorithm proceeds in n rounds, where n is the number of 512-bit blocks in the message. Each round requires a 512-bit random-key which is generated using a cryptographically secure pseudorandom generator and hence, is sufficiently unpredictable. Standard CSPRNG implementations are widely available in various programming language libraries. |
| Initial Block Substitution |
| In each round, the corresponding message-block is first combined with the key using a substitution algorithm (Algorithm III). The process consists of 8 rounds with each round using a different round-key, generated from the original key using a round-key generation algorithm. The round-key for a round is generated, using Algorithm IV, by circularly left-shifting the round-key of the previous round by 1 or 2 bits (depending on the particular round), and then XOR-ing it with the constant P (see Table I). The rounds in the block-substitution process implement a Feistel [16] cipher with block- size of 512-bits. At each step, the data is divided into two halves of 256-bits each. The left-half is the same as the right-half generated after the previous-round. The right-half is obtained by XOR-ing the previous left-half and the output of the round-cipher algorithm, which takes the previous-right-half and the round-key as parameters. The round-cipher algorithm (Algorithm V) performs a byte substitution using the Rijndael S-Box on the data and XORs it with the round-key to return the result. |
| Block Permutation (Shabal Permutation) |
| After block substitution, the data undergoes a keyed permutation using the Shabal [11] key permutation algorithm, and the round-key generated in the previous step. The permutation result consists of a pair of blocks of 384 and 512 bits respectively, which are then concatenated to get a 896-bit output. This output is then fed to the CompSub function (see Algorithm I), which consists of 2 steps: Block compression followed by a second block substitution. |
 |
| Block Compression |
| The permuted output from the Shabal algorithm is then compressed using a 7:4 bit compression, proceeding from the most significant bit to the least significant in groups of 7 bits and replacing each group with a 4-bit nibble using XOR operations, as shown in Fig. 1, to get a 512-bit output. |
| Second Block Substitution |
| The 512-bit output from the block compression phase is fed into a substitution phase, which is different from the block substitution performed in Algorithm III. Here, each of the 64 bytes is passed through a 16x16 non-invertible S-Box Z (see Table I). The result of the substitution is finally XOR-ed with the cumulative cipher-block G in the main nonce generation algorithm. |
| Digest Generation and Compression |
| The result from the Shabal permutation is passed to the digest generation function, which is a keyed HMAC using the SHA-512 algorithm to generate message digests. The resulting 512-bit digest is further compressed (Algorithm VI) to finally generate the 224-bit nonce. The compression process consists of 3 steps. Firstly, each successive pair in the digest is XOR-ed together, resulting in a 256-bit digest. This is followed by the first 4 bytes being XOR-ed with the corresponding last 4 bytes, and then discarding the last 4 bytes, leaving a 224-bit digest. Finally, this is XOR-ed with the constant Q (see Table I), to generate the nonce, which can then be used in the DSA signature generation process. |
 |
RESULTS AND ANALYSIS |
| Results |
| Our proposed algorithm was implemented using Java [20]. The constants used in our algorithm are tabulated in Table I [19]. The running time of our algorithm is longer than the simple pseudorandom nonce generation process recommended in DSS. However, our algorithm is more secure, and is still fast, with a constant time complexity of O(1) since it is independent of the message-length. As per our results, our algorithm exhibits strong avalanche effect, as shown in Table II. The results of the both the Chi-Square tests as well as the Monte-Carlo tests, suggests strong randomness as tabulated in Table II. |
| Analysis |
| The nonces generated through our algorithm are secure for use in digital signatures due to the following: a) The resulting nonces from our algorithm are not biased toward the lower range of the DSA domain parameter q, due to the lack of any modulo q operation, which would otherwise have proved fatal [9]. |
| 6. B) DUE TO THE ADOPTION OF CSPRNG IN GENERATING THE ROUND-KEYS, THE OUTPUT IS COMPLETELY UNPREDICTABLE AND UNIQUE EACH TIME A MESSAGE IS SIGNED. THE INCLUSION OF THE MESSAGE ITSELF IN THE GENERATION OF THE NONCE ADDS ANOTHER LAYER OF RANDOMNESS AND, ALTHOUGH THE MESSAGE IS KNOWN, THE PROCESSING IT GOES THROUGH INSIDE OUR ALGORITHM, SUFFICIENTLY RANDOMIZE THE OUTPUT. THIS IS SUGGESTED FROM OUR RANDOMNESS TESTS. |
| 7. C) SINCE THE NONCE IS GENERATED THROUGH OUR ALGORITHM AND THE USER HAS NO INFLUENTIAL CONTROL OVER IT, THE SUBLIMINAL CHANNEL IN DSA HAS BEEN CLOSED. ALTHOUGH THE USER CAN CHOOSE THE PLAINTEXT, THE GENERATED NONCE CANNOT BE PREDICTED AND HENCE, OUR ALGORITHM IS SECURE IN THIS RESPECT AS WELL. |
| 8. D) THE ALGORITHM USES NON-INVERTIBLE S-BOXES AS WELL AS STANDARD ONE-WAY HASH FUNCTIONS, AND HENCE, THE PRIVATE-KEY CANNOT BE RECOVERED FROM THE NONCE. |
 |
 |
CONCLUSION |
| Digital Signatures form the basis for message authenticity and non-repudiation in modern communication. The entire security of the DSA Algorithm lies in keeping the signer’s private-key secret. However, the leaking of bits of the random nonce, seriously compromises this security by enabling an attacker to calculate the private-key from this nonce. Hence, it is extremely crucial that this random nonce be generated in a more secure way that is sufficiently random, unpredictable, and unique for each message. Common pseudorandom sequence generators are insufficient for such purposes, as they can be predictable. Our algorithm improves upon the existing DSA algorithm to enhance its security at the cost of running-time. We believe that this enhanced version of DSA can be successfully used for entity authentication in electronic transactions requiring strict authentication like e-banking [12], e-commerce [23], e-learning [21], and e-governance [22]. |
 |
References |
|