scientific article; zbMATH DE number 1759300

zbMATH Open0998.68687MaRDI QIDQ4536233FDOQ4536233

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

Publication date: 28 November 2002

Title of this publication is not available (Why is that?)

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

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)

Cited In (13)

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

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)