Skip to main content

Class of Provably Secure Information Authentication Systems

  • Conference paper
Computer Network Security (MMM-ACNS 2007)

Abstract

Electronic messages authentication issue is of significant importance for computer systems. A number of public key cryptosystems based on the composite modulus (n=pq, where p and q are large primes) has been proposed to provide information authentication and only for one of them (that has been proposed by M. Rabin) security has been proved formally. In this paper we generalize the M. Rabin’s public key encryption and digital signature schemes and present formal proof of the security of the class of public key cryptosystems based on difficulty of the factorization problem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rivest, R.L., Shamir, A., Adleman, L.M.: A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the ACM 21(2), 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  2. Menezes, A.J., Vanstone, S.A.: Handbook of Applied Cryptography, p. 780. CRC Press (1996)

    Google Scholar 

  3. Pieprzyk, J., HardjonoTh., S.J.: Fundumentals of Computer Security, p. 677. Springer, Berlin (2003)

    Google Scholar 

  4. Rabin, M.O.: Digitalized signatures and public key functions as intractable as factorization. —Technical report MIT/LCS/TR-212, MIT Laboratory for Computer Science (1979)

    Google Scholar 

  5. Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)

    Google Scholar 

  6. Gordon, J.: Strong primes are easy to find. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) Advances in Cryptology. LNCS, vol. 209, pp. 216–223. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moldovyan, N., Moldovyan, A. (2007). Class of Provably Secure Information Authentication Systems. In: Gorodetsky, V., Kotenko, I., Skormin, V.A. (eds) Computer Network Security. MMM-ACNS 2007. Communications in Computer and Information Science, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73986-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73986-9_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73985-2

  • Online ISBN: 978-3-540-73986-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics