<--- Back to Details
First PageDocument Content
Cryptography / Algebra / Abstract algebra / Group theory / Computational hardness assumptions / DiffieHellman key exchange / Cyclic group / Logjam / Generating set of a group / Subgroup / Whitfield Diffie / Computational DiffieHellman assumption
Date: 2017-09-13 08:39:05
Cryptography
Algebra
Abstract algebra
Group theory
Computational hardness assumptions
DiffieHellman key exchange
Cyclic group
Logjam
Generating set of a group
Subgroup
Whitfield Diffie
Computational DiffieHellman assumption

Measuring small subgroup attacks against Diffie-Hellman Luke Valenta∗ , David Adrian† , Antonio Sanso‡ , Shaanan Cohney∗ , Joshua Fried∗ , Marcella Hastings∗ , J. Alex Halderman† , Nadia Heninger∗ ∗ Uni

Add to Reading List

Source URL: www.seas.upenn.edu

Download Document from Source Website

File Size: 294,95 KB

Share Document on Facebook

Similar Documents

APPROXIMATING THE FIRST L2 -BETTI NUMBER OF RESIDUALLY FINITE GROUPS arXiv:1011.4739v2 [math.GR] 16 Dec 2010  ¨

APPROXIMATING THE FIRST L2 -BETTI NUMBER OF RESIDUALLY FINITE GROUPS arXiv:1011.4739v2 [math.GR] 16 Dec 2010 ¨

DocID: 1qDY3 - View Document

Spectral Graph Theory  Lecture 13 Cayley Graphs Daniel A. Spielman

Spectral Graph Theory Lecture 13 Cayley Graphs Daniel A. Spielman

DocID: 1pgV6 - View Document

ANUPQ ANU p-Quotient

ANUPQ ANU p-Quotient

DocID: 1ojvq - View Document

FGA Free Group Algorithms A GAP4 Package Versionby

FGA Free Group Algorithms A GAP4 Package Versionby

DocID: 1nHqj - View Document