skip to main content
10.1145/2659651.2659658acmotherconferencesArticle/Chapter ViewAbstractPublication PagessinConference Proceedingsconference-collections
research-article

Mathematical model of the polyalphabetic information security system based on the normal generalized knapsack

Published:09 September 2014Publication History

ABSTRACT

This publication is an expanded text of some works and implementations of new ideas of the author, so it does not purport to light-theoretic studies of non-standard knapsack problem. More information can be found in works the author. This paper considers class of polyalphabetic cryptosystems with the open key based on a non-standard knapsack with new generalized Merkle-Hellman scheme. We propose the algorithm of packing the normal generalized knapsack with predetermined threshold value p and cryptosystem with the open key based on p-ary Warshamov's code with generalized knapsack's function. Unlike standard knapsacks, components of the normal generalized knapsack can may be various as be-tween themselves and repeat given set number of times.

References

  1. Shannon C. Communication theory of secrecy systems, Bell System Techn. J. 28, No 4--1949. P. 656--715.Google ScholarGoogle Scholar
  2. Ginzburg B.D.// Problems of cybernetics 1967, v.19, p. 249--252.Google ScholarGoogle Scholar
  3. Diffie W., Hellman M. New directions in cryptography // IEEE Transactions on Information Theory. -- 1976. -- Vol. 22. -- P. 644--654. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Merkle R., Hellman M. Hiding information and signatures in trapdoor knapsacks // IEEE Transactions on Information Theory. 1978. Vol. IT -- 24. P. 525--530. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Merkle R., Hellman M. On the security of multiple encryption // Communications of the ACM. -- 1981. -- Vol. 24. P. 465--467. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Lenstra A.K., Lenstra H.W., Lovasz L. Factoring polynomials with rational coefficients // Mathematische Annalen. 1982. Vol. 261. P. 515--534.Google ScholarGoogle Scholar
  7. Shamir A. A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem // Information Theory, IEEE Transactions. -- 1984. -- Vol. 30, No 5. -- P. 699--704. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Odlyzhko A.O. Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature sceme // IEEE Transactions on Information Theory. -- Jul 1984. -- vol. IT-30, No4. -- p. 594--601. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Chor B., Rivest R. A knapsack-type public key cryptoystem based on arithmetic in finite fields//IEEE Transactions on Information Theory. 1988. Vol. IT -- 34. P. 901--909. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Salomaa A. Public-Key Cryptography Springer-Verlag Berlin Heidelberg New York London Paris Tokyo Hong Kong Barcelona.Google ScholarGoogle Scholar
  11. Koblitz N. A Course in Number Theory and Cryptography. Springer-Verlag New York. 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Schneir B. Applied Cryptography: Protocols, Algorithms and Source Code in C, 2nd edition. New York: J. Wiley & Sons, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Martello S. T.P. Knapsack problems: algorithms and computer implementations // Chichester: JOHN WILEY & SONS. --1990.-- P. 137--138. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Vaudenay S. Cryptanalysis of the Chor-Rivest cryptosystem // CRYPTO. -- 1998. -- P. 243--256. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Osipyan V.O. On One Generalization of Knapsack Cryptosystems // Izv. vuzov. Northern-Caucasus area. Tech. science. -- 2003. -- Appendix No 5. -- p. 18--25.Google ScholarGoogle Scholar
  16. Osipyan V.O. Information protection systems based on functional knapsack problem // Voprosi zachiti informatsi. -- M., 2004.-- No 4. -- c.16--19.Google ScholarGoogle Scholar
  17. Osipyan V.O. On Information Protection System Based on the Knapsack Problem // Izv. vuzov. Tomsk Polytechnical University. -- 2006. -- v. 309. -- No2. -- p. 209--212.Google ScholarGoogle Scholar
  18. Osipyan V.O. Generalization of open key knapsack cryptosystems // Security of Information and Networks (SIN 2007). Trafford, 2008. P. 58--63.Google ScholarGoogle Scholar
  19. Osipyan V.O. Different models of information protection system, based on the functional knapsack // SIN'11 Proceedings of the 4th international conference on Security of information and networks, ACM, 2011. pp 215--218. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Osipyan V.O. Building of data protection knapsacks cryptosystems with Diophantine problems. LAP LAMBERT Academic Publishing, 2012.Google ScholarGoogle Scholar
  21. Osipyan V.O. Buiding of alphabetic data protection cryptosystems on the base of equal power knapsacks with Diophantine problems // SIN'12 Proceedings of the Fifth International Conference on Security of Information and Networks, ACM, 2012, pp.124--129. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Osipyan V.O. Information protection systems based on universal knapsack problem // SIN'13 Proceedings of the 6th International Conference on Security of Information and Networks, ACM, 2013, pp.343--346. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Osipyan V.O., Karpenko Y.A., Zhuck A.S., Arutyunyan A.H. Diophantine difficulties of attacks on non-standard knapsacks information security systems // Izvestiya YFU, No12(149), 2013, pp. 209--215.Google ScholarGoogle Scholar

Index Terms

  1. Mathematical model of the polyalphabetic information security system based on the normal generalized knapsack

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Other conferences
          SIN '14: Proceedings of the 7th International Conference on Security of Information and Networks
          September 2014
          518 pages
          ISBN:9781450330336
          DOI:10.1145/2659651

          Copyright © 2014 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 9 September 2014

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed limited

          Acceptance Rates

          SIN '14 Paper Acceptance Rate32of109submissions,29%Overall Acceptance Rate102of289submissions,35%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader