• Home
  • Search
  • Advance in Applied Cryptography Theory: Survey and New Results. Part 1. Key Cryptography
  • Open Access IconOpen Access
  • https://doi.org/10.31854/1813-324x-2024-10-4-126-141Copy DOI Icon

Advance in Applied Cryptography Theory: Survey and New Results. Part 1. Key Cryptography

Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

In the current paper, consisting from two parts, are presented both results already published before (but hard for access) and new once. Actuality of this work is firstly in a fact that recently has been obtained a number of new results in area of applied cryptography that are needed both in a clarification and be put into practice. This is namely the main goal of the current paper. The setting problem in the first paper part concerns to a complexity of symmetric cipher breaking while in the second part of the paper is discussed, so called, keyless cryptography, namely: wiretap channel concept, execution of communication channels which allow to provide information security without of key exchange procedure between legal correspondences. In the part widely used methods of applied mathematics, namely: algebra, number, probability and information theories. Computer simulation also used there. A novelty of the first part of work consists in the following: first of all it is clarified the sense of a key lifetime limitation for different symmetric cipher modes, secondly, it is explained an approach of cipher breaking by the use of quantum computers, finely, the key authentication for the Diffie ‒ Hellman protocol based on the mobile device pairing technology is investigated in detail. In the second part of the current paper has been presented a vulnerability of Dean ‒ Goldsmith cryptosystem under some extension of attacks. The main results of this paper are: estimation of the key lifetime of single key for symmetric cipher in CBC mode, clarifying of Grover’s algorithm breaking of symmetric ciphers by brute force attack, development of a method for authentication of Diffie ‒ Hellman values based on pre-distributed sequences, selection of ciphers which allow to execute with Shamir’s protocol without any key sharing in advance, breaking of Dean ‒ Goldsmith protocol under some conclusions, proof the fact regarding of a possible breakability of the key sharing protocol over noiseless communication channels. Practical application of paper results consists in the fact of stimulation the correct choice of ciphers and their parameters in order to provide their resistance to different attacks and more attention to algorithms of keyless cryptography.

Similar Papers
  • Research Article
  • Citations277

On the Calculation of Mutual Information

  • Jul 01, 1970
  • SIAM Journal on Applied Mathematics
  • Tyrone E Duncan
  • Conference Article
  • Citations4

Lightweight cipher resistivity against brute-force attack: Analysis of PRESENT

  • Apr 01, 2012
  • Jan Pospisil +1
  • Research Article
  • Citations1

A NEW METHOD FOR CONSTRUCTING DIGITAL SIGNATURE SCHEME BASED ON NEW HARD PROBLEM

  • Dec 23, 2022
  • Journal of Science and Technique
  • The Truyen Bui
  • Conference Article
  • Citations27

Secure and robust symmetric key generation using physical layer techniques under various wireless environments

  • Jan 01, 2016
  • Cem Sahin +2
  • Research Article

Кодування як засіб захисту інформації у системах контролю доступу з використанням логіко-часових функцій у формі поліномів і біометричних даних суб’єктів

  • Jun 19, 2018
  • Реєстрація, зберігання і обробка даних
  • N V Sachaniuk-Kavets’Ka
  • Conference Article

DES Security Reinforcement Using Chaotic Logistic Map and Elliptic Curve Cryptography

  • Dec 01, 2015
  • Mohamed A Seif Eldeen +2
  • Conference Article
  • Citations3

SAT vs. Substitution Boxes of DES like Ciphers

  • Oct 01, 2021
  • Sylwia Stachowiak +2
  • Book Chapter
  • Citations5

A Modified RSA Cryptography Algorithm for Security Enhancement in Vehicular Ad Hoc Networks

  • Jan 01, 2018
  • Debasish Roy +1
  • Research Article
  • Citations2

Orthogonal obfuscation based key management for multiple IP protection

  • Nov 28, 2020
  • Integration
  • Yuejun Zhang +4
  • Research Article
  • Citations2

Scalable MD5 Crypt Cracker on PetaScale Supercomputer

  • Jun 01, 2012
  • Advanced Materials Research
  • Zhi Cai Shi +2
  • Research Article

Dual-Source SPIR Over a Noiseless MAC Without Data Replication or Shared Randomness

  • Dec 08, 2025
  • IEEE Transactions on Information Theory
  • Rémi A Chou
  • Conference Article
  • Citations4

An Evaluation on Securing Cloud Systems based on Cryptographic Key Algorithms

  • Jul 27, 2018
  • Sam Njuki +3
  • Research Article

УДОСКОНАЛЕННЯ СИСТЕМИ ЗАХИСТУ БАЗ ДАНИХ ВІД НЕСАНКЦІОНОВАНОЇ МОДИФІКАЦІЇ НА ОСНОВІ ТЕХНОЛОГІЙ БЛОКЧЕЙН ТА АЛГОРИТМУ КОНСЕНСУСУ PROOF-OF-WORK

  • Feb 29, 2024
  • Herald of Khmelnytskyi National University. Technical sciences
  • Ольга Салієва +3
  • Research Article
  • Citations15

Neural coding and decoding: communication channels and quantization

  • Apr 01, 2001
  • Network: Computation in Neural Systems
  • A.G Dimitrov +1
  • Book Chapter

Advancing cryptographic security: A thorough evaluation of enhanced hill cipher algorithm compared to transposition cipher

  • Mar 05, 2026
  • K Phanindra +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.