Log in

Relevant bibliographies by topics / Symmetric cryptosystems / Journal articles

To see the other types of publications on this topic, follow the link: Symmetric cryptosystems.

Journal articles on the topic 'Symmetric cryptosystems'

Author: Grafiati

Published: 28 May 2022

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Symmetric cryptosystems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Alekseychuk, Anton, and Olha Shevchuk. "A necessary condition for CPA-security of randomized symmetric code cryptosystems." Physico-mathematical modelling and informational technologies, no. 33 (September 3, 2021): 78–82. http://dx.doi.org/10.15407/fmmit2021.33.078.

Full text

Abstract:

We investigate a class of symmetric code cryptosystems constructed similarly to the well-known randomized (asymmetric) McEliece cryptosystem. A necessary condition for CPA- security of such cryptosystems is obtained (that is, their security against arbitrary distinguishing chosen-plaintext attacks). To each randomized code cryptosystem of specified type correspond its shortening, which is its reduced version. It is proved that the CPA-security of the input cryptosystem imply the CPA-security of its shortening. To a certain extent, this makes it possible to reduce the question about the CPA-sec

APA, Harvard, Vancouver, ISO, and other styles

2

Kyaw, Myo Thu, Swar Hlaing Kyaw, and Aung Aung Nay. "Time Performance Analysis of RSA and Elgamal Public Key Cryptosystems." International Journal of Trend in Scientific Research and Development 3, no. 6 (2019): 448–50. https://doi.org/10.5281/zenodo.3588011.

Full text

Abstract:

Computer and network security system are needed to protect data during their transmissions and to guarantee that data are authentic. Cryptography is useful not only for proving data to be secure but also for ensuring that data have not altered. So, it is needed to implement the public key cryptosystem in computer and network security system. In cryptography, symmetric key cryptosystems are faster than public key asymmetric cryptosystems. But public key cryptosystems are more secure than symmetric key cryptosystems and widely used in computer and network security system. This describes the comp

APA, Harvard, Vancouver, ISO, and other styles

3

Huang, Huawei. "Cryptosystems Based on Tropical Congruent Transformation of Symmetric Matrices." Symmetry 14, no. 11 (2022): 2378. http://dx.doi.org/10.3390/sym14112378.

Full text

Abstract:

Recently, public-key cryptography based on tropical semi-rings have been proposed. However, the majority of them are damaged. The main reason is that they use a public matrix to construct commutative matrix semi-rings. New public-key cryptosystems are proposed in this paper. They are based on tropical congruent transformation of symmetric matrix by circular matrix. The NP-hard problem of solving a tropical system of nonlinear equations underlies the cryptosystem’s security. Since a known matrix cannot express the used commutative subsemi-rings of circular matrices and there is no tropical matr

APA, Harvard, Vancouver, ISO, and other styles

4

Chen, Ling Jiao, and Ao Dong Shen. "A Novel Public Key Image Cryptosystem Based on Elliptic Curve and Arnold Cat Map." Advanced Materials Research 989-994 (July 2014): 4183–86. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.4183.

Full text

Abstract:

For decades, symmetric cryptosystems, such as chaos-based ones, are designed for image encryption. In this paper, a novel public key scheme for image encryption is presented. Based on the improved elliptic curve cryptosystem and Arnold cat map, the novel scheme can offer high security while avoid exchange and distribution of secret keys. The experiments illustrate that the presented scheme is computationally less complex than the traditional asymmetric cryptosystems and suitable for large image encryption.

APA, Harvard, Vancouver, ISO, and other styles

5

Zibideh, Walid Y., and Mustafa M. Matalgah. "Computational Complexity Analysis for a Class of Symmetric Cryptosystems Using Simple Arithmetic Operations and Memory Access Time." International Journal of Information Security and Privacy 7, no. 1 (2013): 63–75. http://dx.doi.org/10.4018/jisp.2013010105.

Full text

Abstract:

A secure cryptosystem could be very complicated, time consuming and hard to implement. Therefore, the complexity of the cryptosystem should be taken into account during design and implementation. In this work, the authors introduce a comprehensive and platform independent complexity analysis for a class of symmetric block cryptosystems, by which it will be easier to evaluate the performance of some used cryptosystems. Previous works lacked the comprehensiveness in their analysis, due to the fact that the memory access time was completely ignored, which greatly degrades the accuracy of the anal

APA, Harvard, Vancouver, ISO, and other styles

6

Євсєєв, Сергій, Роман Корольов, Андрій Ткачов, and Анастасія Німченко. "DEVELOPMENT OF PROCEDURES FOR MODIFYING THE CIPHER GOST 28147." Advanced Information Systems 5, no. 2 (2021): 131–35. http://dx.doi.org/10.20998/2522-9052.2021.2.19.

Full text

Abstract:

The entry of mankind into the era of high technologies, the rapid growth of computer technology contributes to the expansion of the range of electronic services. To ensure the security of confidential information, personal data, cryptographic systems of traditional cryptography (symmetric cryptosystems) and public key cryptography (asymmetric cryptosystems) are used. As a rule, the former provides security services, the latter provide key distribution. However, in the conditions of totalitarian surveillance in society by the special services of developed countries, cryptographic tabs are embed

APA, Harvard, Vancouver, ISO, and other styles

7

TODO, Yosuke. "Evolution of Symmetric-Key Cryptosystems." IEICE ESS Fundamentals Review 10, no. 1 (2016): 23–33. http://dx.doi.org/10.1587/essfr.10.1_23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Vrahatis, M. N., G. A. Tsirogiannis, and E. C. Laskari. "Novel orbit based symmetric cryptosystems." Mathematical and Computer Modelling 51, no. 3-4 (2010): 239–46. http://dx.doi.org/10.1016/j.mcm.2009.08.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lu, Cheng-Fen, and Shiuh-Pyng Shieh. "Re-keying algorithms for symmetric cryptosystems." Journal of Discrete Mathematical Sciences and Cryptography 7, no. 1 (2004): 23–27. http://dx.doi.org/10.1080/09720529.2004.10697985.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Terrazas Gonzalez, Jesus D., and Witold Kinsner. "A Modular Dynamical Cryptosystem Based on Continuous-Interval Cellular Automata." International Journal of Cognitive Informatics and Natural Intelligence 5, no. 4 (2011): 83–109. http://dx.doi.org/10.4018/jcini.2011100106.

Full text

Abstract:

This paper presents a new cryptosystem based on chaotic continuous-interval cellular automata (CCA) to increase data protection as demonstrated by their flexibility to encrypt and decrypt information from distinct sources. Enhancements to cryptosystems are also presented including (i) a model based on a new chaotic CCA attractor, (ii) the dynamical integration of modules containing dynamical systems to generate complex sequences, and (iii) an enhancement for symmetric cryptosystems by allowing them to generate an unlimited number of keys. This paper also presents a process of mixing chaotic se

APA, Harvard, Vancouver, ISO, and other styles

11

Корольов, Р. В., А. М. Ткачов, Н. І. Воропай, М. Мамедов, and Е. Багіров. "Development of an improved method for forming pseudorandom numbers based on redunte M-ary codes." Системи обробки інформації, no. 1 (168) (February 10, 2022): 29–35. http://dx.doi.org/10.30748/soi.2022.168.03.

Full text

Abstract:

The development of information technologies in cyberspace is associated with the development of security services in the components of security: cybersecurity, information security and information security. To provide security services, as a rule, cryptographic algorithms and functions based on symmetric and asymmetric cryptography systems are used. An integral part of such cryptosystems are pseudo-random number generators that allow you to generate a random sequence over a period. One of the evaluation criteria is the duration of the period and its guarantee, i.e. ensuring the randomness prod

APA, Harvard, Vancouver, ISO, and other styles

12

Fúster-Sabater, Amparo, and M. E. Pazo-Robles. "Security Analysis of the Symmetric Cryptosystem TinyJambu." Symmetry 16, no. 4 (2024): 440. http://dx.doi.org/10.3390/sym16040440.

Full text

Abstract:

Symmetric cryptography provides the best examples of cryptosystems to be applied in lightweight environments (e.g., IoT). A representative example is the cryptosystem TinyJambu, one of the ten finalists in the NIST Lightweight Cryptography Standardization Project. It is an authentication encryption with associated data scheme that is extremely lightweight and fast. In this work, we analyze the security of TinyJambu from two distinct and non-symmetric points of view: (1) the improvement of the best cryptanalytical attack found in the literature and (2) a randomness analysis of the generated seq

APA, Harvard, Vancouver, ISO, and other styles

13

Madhira, Srinivas, and Porika Sammulal. "Survey on Symmetric and Asymmetric Key Cryptosystems." IOSR Journal of Computer Engineering 16, no. 4 (2014): 11–18. http://dx.doi.org/10.9790/0661-16431118.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Agrawal, Himani. "Implementation and analysis of various symmetric cryptosystems." Indian Journal of Science and Technology 3, no. 12 (2010): 1173–76. http://dx.doi.org/10.17485/ijst/2010/v3i12.25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Hosoyamada, Akinori. "On post-quantum security of symmetric cryptosystems." IEICE ESS Fundamentals Review 17, no. 1 (2023): 59–71. http://dx.doi.org/10.1587/essfr.17.1_59.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Mohit, Prerna, and G. P. Biswas. "Modification of Traditional RSA into Symmetric-RSA Cryptosystems." International Journal of Business Data Communications and Networking 13, no. 1 (2017): 66–73. http://dx.doi.org/10.4018/ijbdcn.2017010106.

Full text

Abstract:

This paper addresses the modification of RSA cryptography namely Symmetric-RSA, which seem to be equally useful for different cryptographic applications such as encryption, digital signature, etc. In order to design Symmetric-RSA, two prime numbers are negotiated using Diffie-Hellman key exchange protocol followed by RSA algorithm. As the new scheme uses Diffie-Hellman and RSA algorithm, the security of the overall system depends on discrete logarithm as well as factorization problem and thus, its security is more than public-key RSA. Finally, some new cryptographic applications of the propose

APA, Harvard, Vancouver, ISO, and other styles

17

Dorninger, Dietmar, Helmut Länger, and Maciej Mączyński. "ON RING-LIKE STRUCTURES RELATED TO SYMMETRIC CRYPTOSYSTEMS." Demonstratio Mathematica 38, no. 2 (2005): 265–76. http://dx.doi.org/10.1515/dema-2005-0202.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Agarwal, Sohit, and Gagan Joshi. "Hybrid Encryption of Cloud Processing With IOT Devices Using DNA And RSA Cryptography." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 6 (2023): 21–27. http://dx.doi.org/10.17762/ijritcc.v11i6.6767.

Full text

Abstract:

The research paper titled "Hybrid Data Encryption as well as Decryption Using Hybrid RSA and DNA" develops a hybrid cryptosystem by combining the usefulness of such an asymmetric-key (public-key) cryptosystem with the efficacy of a symmetric-key (private-key) cryptosystem. These two types of cryptosystems use different types of keys. The method addresses concerns regarding the users' right to privacy, authentication, and accuracy by utilizing a data encryption process that is secure in both directions. Both the process of encrypting data and the process of decrypting data, which are both utili

APA, Harvard, Vancouver, ISO, and other styles

19

Jenifa Sabeena, S., and S. Antelin Vijila. "Moulded RSA and DES (MRDES) Algorithm for Data Security." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 2 (2023): 154–62. http://dx.doi.org/10.17762/ijritcc.v11i2.6140.

Full text

Abstract:

In the recent days transmission of large amount of data through online is very prominent. Security is necessary while transmitting large amount of data. Since the data may belost or hacked at some point of transmission. Normally there are three important factors interms of security. They are key generation, encryption and decryption. There are two types of crypto system namely symmetric cryptosystem and asymmetric cryptosystem. There are many publicly available cryptosystems. It may lead the intruders to view the original message sent by the sender using all the possible keys. In order to prov

APA, Harvard, Vancouver, ISO, and other styles

20

Sabeena, S. Jenifa, and S. Antelin Vijila. "Moulded RSA and DES (MRDES) Algorithm for Data Security." International Journal on Recent and Innovation Trends in Computing and Communication 10, no. 12 (2022): 12–20. http://dx.doi.org/10.17762/ijritcc.v10i12.5836.

Full text

Abstract:

In the recent days transmission of large amount of data through online is very prominent. Security is necessary while transmitting large amount of data. Since the data may belost or hacked at some point of transmission. Normally there are three important factors interms of security. They are key generation, encryption and decryption. There are two types of crypto system namely symmetric cryptosystem and asymmetric cryptosystem. There are many publicly available cryptosystems. It may lead the intruders to view the original message sent by the sender using all the possible keys. In order to prov

APA, Harvard, Vancouver, ISO, and other styles

21

Ali Shoukat, Ijaz, Kamalrulnizam Abu Bakar, and Subariah Ibrahim. "A Novel Dynamic Data Blocking Mechanism for Symmetric Cryptosystems." Research Journal of Applied Sciences, Engineering and Technology 7, no. 21 (2014): 4476–89. http://dx.doi.org/10.19026/rjaset.7.824.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Arora, Mani, Sandeep Sharma, and Derick Engles. "Parametric comparison of EMDS algorithm with some symmetric cryptosystems." Egyptian Informatics Journal 18, no. 2 (2017): 141–49. http://dx.doi.org/10.1016/j.eij.2016.11.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

I.M., Karimova. "METHODS FOR GENERATING KEYS FOR SYMMETRIC ENCRYPTION ALGORITHMS AND THEIR ANALYSIS." Results of National Scientific Research International Journal 4, no. 5 (2025): 180–90. https://doi.org/10.5281/zenodo.15581900.

Full text

Abstract:

<em>This article presents a classification and analysis of algorithms for generating random and pseudo-random numbers used in key generation for symmetric encryption systems. A comparative study has led to the development of an improved key generation method, addressing the limitations of existing algorithms. The analysis focuses on the cryptographic strength of pseudo-random number generators (PRNGs) and their application in symmetric and asymmetric cryptosystems, emphasizing the importance of randomness testing.</em>

APA, Harvard, Vancouver, ISO, and other styles

24

Ejaz, Aisha, Ijaz Ali Shoukat, Umer Iqbal, Abdul Rauf, and Afshan Kanwal. "A secure key dependent dynamic substitution method for symmetric cryptosystems." PeerJ Computer Science 7 (July 19, 2021): e587. http://dx.doi.org/10.7717/peerj-cs.587.

Full text

Abstract:

The biggest challenge for symmetric cryptosystems is to replace their static substitution with dynamic substitution, because static substitution S-boxes make the symmetric block ciphers more vulnerable to attacks. Previous well-known dynamic key-dependent S-boxes are lacking in dynamicity and do not provide optimal security for symmetric block ciphers. Therefore, this research aims to contribute an effective and secure method for designing key-dependent dynamic S-box with dynamic permutations to make the symmetric block ciphers optimally secure. The proposed S-box method has been experimentall

APA, Harvard, Vancouver, ISO, and other styles

25

Tom, Dr Joshua J., Dr Nlerum P. Anebo, Dr Bukola A. Onyekwelu, Adigwe Wilfred, and Richard E. Eyo. "Quantum Computers and Algorithms: A Threat to Classical Cryptographic Systems." International Journal of Engineering and Advanced Technology 12, no. 5 (2023): 25–38. http://dx.doi.org/10.35940/ijeat.e4153.0612523.

Full text

Abstract:

Contemporary cryptographic algorithms are resistant to the strongest threats to cybersecurity and high-profile cyber-attacks. In recent times, information security scientists and researchers had developed various cryptographic schemes that defeated attacks using the most sophisticated (in terms of processor speed) classical computer. However, this resistance will soon erode with the arrival of quantum computers. In this paper, we profiled quantum computers and quantum algorithms based on their widely believed threat against currently secure cryptographic primitives. We found that Grover’s and

APA, Harvard, Vancouver, ISO, and other styles

26

Dr., Joshua J. Tom, Nlerum P. Anebo Dr., Bukola A. Onyekwelu Dr., Wilfred Adigwe, and E. Eyo Richard. "Quantum Computers and Algorithms: A Threat to Classical Cryptographic Systems." International Journal of Engineering and Advanced Technology (IJEAT) 12, no. 5 (2023): 25–38. https://doi.org/10.5281/zenodo.8073526.

Full text

Abstract:

<strong>Abstract: </strong>Contemporary cryptographic algorithms are resistant to the strongest threats to cybersecurity and high-profile cyber-attacks. In recent times, information security scientists and researchers had developed various cryptographic schemes that defeated attacks using the most sophisticated (in terms of processor speed) classical computer. However, this resistance will soon erode with the arrival of quantum computers. In this paper, we profiled quantum computers and quantum algorithms based on their widely believed threat against currently secure cryptographic primitives.

APA, Harvard, Vancouver, ISO, and other styles

27

Вамболь, Олексій Сергійович. "ВДОСКОНАЛЕНА ПОЛІНОМІАЛЬНО-СКЛАДНА АТАКА ВІДНОВЛЕННЯ ВІДКРИТОГО ТЕКСТУ НА РАНЦЕВИЙ ШИФР НА ОСНОВІ МАТРИЦЬ". RADIOELECTRONIC AND COMPUTER SYSTEMS, № 3 (28 вересня 2020): 67–74. http://dx.doi.org/10.32620/reks.2020.3.07.

Full text

Abstract:

Asymmetric ciphers are widely used to ensure the confidentiality of data transmission via insecure channels. These cryptosystems allow the interacting parties to create a shared secret key for a symmetric cipher in such a way that an eavesdropper gets no information useful for cryptanalysis. Network security protocols that use asymmetric ciphers include TLS, S/MIME, OpenPGP, Tor, and many others. Some of the asymmetric encryption schemes are homomorphic, that is, that they allow calculations on encrypted data to be performed without preliminary decryption. The aforesaid property makes possible

APA, Harvard, Vancouver, ISO, and other styles

28

Martsenyuk, V. P., A. S. Sverstyuk, I. Ye Andrushchak, and О. Yu Rechun. "Components and kay features of the analisis symmetric cryptocircuit." COMPUTER-INTEGRATED TECHNOLOGIES: EDUCATION, SCIENCE, PRODUCTION, no. 50 (March 31, 2023): 65–70. http://dx.doi.org/10.36910/6775-2524-0560-2023-50-09.

Full text

Abstract:

This article discusses the key aspects and technologies of applying many cryptanalysis methods for assessing the stability of symmetric block encryption algorithms. The following aspects of analysis methods such as linear, differential, slide attack, algebraic analyzes are also considered. Approaches to the analysis of the AES standard are compared. Also, when considering the approaches to the analysis of modern symmetric cryptosystems, special attention is paid to special questions regarding the possibility of using distributed multiprocessor calculations in order to reduce the analysis time.

APA, Harvard, Vancouver, ISO, and other styles

29

Chernyavskiy, A. F., E. I. Kozlova, and Yu A. Chernyavskiy. "Features of Structural Hardware Transformation of Information in Cryptosystems." Doklady BGUIR 22, no. 5 (2024): 80–88. http://dx.doi.org/10.35596/1729-7648-2024-22-5-80-88.

Full text

Abstract:

The article considers types, functions and some features of cryptosystems, as well as circuit design options for expanding their functionality. Options for generating keys and ciphers used in cryptosystems with a typical structural organization, and technologies for creating encryption chains are presented. An encryption scheme is described, in the recurrent formula of the algorithm of which the previous blocks of both encryption and plaintext are used. This scheme reliably protects against any unauthorized modiﬁcation of the encrypted text. Structural diagrams of the organization of symmetric

APA, Harvard, Vancouver, ISO, and other styles

30

Chernyavskiy, A. F., E. I. Kozlova, and Yu A. Chernyavskiy. "Features of Structural Hardware Transformation of Information in Cryptosystems." Doklady BGUIR 22, no. 5 (2024): 80–88. http://dx.doi.org/10.35596/1729-7648-2024-22-5-80-88.

Full text

Abstract:

The article considers types, functions and some features of cryptosystems, as well as circuit design options for expanding their functionality. Options for generating keys and ciphers used in cryptosystems with a typical structural organization, and technologies for creating encryption chains are presented. An encryption scheme is described, in the recurrent formula of the algorithm of which the previous blocks of both encryption and plaintext are used. This scheme reliably protects against any unauthorized modiﬁcation of the encrypted text. Structural diagrams of the organization of symmetric

APA, Harvard, Vancouver, ISO, and other styles

31

Huang, Jing Lian, Zhuo Wang, and Mei Rong He. "Algebraic Immunity, Correlation Immunity and other Cryptographic Properties of Quadratic Rotation Symmetric Boolean Functions." Advanced Materials Research 989-994 (July 2014): 2593–98. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.2593.

Full text

Abstract:

Boolean functions with a variety of secure cipher properties are the key factors to design cryptosystem with the ability to resist multiple cipher attacks and good safety performance. In this paper, using the derivative of the Boolean functions and the e-derivative defined by ourselves as the main research tools, we study algebraic immunity, correlation immunity and other cryptographic properties of the quadratic rotation symmetric Boolean functions. We determine the quadratic rotation symmetric Boolean functions which are H Boolean functions, and the range of weight distribution of the quadra

APA, Harvard, Vancouver, ISO, and other styles

32

Jasim, Khalid F., and Akram M. Zeki. "Design of Protection Software Using Some Cryptosystems for Cloud Database Files." Cihan University-Erbil Scientific Journal 8, no. 1 (2024): 70–79. http://dx.doi.org/10.24086/cuesj.v8n1y2024.pp70-79.

Full text

Abstract:

The security of cloud databases may be a basic concern for organizations as they store and manage expansive volumes of delicate information within the cloud. Cryptosystems played an essential part in securing information privacy and integrity in these situations. This paper gives an in-depth investigation of the utilization of cryptosystems for cloud database security. The paper starts by talking about the foundation and importance of cloud database security, highlighting the expanding requirement for strong information security measures. A comprehensive study reviewed and investigated the cur

APA, Harvard, Vancouver, ISO, and other styles

33

Krokhaleva, Y. N., and E. L. Krotova. "Comparative analysis of existing key exchange protocols for symmetric cryptosystems." Journal of the Ural Federal District. Information security 19, no. 4 (2019): 30–34. http://dx.doi.org/10.14529/secur190404.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Bodnia, Mykyta, Maryna Yesina, and Volodymyr Ponomar. "Researching the possibilities of using steganographic and cryptographic algorithms for information hiding." Computer Science and Cybersecurity, no. 2 (December 28, 2023): 43–57. http://dx.doi.org/10.26565/2519-2310-2023-2-05.

Full text

Abstract:

The organization of information security has always been a relevant task, especially after the emergence of information and communication systems. The fundamental directions in the field of information security, dating back to ancient times, include cryptography and steganography. Cryptography implements information protection by transforming it into an unreadable form. Steganography allows the concealment of information in various containers (such as images, texts, audio recordings), keeping the presence of information unnoticed by casual observers. The article discusses approaches to cryptog

APA, Harvard, Vancouver, ISO, and other styles

35

Avramenko, Viktor, and Volodymyr Demianenko. "Serial encryption using the functions of real variable." RADIOELECTRONIC AND COMPUTER SYSTEMS, no. 2 (June 2, 2021): 39–50. http://dx.doi.org/10.32620/reks.2021.2.04.

Full text

Abstract:

Context. Using the functions of a real variable in cryptosystems as keys allow increasing their cryptographic strength since it is more difficult to select such keys. Therefore, the development of such systems is relevant. Objective. Cryptosystems with symmetric keys are proposed for encrypting and decrypting a sequence of characters represented as a one-dimensional numerical array of ASCII codes. These keys are functions of a real variable that satisfies certain restrictions. They can be both continuous and discrete. Method. Two cryptosystem options are proposed. In the first embodiment, the

APA, Harvard, Vancouver, ISO, and other styles

36

Chukwudi, Ashioba Nwanze, Emma-Osiebe Obaro, Ogbodhu Charles Uzoma-Odoji-Kpasa, and Ndubuife Nonso Daniel. "Modeling Diffie Hellman Key Exchange Algorithm using Object-Oriented Analysis and Design Technique." International Journal on Cryptography and Information Security 14, no. 2 (2024): 01–08. http://dx.doi.org/10.5121/ijcis.2024.14201.

Full text

Abstract:

In a communicating system, information transmitted from one location (sender) to another (receiver) is secured or protected from unauthorized users or intruders. Many cryptographic algorithms have been used to prevent and protect data and information from being hacked by intruders. Both symmetric and asymmetric algorithms have not been successful in simulating cryptosystems as real-world issues with things enclosed in properties and procedures. This research simulates the Diffie Hellman key exchange algorithm using object-oriented analysis and design techniques. The researchers used the Unifie

APA, Harvard, Vancouver, ISO, and other styles

37

Jeddi, Zahra, Ahmed Khattab, Esmaeil Amini, and Madgy Bayoumi. "Redundant Bit Security in RFIDs: Architecture Design and Security Performance Evaluation." Journal of Circuits, Systems and Computers 26, no. 09 (2017): 1750138. http://dx.doi.org/10.1142/s0218126617501389.

Full text

Abstract:

This paper presents an analysis of the security performance and evaluation of the hardware architecture of the redundant bit security (RBS) cryptosystem. RBS is a lightweight symmetric encryption algorithm that targets resource-constrained RFID devices. Unlike the existing cryptosystems, RBS simultaneously provides confidentiality, authentication, and integrity of the plaintext by inserting hash-generated redundant bits among the already modified plaintext data. A flexible-length hash algorithm in our optimized hardware architecture allows RBS to support different key sizes which allows flexib

APA, Harvard, Vancouver, ISO, and other styles

38

Kinganga, Joel, Nathanael Kasoro, and Alain Musesa. "Dynamics Data Encryption Based on Chaotic Functions and Elliptic Curves: Application to Text Data." Al-Mustansiriyah Journal of Science 36, no. 1 (2025): 56–68. https://doi.org/10.23851/mjs.v36i1.1616.

Full text

Abstract:

Background: Given the vast amount of data generated daily on the Internet, numerous cryptosystems have been developed to ensure data confidentiality using symmetric, asymmetric, or hybrid encryption techniques. However, many of these systems suffer from limitations such as slow execution times and large key sizes. Objective: This paper presents a novel cryptosystem for text data encryption that integrates elliptic curve cryptography with chaotic functions to enhance data confidentiality and security. Methods: The proposed system utilizes elliptic curve points and pseudo-random numbers generate

APA, Harvard, Vancouver, ISO, and other styles

39

Krishna, B. Murali, Chella Santhosh, and S. K. Khasimbee. "FPGA Implementation of High-Performance s-box Model and Bit-level Masking for AES Cryptosystem." International Journal of Electrical and Electronics Research 10, no. 2 (2022): 171–76. http://dx.doi.org/10.37391/ijeer.100221.

Full text

Abstract:

The inadequacies inherent in the existing cryptosystem have driven the development of exploit the benefits of cipher key characteristics and associated key generation tasks in cryptosystems for high-performance security systems. In this paper, cipher key-related issues that exists in conventional symmetric AES crypto system is considered as predominant issues and also discussed other problems such as lack of throughput rate, reliability and unified key management problems are considered and solved using appropriate hierarchical transformation measures. The inner stage pipelining is introduced

APA, Harvard, Vancouver, ISO, and other styles

40

Grote, Olaf, and Andreas Ahrens. "Simulation and Application Purpose of a Randomized Secret Key with Quantum Key Distribution." Electrical, Control and Communication Engineering 18, no. 1 (2022): 43–49. http://dx.doi.org/10.2478/ecce-2022-0006.

Full text

Abstract:

Abstract The Quantum Key Distribution (QKD) is a well-researched secure communication method for exchanging cryptographic keys only known by the shared participants. The vulnerable problem of a secret key distribution is the negotiation and the transfer over an insecure or untrusted channel. Novel further developments of the QKD communication method are part of in-field technologies and applications in communication devices, such as satellites. However, expensive physical test setups are necessary to improve new application possibilities of cryptographic protocol involving components of quantu

APA, Harvard, Vancouver, ISO, and other styles

41

Eid Khamees Al-Shammary, Mohammed, and Sufyan Salim Mahmood Al-Dabbagh. "Differential Distribution Table implementation DDT survey." Technium: Romanian Journal of Applied Sciences and Technology 4, no. 10 (2022): 15–30. http://dx.doi.org/10.47577/technium.v4i10.7700.

Full text

Abstract:

The security of the transmitted data is one of the important issues that led to improve cryptosystems. Block ciphers as symmetric key cryptosystems are widely implemented in different applications and devices. Many algorithms had been presented that proposed new designs and enhancements for the block ciphers. Most of these papers based on the differential characteristics that provided by the Differential Distribution table DDT. The implementation of DDT had several points of advantages in design, modify and attack block cipher. Even with larger block size of some cipher families, the Partial D

APA, Harvard, Vancouver, ISO, and other styles

42

Hashim, HayderRaheem, and Mohammed Abdul Hameed JasemAlkufi. "A Proposed Method for Text Encryption using Symmetric and Asymmetric Cryptosystems." International Journal of Computer Trends and Technology 50, no. 2 (2017): 94–100. http://dx.doi.org/10.14445/22312803/ijctt-v50p117.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Melenti, Yevhen, Olha Korol, Volodymyr Shulha, et al. "Development of post-quantum cryptosystems based on the Rao-Nam scheme." Eastern-European Journal of Enterprise Technologies 1, no. 9 (133) (2025): 35–48. https://doi.org/10.15587/1729-4061.2025.323195.

Full text

Abstract:

The object of the research is the process of ensuring the protection of data transmission in communication channels of critical infrastructure objects based on mobile and smart technologies. The development of quantum computing technologies based on Grover and Shor algorithms provides practical cracking of symmetric and asymmetric cryptosystems in polynomial time. The emergence of systems based on artificial intelligence allows creating hybrid systems for detecting weaknesses (critical points) in security systems not only on critical infrastructure objects. In addition, a full-scale quantum co

APA, Harvard, Vancouver, ISO, and other styles

44

Aldali, Musab A., Hesham Saleh Almssmari, and Mustafa M. Salama. "Comparative Analysis of the RSA and AES Algorithms as Data Cryptosystems." International Science and Technology Journal 34, no. 2 (2024): 1–14. http://dx.doi.org/10.62341/mhmc3027.

Full text

Abstract:

Data encryption IS defined as a method of transforming information into a coded format, ensuring that only authorized individuals can successfully decode and comprehend the content. In addition, cryptography is principally categorized into two distinct types: symmetric key cryptography and asymmetric key cryptography. In this research, we conduct a comparative analysis of two cryptographic systems: RSA (asymmetric) and AES (symmetric key), specifically evaluating their performance in data encryption for point-to-point communications. The analysis focuses on the speed of file encryption and dec

APA, Harvard, Vancouver, ISO, and other styles

45

Tomashevsky, Bogdan, Serhii Yevseiev, Serhii Pohasii, and Stanislav Milevskyi. "MECHANISMS FOR ENSURING THE SECURITY OF CHANNELS OF A PROSPECTIVE MANAGEMENT SYSTEM." Advanced Information Systems 6, no. 3 (2022): 66–82. http://dx.doi.org/10.20998/2522-9052.2022.3.10.

Full text

Abstract:

The development of military (state) control systems in modern conditions of hybrid warfare requires the possibility of rapid expansion of both functionality and scaling of the physical and logical basis of management, increasing the range of digitization and use of both military and civilian communication channels to manage troops and weapons. Not only the computing power of the enemy, the means of suppressing and / or blocking the communication channels of the control system, but also the development of quantum technologies that place new and more stringent requirements on security mechanisms

APA, Harvard, Vancouver, ISO, and other styles

46

Nair, Divya J. "A Synoptic View on Network Security and Cryptography." International Journal for Research in Applied Science and Engineering Technology 9, no. 9 (2021): 2102–4. http://dx.doi.org/10.22214/ijraset.2021.38339.

Full text

Abstract:

Abstract: Cryptography is a tool that guards a network and data transmission over a network. Data Security is the core aspect of secure data transmission over untrustworthy network. Network security encompasses the authorization of access to data in a network, which is organized by the network administrator. Users select or are assigned an ID and password or other authenticating information that permits them access to information and programs within their control. Network security covers a wide range of computer networks, both public and private, that are used in ordinary jobs performing trans

APA, Harvard, Vancouver, ISO, and other styles

47

Sachin, Ravi Kumar, Sakshi, et al. "Advances in Optical Visual Information Security: A Comprehensive Review." Photonics 11, no. 1 (2024): 99. http://dx.doi.org/10.3390/photonics11010099.

Full text

Abstract:

In the modern era, the secure transmission and storage of information are among the utmost priorities. Optical security protocols have demonstrated significant advantages over digital counterparts, i.e., a high speed, a complex degree of freedom, physical parameters as keys (i.e., phase, wavelength, polarization, quantum properties of photons, multiplexing, etc.) and multi-dimension processing capabilities. This paper provides a comprehensive overview of optical cryptosystems developed over the years. We have also analyzed the trend in the growth of optical image encryption methods since their

APA, Harvard, Vancouver, ISO, and other styles

48

Wang, Yongjuan, Guangpu Gao, and Qingjun Yuan. "Searching for Cryptographically Significant Rotation Symmetric Boolean Functions by Designing Heuristic Algorithms." Security and Communication Networks 2022 (March 27, 2022): 1–6. http://dx.doi.org/10.1155/2022/8188533.

Full text

Abstract:

It has been proved that the set of rotation symmetric Boolean functions (RSBFs) is abundant in cryptographically strong functions with multiple criteria. In this study, we design two genetic algorithms and apply them to search for balanced RSBFs with high nonlinearity. The experimental results show that our methods can generate cryptographically strong Boolean functions with high nonlinearity, 1-resilient functions, and optimal algebraic immunity. It shows that these functions have superiority from the view point of practical application in cryptosystems compared with known ones which are obta

APA, Harvard, Vancouver, ISO, and other styles

49

Циганенко, О. С. "Development of digital signature algorithm based on the Niederriter crypto-code system." Системи обробки інформації, no. 3(162), (September 30, 2020): 86–94. http://dx.doi.org/10.30748/soi.2020.162.09.

Full text

Abstract:

The development of computing resources in the post-quantum period calls into question the provision of the required level of stability of symmetric and asymmetric cryptography algorithms. The advent of a full-scale quantum computer based on the Shore and Grover algorithms greatly increases the capabilities of cybercriminals and reduces the resilience of cryptosystems used in protocols for basic security services. The article analyzes the main requirements for resistance to post-quantum cryptography algorithms. In such conditions, it is necessary to use modified cryptosystems that provide an in

APA, Harvard, Vancouver, ISO, and other styles

50

Babenko, Ludmila, and Alina Trepacheva. "Towards Unsecurity of Two Homomorphic Encryptions Based on Residue System." SPIIRAS Proceedings 18, no. 1 (2019): 230–62. http://dx.doi.org/10.15622/sp.18.1.230-262.

Full text

Abstract:

The security of two recently proposed symmetric homomorphic encryption schemes based on residue system is analyzed. Both schemes have a high computational efficiency since using residue system naturally allows parallelizing computations. So they could be good candidates to protect the data in clouds. But to the best of our knowledge there is a lack of security analysis for these encryption schemes. It should be noted that the first cryptosystem under our consideration was already considered in literature. The sketch of adaptive chosen-plaintext attack was proposed and estimat

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!