مرکز منطقه ای اطلاع رساني علوم و فناوري - On the Difficulty of Computing Logarithms Over GF (q^m)

DocumentCode :

3647330

Title :

On the Difficulty of Computing Logarithms Over GF (q^m)

Author :

Martin E. Hellman

Author_Institution :

Stanford University

fYear :

1980

fDate :

4/1/1980 12:00:00 AM

Firstpage :

Lastpage :

Keywords :

"Polynomials","Contracts","Educational institutions","Public key","Galois fields"

Publisher :

ieee

Conference_Titel :

Security and Privacy, 1980 IEEE Symposium on

ISSN :

1540-7993

Print_ISBN :

0-8186-0335-6

Type :

conf

DOI :

10.1109/SP.1980.10015

Filename :

6233705

Link To Document :