Skip to main content
SpringerLink
Log in

Algorithmic Foundation for Benchmarking of Computational Platforms Running Asymmetric Cipher Systems

  • Conference paper
  • First Online:
Biologically Inspired Cognitive Architectures (BICA) for Young Scientists (BICA 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 636))

Abstract

The 0–1 Knapsack Problem is a well known NP-complete problem. It is used as the core primitive in several asymmetric cipher systems. Designing such systems requires a reliable method of computational platform benchmarking. But the existing general-purpose benchmarks are not accurate enough, as they are mostly based on floating-point arithmetics, while the Knapsack Problem relies on large amount of calculations with very long integers. Therefore, a new specialized benchmark is required to get accurate performance estimates. In this paper we study some features of exact parallel algorithms for the Knapsack Problem, as well as load balancing techniques for them. We then choose several algorithms based on their scalability and applicability to the asymmetric cipher system analysis and suggest a new algorithmic foundation for computational platform benchmarking comprised of these algorithms.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. HPL — a portable implementation of the High-Performance Linpack Benchmark for distributed-memory computers (2016). http://www.netlib.org/benchmark/hpl/

  2. HPCG benchmark (2016). http://hpcg-benchmark.org/

  3. Brief introduction | Graph 500 (2016). http://www.graph500.org/

  4. Kupriyashin, M.A., Borzunov, G.I.: Visualization and analysis of the exact algorithm for Knapsack Problem based on exhaustive search. Sci. Vis. 7(4), 87–100 (2015). http://sv-journal.org/2015-4/08.php?lang=ru

    Google Scholar 

  5. Kupriyashin, M.A., Borzunov, G.I.: Reducing the computational complexity of solving the Knapsack Problem. IT Security 1, 66–67 (2014). https://elibrary.ru/item.asp?id=23234662, (in Russian)

    Google Scholar 

  6. Kupriyashin, M.A., Borzunov, G.I.: Computational load balancing algorithm for parallel Knapsack packing tree traversal. Procedia Comput. Sci. 88, 330–335 (2016). http://www.sciencedirect.com/science/article/pii/S1877050916317008

    Article  Google Scholar 

  7. Horowitz, E., Sahni, S.: Computing partitions with applications to the Knapsack Problem. J. ACM (JACM) 21(2), 277–292 (1974). http://dl.acm.org/citation.cfm?id=321823

    Article  MathSciNet  Google Scholar 

  8. Kupriyashin, M.A., Borzunov, G.I.: Finding the exact solutions of the Knapsack Problem using dynamic programming. PNRPU Bull. Electrotechnics Inf. Technol. Control Syst. 17, 121–130 (2016)

    Google Scholar 

Download references

Acknowledgements

This work was supported by the MEPhI Academic Excellence Project (agreement with the Ministry of Education and Science of the Russian Federation of August 27, 2013, project no. 02.a03.21.0005).

Author information

Authors and Affiliations

  1. National Research Nuclear University “MEPhI” (Moscow Engineering Physics Institute), Kashirskoe Shosse, 31, 115409, Moscow, Russia

    Mikhail A. Kupriyashin & Georgii I. Borzunov

  2. Russian State University of A. N. Kosygin (Technology. Design. Art), Sadovnicheskaya Street, 3, Building 1, 117997, Moscow, Russia

    Georgii I. Borzunov

Authors
  1. Mikhail A. Kupriyashin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georgii I. Borzunov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mikhail A. Kupriyashin .

Editor information

Editors and Affiliations

  1. Krasnow Institute, George Mason University, Fairfax, VA, USA

    Alexei V. Samsonovich

  2. National Research Nuclear University MEPhI, Moscow, Russia

    Valentin V. Klimov

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Kupriyashin, M.A., Borzunov, G.I. (2018). Algorithmic Foundation for Benchmarking of Computational Platforms Running Asymmetric Cipher Systems. In: Samsonovich, A., Klimov, V. (eds) Biologically Inspired Cognitive Architectures (BICA) for Young Scientists. BICA 2017. Advances in Intelligent Systems and Computing, vol 636. Springer, Cham. https://doi.org/10.1007/978-3-319-63940-6_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63940-6_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-63939-0

  • Online ISBN: 978-3-319-63940-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation