Back to Results
First PageMeta Content
Finite fields / Electronic commerce / Cryptography / RSA / XTR / ElGamal encryption / Discrete logarithm / Abstract algebra / Public-key cryptography / Mathematics


LNCSWhy Textbook ElGamal and RSA Encryption Are Insecure
Add to Reading List

Document Date: 2009-11-10 09:37:20

Open Document

File Size: 222,67 KB

Share Result on Facebook

City

Paris / /

Company

The Subgroup Rounding Problems / Multiplicative Subgroup / /

Country

France / United States / /

Currency

pence / /

/

Facility

Victor Shoup’s NTL library / Stanford University / /

IndustryTerm

few solutions / dichotomy search / clever solution / exhaustive search attacks / secure systems / on-line work / efficient solution / previous algorithm / obvious solution / on-line computation work / plain systems / computing / symmetric algorithm / insecure systems / on-line computation time / /

OperatingSystem

Linux / /

Organization

Stanford University / Ecole Normale Sup´erieure / Organization of the Paper In Section / /

Person

Dan Boneh / Antoine Joux / Phong Q. Nguyen Dividing / Phong Q. Nguyen / /

Product

M-16 / /

ProgrammingLanguage

D / /

ProvinceOrState

California / /

SportsLeague

Stanford University / /

Technology

Encryption / Alpha / previous algorithm / 3 Algorithms / symmetric algorithm / following algorithm / public key / plain RSA encryption / Linux / plain ElGamal encryption / RSA encryption / private key / secret key / public key system / ElGamal encryption / 2-table algorithm / public key encryption / /

URL

http /

SocialTag