Cryptography Reference
In-Depth Information
Tabl e 7.
Clock Cycles and Running Time of Two Ane Transformations
L
1
offset
L
1
−
1
L
2
offset
L
2
−
1
Total
Components
Clock cycles
1
4
1
12
18
Running time (
ns
)
20
80
20
240
360
Tabl e 8.
Clock Cycles and Running Time of Polynomial Evaluations
Components
V
i
O
j
V
i
V
j
V
i
Total cycles Total time
The first layer
17
26
2
45
900
ns
The second layer 30
78
3
111
2220
ns
Note here that our implementation focuses solely on speeding up the signing
process, and, in terms of area, we compute the size in gate equivalents (GEs),
about 150,000 GEs, which is 2-3 times the area of [8].
5 Comparison with Related Works
We compare the implementations of solving system of linear equations and
Rainbow signature generation with related works by the following tables, which
clearly demonstrate the improvements of our new implementation.
Tabl e 9.
Comparison of Solving System of Linear Equations with Matrix Size 12
×
12
Scheme
Clock cycles
Original Gauss-Jordan elimination
1116
Original Gaussian elimination
830
Wang-Lin's Gauss-Jordan elimination [12]
48
B. Hochet's Gaussian elimination [13]
47
A Bogdanov's Gaussian elimination [11]
24
Implementation in this paper
12
Table 10.
Performance Comparison of Signature Schemes
Scheme
Clock cycles
en-TTS [5]
16000
Rainbow (42,24) [9]
3150
Long-message UOV [9]
2260
Rainbow [8]
804
Short-message UOV [9]
630
This paper
198
