PARALLEL MULTIPLICATION IN F2n  USING CONDENSED MATRIX REPRESENTATION

Christophe Negre

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

PARALLEL MULTIPLICATION IN F2n USING CONDENSED MATRIX REPRESENTATION

Topics: Coding Theory and Practice; Public Key Crypto Applications

In Proceedings of the International Conference on Security and Cryptography - Volume 0ICETE, 254-259, 2006 , Setúbal, Portugal

Author: Christophe Negre

Affiliation: Équipe DALI, LP2A, Université de Perpignan, France

Keyword(s): Finite field, multiplication, matrix representation, irreducible trinomial.

Related Ontology Subjects/Areas/Topics: Coding Theory and Practice ; Cryptographic Techniques and Key Management ; Information and Systems Security ; Public Key Crypto Applications

Abstract: In this paper we explore a matrix representation of binary fields F2n defined by an irreducible trinomial P = X n + X k + 1. We obtain a multiplier with time complexity of TA + (⌈log 2(n)⌉)TX and space 2 complexity of (2n − 1)n AND and (2n − 1)(n − 1) XOR . This multiplier reaches the lower bound on time complexity. Until now this was possible only for binary field defined by AOP (Silverman, 1999), which are quite few. The interest of this multiplier remains theoretical since the size of the architecture is roughly two times bigger than usual polynomial basis multiplier (Mastrovito, 1991; Koc and Sunar, 1999).

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 52.14.8.34

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Negre, C. (2006). PARALLEL MULTIPLICATION IN F2n USING CONDENSED MATRIX REPRESENTATION. In Proceedings of the International Conference on Security and Cryptography (ICETE 2006) - SECRYPT; ISBN 978-972-8865-63-4; ISSN 2184-3236, SciTePress, pages 254-259. DOI: 10.5220/0002096402540259

@conference{secrypt06,
author={Christophe Negre.},
title={PARALLEL MULTIPLICATION IN F2n USING CONDENSED MATRIX REPRESENTATION},
booktitle={Proceedings of the International Conference on Security and Cryptography (ICETE 2006) - SECRYPT},
year={2006},
pages={254-259},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002096402540259},
isbn={978-972-8865-63-4},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the International Conference on Security and Cryptography (ICETE 2006) - SECRYPT
TI - PARALLEL MULTIPLICATION IN F2n USING CONDENSED MATRIX REPRESENTATION
SN - 978-972-8865-63-4
IS - 2184-3236
AU - Negre, C.
PY - 2006
SP - 254
EP - 259
DO - 10.5220/0002096402540259
PB - SciTePress