Skip to main content

PC-RSA A cryptographic toolkit for MS-DOS

  • Conference paper
  • 63 Accesses

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 271))

Abstract

In MS-DOS environments RSA encryption is very unusual. This is mainly due to throughput limitations of RSA-software. Still RSA is one of the most secure encryption methods and it is necessary to provide cryptographic methods that can be viewed as safe also for PC and MS-DOS environment. Increasing applications in the area of remote banking and in many other areas demand more and more for safe public key encryption. This paper presents a software package and its implementational aspects. The implementation bases on the assumption that no party can use the prime factors of the key. Algortihms for highly parallel execution are adopted and their efficiency on single instruction single data machines is discussed and found out to be adequate. This package is designed to be a compact module without large precomputed arrays. It exhibits about 850 bit/sec on a 33MHz 386 PC and over 400 bit/sec cyphering rate on a Toshiba 5200 Laptop with a 512 bit key.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rivest R., Shamir A., Adlemann L.: A Method for obtaining digital signatures and public-key cryptosystems; COM. ACM (1978)120–126.

    Google Scholar 

  2. Wallace C.S.: A suggestion for a fast multiplier; IEEE Trans. Electronic Computer EC-13 (1964) 14–17.

    Article  Google Scholar 

  3. Lippitsch P., Posch K., Posch R.: Multiplication as parallel as possible; Report 290, Institutes for Information Processing Graz (1990).

    Google Scholar 

  4. Posch. K., Posch R.: Approching encryption at ISDN speed using partial parallel modulus multiplication; Microprocessing and Microprogramming 29 (1990) 177–184.

    Article  Google Scholar 

  5. Dusse S. R., Kaliski B. S.: A cryptographic library for the Motorola DSP 56000; Proc. Eurocrypt, to appear in Springer Lecture Notes (1990).

    Google Scholar 

  6. Montgomery P. L.: Modular multiplication without trial division; Mathematics of Computation, 44 (1985) 166–170.

    Article  Google Scholar 

  7. Avizienis A.: Signed-digit number representation for fast parallel arithmetic; IRE Trans. Electron. Comput., Vol.EC-10, (1961) 389–400.

    Article  MathSciNet  Google Scholar 

  8. Flynn M.J.: Some computer organisations and their effectiveness; Trans. IEEE, c-21 (1972) 958–960.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lippitsch, P., Posch, R. (1987). PC-RSA A cryptographic toolkit for MS-DOS. In: Pfitzmann, A., Raubold, E. (eds) VIS ’91 Verläßliche Informationssysteme. Informatik-Fachberichte, vol 271. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76562-9_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-76562-9_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53911-7

  • Online ISBN: 978-3-642-76562-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics