\titleofpresentation{Connections between
pseudo-free groups and RSA}

\presenter{Bilal Khan}  %  Name just one speaker, please; collaborators
            %  can be credited in the body of the abstract.

Rivest introduced the notion of a pseudo-free group and showed that if $Z_n$ is pseudo-free
then it also satisfies several cryptographic assumptions, e.g. the Strong RSA Assumption
and the difficulty of computing discrete logarithms.  Later, Daniele Micciancio showed that
the Strong RSA Assumption implies that $Z_n$ is pseudo-free, thereby establishing an equivalence.
In this talk, we will give a survey of cryptographic assumptions and their connections
to the property of pseudo-freeness.  We will then present new results on non-cyclic groups
that are also pseudo-free.

\begin{ourbiblio}{99}  %  Delete this environment if you
               %  aren't giving a bibliography.

\bibitem{bilalkhan1}
R. Rivest, ``On notion of pseudo-free groups,''
  In M. Naor, editor, Proceedings of the First Theory of Cryptography Conference - TCC 2004.

\bibitem{bilalkhan2}

Daniele Micciancio, The RSA group is pseudo-free.
  Advances in Cryptology---Eurocrypt 2005.
  Aarhus, Denmark. May 2005. LNCS 3494, Springer, pp. 387-403.

\end{ourbiblio}

\presenteraddress{City University of New York}  % The name of a university is fine.

\email{grouptheory@hotmail.com}

\web{www.bilalkhan.org}  % Those without homepages should delete this.

% Delete the next line when you are done.


