Cryptography Reference
In-Depth Information
FIGURE 16.6
FIGURE 16.7
Choose an exponent
such that
• 1 <
e
< (
p
1)(
q
1)
•
e
is relatively prime to (
p
1)(
q
1)
•80
e
≤
N
.
Let
k
be the largest integer not exceeding
N
(1
2/
e
).
Let
r
=
N
k
.
e
2.
Select a random seed
x
0
of bitlength
r
.
3.
For
i
= 1, to
Z
do:
• Compute
y
i
= the lnr of
x
i
1
e
modulo
n
.
• Let
x
i
be the
r
most significant bits of
y
i
.
• Let
z
i
be the
r
least significant bits of
y
i
.
4.
The output sequence is
z
1
,
z
2
,
z
3
, ...,
z
Z
.
z
i
may not be large enough for an application's purposes; in this case, one
concatenates as many of the numbers together as necessary to form a sufficiently large inte-
ger.
The numbers
Search WWH ::
Custom Search