scientific article; zbMATH DE number 2081062
From MaRDI portal
Publication:4474169
Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Recommendations
Cited in
(17)- A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects
- Blazing fast OT for three-round UC OT extension
- Message transmission for GH-public key cryptosystem
- An overview of trace based public key cryptography over finite fields
- scientific article; zbMATH DE number 1618041 (Why is no real title available?)
- An overview of the XTR public key system
- About \textsc{Fast} and \textsc{TReX} accelerations
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- On the Computational Efficiency of XTR+
- Looking beyond XTR
- scientific article; zbMATH DE number 1979293 (Why is no real title available?)
- scientific article; zbMATH DE number 1759768 (Why is no real title available?)
- scientific article; zbMATH DE number 2160552 (Why is no real title available?)
- An XTR-based constant round key agreement scheme
- XTR algorithm: efficient and compact subgroup trace representation
- Efficient message transmission via twisted Edwards curves
- Cryptographic Hardware and Embedded Systems - CHES 2004
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 Q4474169)
