Back to Results
First PageMeta Content
Computer algebra / Numerical linear algebra / Finite fields / Algebraic geometry / Error detection and correction / Gröbner basis / Matrix / Hidden Field Equations / Gaussian elimination / Algebra / Mathematics / Abstract algebra


Small Linearization: Memory Friendly Solving of Non-Linear Equations over Finite Fields Christopher Wolf & Enrico Thomae Horst Görtz Institute for IT-security Faculty of Mathematics
Add to Reading List

Document Date: 2011-12-14 05:32:54


Open Document

File Size: 521,26 KB

Share Result on Facebook

Company

AES / /

Currency

pence / /

/

Event

Reorganization / /

Facility

Enrico Thomae Horst Görtz Institute / University of Bochum / store Memory Considerations / /

IndustryTerm

signatures hybrid strategy algorithm / matrix-vector product / solution nding algorithm / linearization algorithm / micro-processor / non-linear systems / black box algorithms / signatures solution / namely algorithms / transfer algorithm / erent algorithms / overall algorithm / basis algorithms / linear systems / implicit matrix algorithm / /

Organization

University of Bochum / Finite Fields Christopher Wolf & Enrico Thomae Horst Görtz Institute / IT-security Faculty / /

Person

Yang / Chen / Ai / Enrico Thomae Horst / /

Position

vp / Prime Minister / General / cient representative / /

Product

Pentax K-x Digital Camera / Blow D / /

RadioStation

FM 8 / /

Technology

implicit matrix algorithm / cryptography / three algorithms / RAM / erent algorithms / linearization algorithm / Matrix-F5 algorithm / overall algorithm / solution nding algorithm / so-called F5 algorithm / F4 algorithm / last three algorithms / The algorithm / micro-processor / block-Wiedemann algorithm / 1 F. S-Polynomials For Gröbner basis algorithms / 0 Algorithm / black box algorithms / Gröbner Bases algorithms / Gröbner basis algorithms / signatures hybrid strategy algorithm / /

SocialTag