Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering

DOI10.1007/978-3-642-04159-4_23zbMath1256.94064OpenAlexW1525019419MaRDI QIDQ3644213

Arash Hariri, Éric Schost

Publication date: 3 November 2009

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04159-4_23

zbMATH Keywords

finite fieldsChinese remainder theoremMontgomery multiplicationsubquadratic area complexity

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On arithmetical algorithms over finite fields
• Fast multiplication of polynomials over fields of characteristic 2
• Montgomery multiplication in \(\text{GF}(2^ k)\)
• Modular Multiplication Without Trial Division
• A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
• New frameworks for Montgomery’s modular multiplication method
• Fast convolutions meet Montgomery

This page was built for publication: Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering