Abstract
This paper focuses on the key generation problem for a modified RSA public key cryptographic system based on the RNS arithmetic. The RNS based modification of the well known RSA algorithm uses highly parallel computation with the restriction that only a subset of key triples (D,ekey,dkey) of a conventional RSA system can be adopted. These restrictions result from the choice of base elements used. The present work shows that the remaining set of possible keys is still large enough to be used in a realistic cryptographic system. The encryption machine under discussion can use parallelism and thus high speed. A rather straight forward algorithm for the generation of keys can be given. The resulting key space can be viewed as satisfactory. The method gives an additional degree of freedom for the implementation on parallel systems avoiding all conversions between number systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Reference List
Cooper R.H., Patterson W.: RSA as a Benchmark for Multiprocessor Machines; Proc. “Advances in Cryptology — AUSCRYPT ’90” LNCS, Springer 1990, pp. 356–359
Montgomery L.: Modular Multiplication Without Trial Division; Mathematics of Computation, Vol. 44, No. 170, April 1985, pp. 519–521.
Posch K.C., Posch R.: Approaching encryption at ISDN speed using partial parallel modulus multiplication; Microprocessing and Microprogramming, North-Holland, 29, (1990), pp. 177–184.
Beeth Th. et al.; Public key Cryptography, State of the Art and Future Directions; LNCS 578, Springer 1992
Ivey P.A., Walker S.N., Stern J.M., Davidson S.: An Ultra-High Speed Public Key Encryption Processor; IEEE Custom Integrated Circuits Conference, 1992, pp. 19.6.1–19.6.4
Lippitsch P., Posch K.C., Posch R., Schindler V.: A scalable RSA design with encryption rates from 200 Kbit/sec to 1,5 Mbit/sec; Poster at CRYPTO ’92
Posch R.: A Parallel Approach to Long Integer Register Oriented Arithmetic; Fifth International Conference on Parallel and Distributed Computing and Systems; Oct 1.–3. 1992, Pittsburgh, PA.
Schoenfeld L.: Sharper bounds for the Chebychev functions Θ(x) ans Ψ(x); II, Math. Comp. 30, (1976), pp 337–360.
Rivest R., Shamir A., Adlemann L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems; Comm. of the ACM (Feb. 1978),pp. 120–126.
Knuth D.E.: The Art of Computer Programming, Vol 2, Addison Wesley, Reading, Mass., 1969
Wallace C.S.: A suggestion for a fast multiplier; IEEE Transaction on Electronic Computers, Vol. EC-13, Feb. 1964, pp. 14–17.
Lüneburg, H.: Vorlesungen über Zahlentheorie; Elemente der Mathematik vom höheren Standpunkt aus, Band VII, ed. by E. Trost, BirkhäuserVerlag, (basel, 1978).
Denning D.E.: Cryptography and data security; Addison Wesley, Reading, Mass., 1983
Posch K.C, Posch R.: Residue number systems a key to parallelism in public key cryptography; Fourth IEEE Symposium on Parallel and Distributed Processing; Dec. 1.–4. 1992, Dallas.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag London Limited
About this paper
Cite this paper
Posch, R. (1993). MRSA — a new public key encryption method. In: Górski, J. (eds) SAFECOMP ’93. SAFECOMP 1993. Springer, London. https://doi.org/10.1007/978-1-4471-2061-2_33
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2061-2_33
Published:
Publisher Name: Springer, London
Print ISBN: 978-3-540-19838-3
Online ISBN: 978-1-4471-2061-2
eBook Packages: Springer Book Archive