Back to Results
First PageMeta Content
Coding theory / Error detection and correction / Theoretical computer science / Numerical analysis / McEliece cryptosystem / Post-quantum cryptography / Niederreiter cryptosystem / List decoding / Horner scheme / Mathematics / Public-key cryptography / Applied mathematics


Fast and Secure Root Finding for Code-based Cryptosystems Falko Strenzke 1 2
Add to Reading List

Document Date: 2012-08-07 11:04:10


Open Document

File Size: 539,06 KB

Share Result on Facebook

City

Darmstadt / /

Company

Atmel / Patterson / Intel / /

/

IndustryTerm

recursive algorithm / eval-div-rf algorithm / software implementation / error correction algorithm / root finding algorithms / concrete algorithms / root finding algorithm / software implementations / respective rootfinding algorithm / software makes / chosen algorithms / computing / exhaustive search / pure software implementations / root-finding algorithms / root-finding algorithm / eval-rf algorithm / /

Organization

Department of Computer Science / U.S. Securities and Exchange Commission / /

Person

Ai / /

/

Position

author / /

ProgrammingLanguage

C / /

Technology

encryption / root-finding algorithms / Cryptography / eval-rf algorithm / rootfinding algorithm / eval-div-rf algorithm / respective rootfinding algorithm / public key / corresponding error correction algorithm / root-finding algorithm / chosen algorithms / BTA-rf algorithms / decoding algorithm / private key / recursive Berlekamp Trace Algorithm / specific root finding algorithms / recursive algorithm / root finding algorithm / /

SocialTag