Scribd
Upload
89 views

Digital Signatures (Sage Implementation) : Example 1: Using Sage, We Can Perform A DSA Sign and Verify

This document provides examples of using Sage to perform digital signature operations. It first shows generating domain parameters, a key pair, and signing and verifying a random value. It then defines functions for domain parameter generation, key pair generation, and the DSA signing algorithm. The functions generate prime numbers p and q for the domain parameters, exponentiate g to generate keys, and compute the DSA signature values r and s given a secret key x and hash value H.

Uploaded by

Ermiyas
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
89 views

Digital Signatures (Sage Implementation) : Example 1: Using Sage, We Can Perform A DSA Sign and Verify

This document provides examples of using Sage to perform digital signature operations. It first shows generating domain parameters, a key pair, and signing and verifying a random value. It then defines functions for domain parameter generation, key pair generation, and the DSA signing algorithm. The functions generate prime numbers p and q for the domain parameters, exponentiate g to generate keys, and compute the DSA signature values r and s given a secret key x and hash value H.

Uploaded by

Ermiyas
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

DIGITAL SIGNATURES

(Sage Implementation)
Example 1: Using Sage, we can perform a DSA sign and verify:
sage: # First we generate the domain parameters
sage: # Generate a 16 bit prime q
sage: q = 1;
sage: while (q < 2^15): q = random_prime(2^16)
. . . .:
sage: q
42697
sage: # Generate a 64 bit p, such that q divides(p−1)
sage: p = 1
sage: while (not is_prime(p)):
. . . .: p = (2^48 + randint(1,2^46)*2)*q + 1
. . . .:
sage: p
12797003281321319017
sage: # Generate h and g
sage: h = randint(2,p−2)
sage: h
5751574539220326847
sage: F = GF(p)
sage: g = F(h)^((p−1)/q)
sage: g
9670562682258945855
sage: # Generate a user public / private key
sage: # private key
sage: x = randint(2,q−1)
sage: x
20499
sage: # public key
sage: y = F(g)^x
sage: y
7955052828197610751
sage: # Sign and verify a random value
sage: H = randint(2,p−1)
sage: # Signing
sage: # random blinding value
sage: k = randint(2,q−1)
sage: r = F(g)^k % q
sage: r = F(g)^k
sage: r = r.lift() % q
sage: r
6805
sage: kinv = xgcd(k,q)[1] % q
sage: s = kinv*(H + x*r) % q
sage: s
26026
sage: # Verifying
sage: w = xgcd(s,q)[1]; w
12250
sage: u1 = H*w % q; u1
6694
sage: u2 = r*w % q; u2
16706
sage: v = F(g)^u1 * F(y)^u2
sage: v = v.lift() % q
sage: v
6805
sage: v == r
True
sage: # Sign and verify another random value
sage: H = randint(2,p−1)
sage: k = randint(2,q−1)
sage: r = F(g)^k
sage: r = r.lift() % q
sage: r
3284
sage: kinv = xgcd(k,q)[1] % q
sage: s = kinv*(H + x*r) % q
sage: s
2330
sage: # Verifying
sage: w = xgcd(s,q)[1]; w
4343
sage: u1 = H*w % q; u1
32191
sage: u2 = r*w % q; u2
1614
sage: v = F(g)^u1 * F(y)^u2
sage: v = v.lift() % q
sage: v
3284
sage: v == r
True

Example 2: The following functions implement DSA domain


parameter generation, key generation, and DSA Signing:
#
# Generates a 16 bit q and 64 bit p, both prime
# such that q divides p−1
#
def DSA_generate_domain_parameters():
g = 1
while (1 == g):
# first find a q
q = 1
while (q < 2^15): q = random_prime(2^16)
# next find a p
p = 1
while (not is_prime(p)):
p = (2^47 + randint(1,2^45)*2)*q + 1
F = GF(p)
h = randint(2,p−1)
g = (F(h)^((p−1)/q)).lift()
return (p, q, g)
#
# Generates a users private and public key
# given domain parameters p, q, and g
#
def DSA_generate_keypair(p, q, g):
x = randint(2,q−1)
F = GF(p)
y = F(g)^x
y = y.lift()
return (x,y)
#
# Given domain parameters p, q and g
# as well as a secret key x
# and a hash value H
# this performs the DSA signing algorithm
#
def DSA_sign(p, q, g, x, H):
k = randint(2,q−1)
F = GF(p)
r = F(g)^k
r = r.lift() % q
kinv = xgcd(k,q)[1] % q
s = kinv*(H + x*r) % q
return (r, s)

You might also like