Efficient key agreement and signature schemes using compact representations in GF(p/sup 10/)

Abstract

This paper presents a efficient key agreement and signature schemes using compact representations in GF(p/sup 10/). We propose an analogous system using GF(p/sup 10/) which gives a 60% reduction in bandwidth from the canonical representation. We also present a signature scheme based on a new problem called the trace discrete log problem (Trace-DLP problem).