MRSA — a new public key encryption method
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.
KeywordsBase Extension Residue Number System Modulo Reduction Cryptographic System Modulo Multiplication
Unable to display preview. Download preview PDF.
- 1.Cooper R.H., Patterson W.: RSA as a Benchmark for Multiprocessor Machines; Proc. “Advances in Cryptology — AUSCRYPT ’90” LNCS, Springer 1990, pp. 356–359Google Scholar
- 4.Beeth Th. et al.; Public key Cryptography, State of the Art and Future Directions; LNCS 578, Springer 1992Google Scholar
- 5.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.4Google Scholar
- 6.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 ’92Google Scholar
- 7.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.Google Scholar
- 12.Lüneburg, H.: Vorlesungen über Zahlentheorie; Elemente der Mathematik vom höheren Standpunkt aus, Band VII, ed. by E. Trost, BirkhäuserVerlag, (basel, 1978).Google Scholar
- 14.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.Google Scholar