scientific article; zbMATH DE number 545390

zbMATH Open0808.94015MaRDI QIDQ4286757FDOQ4286757

Authors: Dieter Gollmann 

Publication date: 10 April 1994

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

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

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)

Cited In (10)

• Cryptography arithmetic. Algorithms and hardware architectures
• The design of the ICE encryption algorithm
• A new characterization of dual bases in finite fields and its applications
• Title not available (Why is that?)
• An exposition of the mathematics expected of cryptographic chips
• Almost weakly self-dual bases for finite fields
• Trace-orthogonal normal bases
• DESIGNING A HIGH-SECURITY CIPHER
• Title not available (Why is that?)
• Algebraic circuits

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)