A Chinese Remainder Theorem Approach to Bit-Parallel <inline-formula><tex-math>GF(2ⁿ)</tex-math> <alternatives><inline-graphic xlink:type="simple" xlink:href="fan-ieq1-2428704.gif"/></alternatives></inline-formu

DOI10.1109/TC.2015.2428704zbMATH Open1360.94412OpenAlexW2060368140MaRDI QIDQ2985605FDOQ2985605

Authors: Haining Fan 

Publication date: 16 May 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2015.2428704

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Parallel algorithms in computer science (68W10) Combinatorial codes (94B25)

Cited In (2)

• Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
• A three-term Karatsuba multiplier for a special class of trinomials

This page was built for publication: A Chinese Remainder Theorem Approach to Bit-Parallel <inline-formula><tex-math>$GF(2^{n})$</tex-math> <alternatives><inline-graphic xlink:type="simple" xlink:href="fan-ieq1-2428704.gif"/></alternatives></inline-formu

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985605)