Skip to main content
SpringerLink
Log in

On the comparison of methods for asymmetric execution of cryptographic primitives and protocols in the context of using small parameters and short keys

  • Invited Paper
  • Published:
Journal of Computer Virology and Hacking Techniques Aims and scope Submit manuscript

Abstract

The paper systematically considers methods of changing the execution of known standard cryptographic primitives, symmetric and asymmetric, as well as cryptographic protocols using short (low-entropy) keys and small parameters that allow increasing their strength. The proposed changes are related to the introduction of asymmetry in the complexity of the work of legitimate users, which should lead to an increase in the complexity of decryption algorithms for an adversary or cryptanalyst. Security is considered in relation to the use of standard and universal attack methods by the adversary, such as the method of full testing of keys due to the small size of these keys, as well as methods for solving problems of discrete logarithm or factorization of large integers, the size of which is limited by the small size of the cryptosystem parameters. Security is considered in relation to the use of standard and universal attack methods by the adversary, such as the method of full testing of keys due to the small size of these keys, as well as methods for solving problems of discrete logarithm or factorization of large integers, the size of which is limited by the small size of the cryptosystem parameters. This work is of an overview nature, which allows you to look at what is common in the proposed methods for different situations of using cryptography with short keys and small parameters.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Varfolomeev, A.A.: Nekotorye rekomendacii po povysheniyu stojkosti shifra s malym razmerom klyucha k metodu polnogo oprobovaniya. Voprosy kiberbezopasnosti 5(13), 60–62

    Google Scholar 

  2. Rivest, R.: All-or-nothing encryption and the package transformation. In: Fast Software Encryption, LNCS, vol. 267, pp. 210–218 (1997)

  3. Elgamal, T.: A public key cryptosystem and signature scheme based on discrete logarithms. IEEE Trans Inform Theory 31(4), 469–472 (1985)

    Article  MathSciNet  Google Scholar 

  4. Varfolomeev, A.A., Makarov, A.: About asymmetric execution of asymmetric ElGamal cipher. In: 2020 IEEE Conference of Russian Young Researchers in Electrical and electronic Engineering (EIConRus) (2020)

  5. Bellovin, S.M., Merritt, M.: Encrypted key exchange: password-based protocols secure against dictionary attacks. In: Proceedings of the I.E.E.E. Symposium on Research in Security and Privacy. Oakland. p. 72 (May 1992). https://doi.org/10.1109/RISP.1992.213269. ISBN 978-0-8186-2825-2

  6. Smyshlyaev, S., Oshkin, I., Alekseev, E., Ahmetzyanova, L.: On the security of one password authenticated key exchange protocol. Cryptology ePrint Archive (Report 2015/1237) (2015).

  7. Mercle, R.C.: Secure communications over insecure channels. Commun. ACM 21(4), 294–299c (1978)

    Article  Google Scholar 

  8. Matyuhin, D.V.: Ob asimptoticheskoj slozhnosti diskretnogo logarifmirovaniya v pole GF(p). Diskret. Matem. 15(1), 28–34 (2003)

    Article  Google Scholar 

  9. Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22, 644–654 (1976)

    Article  MathSciNet  Google Scholar 

  10. Varfolomeev, A.A.: Ob asimmetrichno vypolnimyh simmetrichnyh kriptosistemah (shifrah). RusCripto 2018

  11. Varfolomeev, A.A.: O podhodah k obespecheniyu dostatochnogo urovnya stojkosti v chasti konfidencial'nosti pri maloentropijnyh predvaritel'no raspredelennyh sekretah. RusCripto 2019

  12. Varfolomeev, A.A.: Strengthening the password authenticated key exchange protocols due to the use of asymmetric execution of cryptosystems. Selected Papers of the X Anniversary International Scientific and Technical Conference on Secure Information Technologies (BIT 2019), Moscow, Russia, December 3–4, 2019. Edited by: Mikhail Basarab, Alexey Markov. CEUR-WS: 2-Jun-2020

  13. Jareck, S., Krawczyk, H., Xu, J.: OPAQUE: An asymmetric PAKE protocol secure against pre-computation attacks. Advances in Cryptology. Lecture Notes in Computer Science. 10822. pp. 456–486 (2018)

Download references

Author information

Authors and Affiliations

  1. Bauman Moscow State Technical University, 5/1 2nd Baymanskay Ul., Moscow, Russia, 105005

    Alexander A. Varfolomeev

  2. RUDN University, 6 Miklukho-Maklaya ul., Moscow, Russia

    Alexander A. Varfolomeev

Authors
  1. Alexander A. Varfolomeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander A. Varfolomeev.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Varfolomeev, A.A. On the comparison of methods for asymmetric execution of cryptographic primitives and protocols in the context of using small parameters and short keys. J Comput Virol Hack Tech 18, 43–47 (2022). https://doi.org/10.1007/s11416-021-00407-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11416-021-00407-w

Keywords

Search

Navigation