loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Saptarsi Das 1 ; Keshavan Varadarajan 1 ; Ganesh Garga 2 ; Rajdeep Mondal 1 ; Ranjani Narayan 2 and S. K. Nandy 1

Affiliations: 1 Indian Institute of Science, India ; 2 Morphing Machines Pvt. Ltd., India

ISBN: 978-989-8425-71-3

Keyword(s): Elliptic Curve Cryptography, Binary Fields, Flexible Reduction, Polynomial Multiplication.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Cryptographic Techniques and Key Management ; Data Engineering ; Databases and Data Security ; Information and Systems Security

Abstract: Flexibility in implementation of the underlying field algebra kernels often dictates the life-span of an Elliptic Curve Cryptography solution. The systems/methods designed to realize binary field arithmetic operations can be tuned either for performance or for flexibility. Usually flexibility of these solutions adversely affects their performance. For solutions to reduction operation this adverse effect is particularly prominent. Therefore it is a non-trivial task to design a flexible reduction method/system without compromising performance. In this paper we present a method for flexible reduction. The proposed reduction technique is based on the well-known repeated multiplication technique and Barrett reduction. This technique is particularly appealing in the context of coarse-grain programmable architectures where performance of any kernel is heavily influenced by granularity of operations. In this context we propose a design of a polynomial multiplier based on the well-known Interl eaved Galois Field multiplier to accelerate the underlying multi-word polynomial multiplications. We show that this modified IGF multiplier offers a significant improvement in throughput over a purely software realization or a hybrid software-hardware implementation using a conventional polynomial multiplier. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

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

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:
Das S., Varadarajan K., Garga G., Mondal R., Narayan R. and Nandy S. (2011). A METHOD FOR FLEXIBLE REDUCTION OVER BINARY FIELDS USING A FIELD MULTIPLIER.In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011) ISBN 978-989-8425-71-3, pages 50-58. DOI: 10.5220/0003447500500058

@conference{secrypt11,
author={Saptarsi Das and Keshavan Varadarajan and Ganesh Garga and Rajdeep Mondal and Ranjani Narayan and S. K. Nandy},
title={A METHOD FOR FLEXIBLE REDUCTION OVER BINARY FIELDS USING A FIELD MULTIPLIER},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011)},
year={2011},
pages={50-58},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003447500500058},
isbn={978-989-8425-71-3},
}

TY - CONF

JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011)
TI - A METHOD FOR FLEXIBLE REDUCTION OVER BINARY FIELDS USING A FIELD MULTIPLIER
SN - 978-989-8425-71-3
AU - Das S.
AU - Varadarajan K.
AU - Garga G.
AU - Mondal R.
AU - Narayan R.
AU - Nandy S.
PY - 2011
SP - 50
EP - 58
DO - 10.5220/0003447500500058

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.