scientific article; zbMATH DE number 545390

MaRDI QIDQ4286757zbMATHFDO

Authors Dieter Gollmann

Publication date 10 April 1994

zbMATH Keywords

algorithmsfinite fieldsnormal basisVLSImodular arithmeticpublic key cryptosystemsextension fields

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• An implementation for a fast public-key cryptosystem
• Cryptography arithmetic. Algorithms and hardware architectures
• Algebraic circuits
• On comparison and analysis of algorithms for multiplication in \(\mathrm{GF}(2^m)\)
• Efficient hardware implementation of finite fields with applications to cryptography

Cited in

(10)

• Algebraic circuits
• The design of the ICE encryption algorithm
• An exposition of the mathematics expected of cryptographic chips
• A new characterization of dual bases in finite fields and its applications
• DESIGNING A HIGH-SECURITY CIPHER
• Cryptography arithmetic. Algorithms and hardware architectures
• Almost weakly self-dual bases for finite fields
• scientific article; zbMATH DE number 4008269 (Why is no real title available?)
• scientific article; zbMATH DE number 3954809 (Why is no real title available?)
• Trace-orthogonal normal bases

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 Q4286757)