scientific article; zbMATH DE number 1759300

MaRDI QIDQ4536233zbMATHFDO

Authors Alexandre Ferreira Tenca, Erkay Savaş, Çetin Kaya Koç

Publication date 28 November 2002

zbMATH Keywords

finite fieldspipeliningMontgomery multiplicationscalable multiplier architecture

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 1878334
• scientific article; zbMATH DE number 1979304
• scientific article; zbMATH DE number 5041007
• Publication:4502772
• Progress in Cryptology - INDOCRYPT 2003

Cited in

(13)

• Montgomery multiplication over rings
• scientific article; zbMATH DE number 1979304 (Why is no real title available?)
• Efficient multiplier architectures for Galois fields GF(2/sup 4n/)
• scientific article; zbMATH DE number 2024675 (Why is no real title available?)
• scientific article; zbMATH DE number 1424173 (Why is no real title available?)
• A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs
• scientific article; zbMATH DE number 1878333 (Why is no real title available?)
• Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\)
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• Efficient realization of large size two's complement multipliers using embedded blocks in FPGAs
• scientific article; zbMATH DE number 1878334 (Why is no real title available?)
• Achieving NTRU with montgomery multiplication
• scientific article; zbMATH DE number 1504803 (Why is no real title available?)

This page was built for publication:

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