Professional Documents
Culture Documents
Number
theory
4
Cyclic
groups
• Let
G
be
a
finite
group
of
order
m
(wri:en
mul<plica<vely)
• Let
g
be
an
element
of
G
• Consider
the
set
{g0,
g1,
…}
– We
know
gm
=
1
=
g0,
so
the
set
has
≤
m
elements
– If
the
set
has
m
elements,
then
it
is
all
of
G
!
• In
this
case,
we
say
g
is
a
generator
of
G
• If
G
has
a
generator,
we
say
G
is
cyclic
Examples
• ℤN
– Cyclic
(for
any
N);
1
is
always
a
generator:
{0,
1,
2,
…,
N-‐1}
• ℤ8
– Is
3
a
generator?
{0,
3,
6,
1,
4,
7,
2,
5}
–
yes!
– Is
2
a
generator?
{0,
2,
4,
6}
–
no!
Important
examples
• Theorem:
Any
group
of
prime
order
is
cyclic,
and
every
non-‐iden<ty
element
is
a
generator
• The
DDH
problem
is
hard
rela<ve
to
G
if
for
all
PPT
algorithms
A:
|
Pr[A(G,
q,
g,
gx,
gy,
gz)=1]
–
Pr[A(G,
q,
g,
gx,
gy,
gxy)=1]
|
≤
ε(n)
Rela<ng
the
Diffie-‐Hellman
problems
• Rela<ve
to
G:
– If
the
discrete-‐logarithm
problem
is
easy,
so
is
the
CDH
problem
– If
the
CDH
problem
is
easy,
so
is
the
DDH
problem