![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Parallel Montgomery Multiplication and Squaring over GF(2 m ) Based on Cellular Automata
Exponentiation in the Galois Field GF(2 m ) is a primary operation for public key cryptography, such as the Diffie-Hellman key exchange, ElGamal. The current paper presents a new...
-
Chapter and Conference Paper
One Round Identity-Based Authenticated Conference Key Agreement Protocol
We propose an identity-based authenticated conference key agreement protocol for multi-party. Our protocol is a protocol meeting a lower bound of only one round for multi-party contributory key agreement proto...
-
Chapter and Conference Paper
Time-Space Efficient Exponentiation over GF(2m)
The modular exponentiation on the finite field is the basic operation in most public key crypto systems. In this paper, we propose a multiplier/squarer which simultaneously processes the modular multiplication...
-
Chapter and Conference Paper
Fast Exponentiaion over GF(2m) Based on Cellular Automata
In this paper, we present a new exponentiation architecture and multiplier/ squarer which are the basic operations for exponentiation on GF(2m). The proposed multiplier/squarer is used as kernal architecture of e...
-
Chapter and Conference Paper
New Parallel Architecture for Modular Multiplication and Squaring Based on Cellular Automata
Modular exponentiation in a finite field is the basic computation involved in most public key crypto systems, such as Diffie-Hellman key exchange, ElGamal, etc. The current paper presents a new parallel archit...