Open Access
A highly efficient modular multiplication algorithm for finite field arithmetic in GF(P)
Rainer Blümel,Ralf Laue,Sorin A. Huss +2 more
- 01 Jan 2005
9
TL;DR: This work proposes a new modular multiplication algorithm for GF(P) which has a complexity of only n2 + 7n, which to the knowledge this is superior to the complexity values of any other modular multiplication algorithms forGF(P).
read more
Abstract: The performance of today’s public key cryptosystems depends mainly on the efficiency of the underlying finite field arithmetic, especially the modular multiplication. In this work we propose a new modular multiplication algorithm for GF(P ) which has a complexity of only n2 + 7n. To our knowledge this is superior to the complexity values of any other modular multiplication algorithm for GF(P ).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
On the Computational Practicality of Private Information Retrieval
Radu Sion,Bogdan Carbunar +1 more
- 01 Jan 2006
TL;DR: It is shown that deployment of non-trivial single server PIR protocols on real hardware of the recent past would have been orders of magnitude less time-efficient than trivially transferring the entire database.
•Proceedings Article
On the Practicality of Private Information Retrieval.
Radu Sion,Bogdan Carbunar +1 more
- 01 Jan 2007
TL;DR: A polyether imide resin composition is proposed which has improved ductility and is less harmful to mating parts during sliding and thus can be used as the material for parts requiring rub resistance and abrasion resistance.
95
•Dissertation
Efficient and Flexible Cryptographic Co-Processor Architecture for Server Application
Ralf Laue
- 17 Feb 2009
TL;DR: This work proposes a generic co-processor architecture for RSA, Elliptic Curve Cryptography, and Pairing-Based Cryptography which utilizes a combined HW/SW-design allowing high flexibility without sacrificing efficiency.
10
A novel memory architecture for elliptic curve cryptography with parallel modular multipliers
Ralf Laue,Sorin A. Huss +1 more
- 01 Jan 2006
TL;DR: A novel memory architecture for elliptic curve implementations with multiple modular multiplier units is proposed that allows the execution time to scale with the number of modular multipliers and features nearly no overhead compared to the mere runtime of the multipliers.
10
Parallel Memory Architecture for Elliptic Curve Cryptography over $$ \mathbb{G}\mathbb{F}{\left( p \right)} $$ Aimed at Efficient FPGA Implementation
Ralf Laue,Sorin A. Huss +1 more
- 01 Apr 2008
TL;DR: A novel memory architecture for elliptic curve implementations with multiple modular multiplier units is proposed that allows the execution time to scale with the number of modular multipliers and exhibits nearly no overhead compared to the mere runtime of the multipliers.
8
References
•Book
Handbook of Applied Cryptography
Alfred Menezes,Scott A. Vanstone,Paul C. van Oorschot +2 more
- 01 Jan 1996
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
15K
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Differential Power Analysis
Paul C. Kocher,Joshua M. Jaffe,Benjamin Jun +2 more
- 15 Aug 1999
TL;DR: In this paper, the authors examine specific methods for analyzing power consumption measurements to find secret keys from tamper resistant devices. And they also discuss approaches for building cryptosystems that can operate securely in existing hardware that leaks information.
Use of Elliptic Curves in Cryptography
Victor S. Miller
- 18 Aug 1985
TL;DR: In this paper, an analogue of the Diffie-Hellmann key exchange protocol was proposed, which appears to be immune from attacks of the style of Western, Miller, and Adleman.
Modular multiplication without trial division
TL;DR: A method for multiplying two integers modulo N while avoiding division by N, a representation of residue classes so as to speed modular multiplication without affecting the modular addition and subtraction algorithms.