Back to Results
First PageMeta Content
Finite fields / Cryptographic protocols / Diffie–Hellman problem / Trapdoor function / Hellman / XTR / CDH / Diffie–Hellman key exchange / Discrete logarithm / Cryptography / Abstract algebra / Computational hardness assumptions


ECRYPT II   ICT[removed]ECRYPT II European Network of Excellence in Cryptology II
Add to Reading List

Document Date: 2013-03-26 12:35:28


Open Document

File Size: 443,55 KB

Share Result on Facebook

City

DDH / /

Company

BP / Inner Automorphism Group / /

Facility

Auckland University / University of Haifa / University of Adelaide / Shannon Institute / /

Holiday

Assumption / /

IndustryTerm

braid group conjugacy search problem / conjugacy search problem / e-th / /

Organization

University of Adelaide / Shannon Institute / European Commission / Commission of the European Communities / University of Haifa / Katholieke Universiteit Leuven / Auckland University / /

Person

Naomi Benger / Biljana Cubaleska / Dario Catalano / Nigel Smart / Vijay Singh / Benoit Libert / David Bernhard / Khaled Ouafi / Frantisek Polach / Dario Fiore / Manuel Charlemagne / Steve Williams / Michael Schneider / David Conti / David Galindo / Vincenzo Iovino / Jorge Villar Santos / Danny Lynch / Richard Moloney / Hans Loehr / Steven Galbraith / Mario Di Raimondo / Jens Hermans / Richard Lindner / /

Position

SVP / Cryptography Editor / years Lead contractor / /

Technology

Cryptography / SDH / DLP / /

SocialTag