A Scalable Architecture for Montgomery Nultiplication

Tenca, A.F.; Koç, Çetin Kaya

doi:10.1007/3-540-48059-5_10

Cited by 125 publications

(135 citation statements)

References 13 publications

Supporting

Mentioning

135

Contrasting

Order By: Relevance

“…Tenca and Koç [35] came up with a scalable pipelined design where the circuit of the Montgomery multiplier is split into "word size" processing elements. Since then, several improvements have been made to their original design [36,39].…”

Section: Related Workmentioning

confidence: 99%

Dedicated Hardware for Attribute-Based Credential Verification

Ottoy

Lapon

Naessens

et al. 2013

Communications and Multimedia Security

View full text Add to dashboard Cite

Abstract. Attribute-based credentials systems offer a privacy-friendly solution to access electronic services. In this field, most research has been directed into optimizing the prover operations and exploring the usability boundaries on mobile platforms like smart cards and mobile phones. This research assumes that the verification of credential proofs occur at a powerful back end. However, a broad range of (embedded) applications lack this powerful back end.This article shows that hardware accelerators for modular exponentiations, greatly reduce the run time of applications that require credential verification in an embedded context. In addition, when verification requires a considerable amount of the total run time (i.e., communication included), the use of dual-base (simultaneous) exponentiation hardware further increases the overall performance.All tests have been performed in a practical setup between a smartphone and an embedded terminal using NFC communication.

show abstract

Section: Related Workmentioning

confidence: 99%

Dedicated Hardware for Attribute-Based Credential Verification

Ottoy

Lapon

Naessens

et al. 2013

Communications and Multimedia Security

View full text Add to dashboard Cite

show abstract

“…Some have been integrating crypto-oriented instructions into the instruction set of General Purpose Processors (GPPs) [5,6,7]. Others had a more scalable approach as depicted in [8]. But none have had a systematic approach where hardware designers would look for a design which would be the 'best' trade-off between speed, security, chip area and power consumption.…”

Section: Having a Quantitative Approachmentioning

confidence: 99%

A Vector Approach to Cryptography Implementation

Fournier

Moore

2006

Digital Rights Management. Technologies, Issues, Challenges and Systems

View full text Add to dashboard Cite

Abstract. The current deployment of Digital Right Management (DRM) schemes to distribute protected contents and rights is leading the way to massive use of sophisticated embedded cryptographic applications. Embedded microprocessors have been equipped with bulky and powerconsuming co-processors designed to suit particular data sizes. However, flexible cryptographic platforms are more desirable than devices dedicated to a particular cryptographic algorithm as the increasing cost of fabrication chips favors large volume production. This paper proposes a novel approach to embedded cryptography whereby we propose a vectorbased general purpose machine capable of implementing a range of cryptographic algorithms. We show that vector processing ideas can be used to perform cryptography in an efficient manner which we believe is appropriate for high performance, flexible and power efficient embedded systems.

show abstract

“…Figure 1 shows the Multiple-word High-Radix (2 k ) Montgomery Multiplication algorithm (MWR2 k MM), a generalization of the MM algorithm presented in [18]. A full-precision High-Radix Montgomery algorithm has been presented and proven to be correct in [8].…”

Section: High-radix Word-based Montgomery Algorithmmentioning

confidence: 99%

“…That is, the operands cannot exceed a fixed bit-size. Designs that can take operands with an arbitrary precision are researched in the ASIC [18] and the FPGA [2] realms.…”

Section: Introductionmentioning

confidence: 99%

“…The basic idea of the scalable Montgomery multiplier has been presented in [18]. The main features of this multiplier are (1) the ability to work on any given operand precision at the kernel level,(2) be adjustable to any chip area, a (3) use a pipelined organization that reduces the impact on signal loads as a result of high precision of the operands.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

High-Radix Design of a Scalable Modular Multiplier

Tenca

Todorov

Koç

2001

Cryptographic Hardware and Embedded Systems — CHES 2001

Self Cite

View full text Add to dashboard Cite

Abstract. This paper describes an algorithm and architecture based on an extension of a scalable radix-2 architecture proposed in a previous work. The algorithm is proven to be correct and the hardware design is discussed in detail. Experimental results are shown to compare a radix-8 implementation with a radix-2 design. The scalable Montgomery multiplier is adjustable to constrained areas yet being able to work on any given precision of the operands. Similar to some systolic implementations, this design avoid the high load on signals that broadcast to several components, making the delay independent of operand's precision.

show abstract

A Scalable Architecture for Montgomery Nultiplication

Cited by 125 publications

References 13 publications

Dedicated Hardware for Attribute-Based Credential Verification

Dedicated Hardware for Attribute-Based Credential Verification

A Vector Approach to Cryptography Implementation

High-Radix Design of a Scalable Modular Multiplier

Contact Info

Product

Resources

About