Log in

Relevant bibliographies by topics / 2 Cryptography / Journal articles

To see the other types of publications on this topic, follow the link: 2 Cryptography.

Journal articles on the topic '2 Cryptography'

Author: Grafiati

Published: 3 June 2025

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 '2 Cryptography.'

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

Klyucharev, Petr. "CELLULAR AUTOMATA AND THEIR GENERALIZATIONS IN CRYPTOGRAPHY. PART 2." Voprosy kiberbezopasnosti, no. 1(47) (2022): 37–48. http://dx.doi.org/10.21681/2311-3456-2022-1-37-48.

Full text

Abstract:

The purpose of the article is an analytical review of the application of cellular automata and their generalizations in cryptography. Research method: an analysis of scientific publications on the topic of the article. Results: The review article analyzes the literature devoted to the use of cellular automata and their generalizations for the construction of cryptographic algorithms. The article consists of two parts. The first part was devoted to classical cellular automata and symmetric cryptographic algorithms based on them. It briefly discussed the history of the theory of cellular automat

APA, Harvard, Vancouver, ISO, and other styles

2

Young, Adam L., and Moti Yung. "Cryptography: Malicious Cryptography – Exposing Cryptovirology." Computer Law & Security Review 20, no. 5 (2004): 430. http://dx.doi.org/10.1016/s0267-3649(04)00079-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Buchmann, Johannes, Kristin Lauter, and Michele Mosca. "Postquantum Cryptography, Part 2." IEEE Security & Privacy 16, no. 5 (2018): 12–13. http://dx.doi.org/10.1109/msp.2018.3761714.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Mohapatra, A. K., Pankaj Lathar, and Shailendra Singh Gaur. "A novel security algorithm for text and image data using multi node cryptographic algorithm." Journal of Discrete Mathematical Sciences and Cryptography 28, no. 3 (2025): 753–64. https://doi.org/10.47974/jdmsc-1946.

Full text

Abstract:

In today’s world of Ubiquitous Computing, Network security plays an important role in preventing and reducing the chances of various network attacks and working on the various cryptographic algorithms to reduce the risk of getting affected. It is also a challenging situation to reduce the energy consumption of nodes and increasing the life time of sensor nodes. In this paper, Threshold Cryptography is studied and a novel cryptographic algorithm using multi node cryptography for text and image data is proposed. The proposed algorithm is an asymmetric cryptographic algorithm, which uses a key of

APA, Harvard, Vancouver, ISO, and other styles

5

Agrawal, Richa, Dr Brajesh Kumar Singh, and Dr Lavkush Sharma. "Cryptography based Internet Security ATM System using Fingerprint for securing PIN." Journal of University of Shanghai for Science and Technology 23, no. 10 (2021): 369–80. http://dx.doi.org/10.51201/jusst/21/10717.

Full text

Abstract:

Today, ATMs (automated teller machines) are used in a variety of ways, including: you can withdraw cash, transfer cash, check your balance, get an account summary, and more. The main component here is security, to maintain the security we prefer cryptography and biometrics. Cryptography is a state- of-the-art technique for increasing security. Using cryptography and biometrics together creates a bio cryptographic system. Since the private key is an important component of encryption, here one is the main task to secure the private [1] key. To overcome this issue, we use a biometric fingerprint

APA, Harvard, Vancouver, ISO, and other styles

6

Paul, Sebastian, and Melanie Niethammer. "On the importance of cryptographic agility for industrial automation." at - Automatisierungstechnik 67, no. 5 (2019): 402–16. http://dx.doi.org/10.1515/auto-2019-0019.

Full text

Abstract:

AbstractCryptographic primitives do not remain secure, they deteriorate over time. On the one hand increasing computing power leads to more powerful attacks on their underlying mathematical problems. On the other hand quantum computing threatens to break many widely used cryptographic primitives. The main goal ofcryptographic agilityis to enable an easy transition to alternative cryptographic schemes. Considering the long lifetime of products within industrial automation, we argue that vendors should strive for cryptographic agility in their products. In this work we motivate cryptographic agi

APA, Harvard, Vancouver, ISO, and other styles

7

Vidhya, E., and R. Kiruba Kumari. "Medical Data Security in IOT Using DNA Cryptography and Insertion Method." Data Analytics and Artificial Intelligence 3, no. 2 (2023): 21–25. http://dx.doi.org/10.46632/daai/3/2/5.

Full text

Abstract:

The Internet of Things (IOT) system is a network system that communicates with other devices and systems via the web by using any one of the sensors, devices, applications, and other tools. To prevent unauthorized data transmission access, these systems and networks should include a suitable cryptography mechanism. The security of the shared resources on the data communication network is regarded as one of the key challenges. In this paper, the proposed scheme consists of two parts: (i) generating a key using an array of prime numbers based on the RSA algorithm, and (ii) devising a secure comm

APA, Harvard, Vancouver, ISO, and other styles

8

Pratiwi, Saniya Rahma, Christy Atika Sari, and Eko Hari Rachmawanto. "Text and Image Encryption Using Symmetric Cryptography Ron Rivest Cipher 2 (RC2)." Sinkron 9, no. 1 (2024): 10–19. http://dx.doi.org/10.33395/sinkron.v9i1.13054.

Full text

Abstract:

In the current context, ensuring the secure transmission of data over the internet has become a critical concern, with information technology playing a fundamental role. As society advances into the digital information age, the importance of network security issues continues to increase. Therefore, the need for cryptographic technology has emerged to overcome these challenges. Cryptography includes symmetric and asymmetric cryptography. An example of symmetric cryptography is the RC2 algorithm. RC2 is a symmetric encryption algorithm that uses a single key to encrypt and decrypt data. The ciph

APA, Harvard, Vancouver, ISO, and other styles

9

Tushar, Anil Patil, and Dr. Mrs. K. V. Kulhalli Prof. "Symmetric Key Cryptography Algorithm for Data Security." International Journal of Trend in Scientific Research and Development 2, no. 2 (2018): 586–89. https://doi.org/10.31142/ijtsrd9444.

Full text

Abstract:

Ambiguous Multi Symmetric Cryptography AMSC that hide multiple plain texts in a cipher text using the same number of keys. The goal of this method is to overcome the problem of symmetric cryptography failure when the shared key is exposed. The proposed method AMSC is a cryptographic primitive that preserves plausible deniability after a cryptographic key is discovered. We evaluate AMSC in terms of security and complexity. The security analysis shows that our scheme withstands all security attack models with different knowledge of the adversary. In terms of time complexity, AMSC produces the ci

APA, Harvard, Vancouver, ISO, and other styles

10

Bos, Joppe W., Craig Costello, Huseyin Hisil, and Kristin Lauter. "Fast Cryptography in Genus 2." Journal of Cryptology 29, no. 1 (2014): 28–60. http://dx.doi.org/10.1007/s00145-014-9188-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Li, Hua. "Cost-Efficient Pipelined Modular Polynomial Multiplier for Post-Quantum Cryptography Saber." Quantum Reports 7, no. 1 (2025): 10. https://doi.org/10.3390/quantum7010010.

Full text

Abstract:

The development of quantum computers presents a great challenge for current cryptographic algorithms. Post-quantum cryptography has been proposed to secure against quantum computers in the near future. Modular polynomial multiplication is a frequent arithmetic operation in post-quantum cryptography. In this paper, a low-cost and efficient pipelined architecture for modular polynomial multiplication in Saber has been proposed and synthesized with the Virtex UltraScale + xcu200-fsgd2104-2-e board. It can achieve a frequency of 250 MHz and only uses 11,499 LUTs, 7034 FFs and 32 IOs.

APA, Harvard, Vancouver, ISO, and other styles

12

Archana, B. U., and V. Niranjana. "Overview of Cryptography." Data Analytics and Artificial Intelligence 3, no. 2 (2023): 74–80. http://dx.doi.org/10.46632/daai/3/2/15.

Full text

Abstract:

Until very recently, the term "cryptography" was almost always used to refer to "encryption," which is the act of transforming plaintext or conventional information into an unintelligible form (called cipher text). Decryption is the opposite, or the process of returning plaintext from the unintelligible cipher text. The encryption and reversing decryption operations are carried out by a pair of algorithms known as cyphers (or cyphers). The algorithm and, in each case, a "key" work together just to regulate the precise operation of a cypher. The key, which is required to decrypt the cipher text

APA, Harvard, Vancouver, ISO, and other styles

13

Shi, Leyi, and Mengting Liu. "A Decentralized Signcryption Scheme Based on CFL." Sensors 25, no. 6 (2025): 1773. https://doi.org/10.3390/s25061773.

Full text

Abstract:

The rapid advancement of quantum computing technology poses a significant threat to conventional public key cryptographic infrastructure. The SM2 (state key cryptography algorithm no. 2) elliptic curve public key cryptographic algorithm, which adopts elliptic curve cryptography, has demonstrated strong resistance to quantum attacks. However, existing signcryption schemes remain vulnerable due to their reliance on a single certification authority (CA) managing all keys. The cryptography fundamental logics (CFL) authentication process eliminates the need for third-party involvement, achieving de

APA, Harvard, Vancouver, ISO, and other styles

14

Danger, Jean-Luc, Youssef El Housni, Adrien Facon, et al. "On the Performance and Security of Multiplication in GF(2N)." Cryptography 2, no. 3 (2018): 25. http://dx.doi.org/10.3390/cryptography2030025.

Full text

Abstract:

Multiplications in G F ( 2 N ) can be securely optimized for cryptographic applications when the integer N is small and does not match machine words (i.e., N < 32 ). In this paper, we present a set of optimizations applied to DAGS, a code-based post-quantum cryptographic algorithm and one of the submissions to the National Institute of Standards and Technology’s (NIST) Post-Quantum Cryptography (PQC) standardization call.

APA, Harvard, Vancouver, ISO, and other styles

15

Zhukov, Alexei. "Cellular Automata in Cryptography. Part 2." Voprosy kiberbezopasnosti, no. 4(22) (2017): 47–66. http://dx.doi.org/10.21681/2311-3456-2017-4-47-66.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ms., A. A. Deshmukh, Manali Dubal Ms., Mahesh TR Dr., and C. R. Chauhan Mr. "DATA SECURITY ANALYSIS AND SECURITY EXTENSION FOR SMART CARDS USING JAVA CARD." International Journal of Advanced Information Technology (IJAIT) 2, no. 2 (2012): 41–57. https://doi.org/10.5281/zenodo.3534867.

Full text

Abstract:

Smart cards improve the convenience and security of any transaction. They provide tamper-proof storage of user and account identity. Multifunction cards are used to manage network system access, store value and other data. The cards carry personal account, credit and buying-preference information and thus, security becomes a primary issue here. Public Key Cryptography plays an essential role in electronic banking and financial transactions. ECC is one of the best public key techniques for its small key size, high security and is suitable for secure access of smart cards. This article gives pri

APA, Harvard, Vancouver, ISO, and other styles

17

Kim, Jong-Yun. "Core technology development trends of quantum industry and global market growth trends." Edelweiss Applied Science and Technology 9, no. 3 (2025): 2941–45. https://doi.org/10.55214/25768484.v9i3.5891.

Full text

Abstract:

This study analyzes the advantages of three key technologies in the quantum industry (quantum computers, quantum cryptography, and quantum sensors) in Chapter 2. It analyzes the development trends of quantum technologies and the global market growth trends for each technology, such as quantum computers, which have been accelerating since around 2012; quantum cryptography, which is replacing the existing digital cryptographic communication network using QKD services; and quantum sensors, which provide the foundation for the realization of quantum computer/quantum cryptography communication tech

APA, Harvard, Vancouver, ISO, and other styles

18

Larsson, J. "A practical trojan horse for Bell-inequality-based quantum cryptography." Quantum Information and Computation 2, no. 6 (2002): 434–42. http://dx.doi.org/10.26421/qic2.6-2.

Full text

Abstract:

Quantum Cryptography, or more accurately, Quantum Key Distribution (QKD) is based on using an unconditionally secure ``quantum channel'' to share a secret key among two users. A manufacturer of QKD devices could, intentionally or not, use a (semi-)classical channel instead of the quantum channel, which would remove the supposedly unconditional security. One example is the BB84 protocol, where the quantum channel can be implemented in polarization of single photons. Here, use of several photons instead of one to encode each bit of the key provides a similar but insecure system. For protocols ba

APA, Harvard, Vancouver, ISO, and other styles

19

Padmapriya, I., and H. Ragini. "Cloud Cryptography." International Journal of Trend in Scientific Research and Development 3, no. 2 (2019): 972–73. https://doi.org/10.31142/ijtsrd21547.

Full text

Abstract:

Cloud computing is the emerging trend in today's world. Cloud computing is not a separate technology, it is platform which provides platform as a service, Infrastructure as a service and Software as a service. The most important thing with cloud is that we hire everything from a third party or store our important data's in a third parties place .Here comes the major issue of how our data's are secured. In this paper, we discuss about how to protect our data's in the cloud with various cryptographic techniques. Padmapriya I | Ragini H "Cloud Cryptography" Published in

APA, Harvard, Vancouver, ISO, and other styles

20

Smid, Michiel H. M. "Primality and cryptography." Signal Processing 16, no. 2 (1989): 179–81. http://dx.doi.org/10.1016/0165-1684(89)90097-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Parab, Sejal. "A Review on Cryptography Using SHA Algorithm." INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 09, no. 06 (2025): 1–9. https://doi.org/10.55041/ijsrem50103.

Full text

Abstract:

Abstract: As digital technology continues to expand into every field, ensuring the integrity and authenticity of data has become increasingly essential. Cryptographic hash functions, especially the Secure Hash Algorithm (SHA) family, are instrumental in achieving these objectives. This review presents a detailed study of SHA-1, SHA-2, and SHA-3, discussing their algorithmic design, strengths, weaknesses, and applications in digital security. The paper provides comparative insights supported by research literature and explores recent advances in cryptanalysis and the challenges posed by quantum

APA, Harvard, Vancouver, ISO, and other styles

22

Santoli, Thomas, and Christian Schaffner. "Using Simon's algorithm to attack symmetric-key cryptographic primitives." Quantum Information and Computation 17, no. 1&2 (2017): 65–78. http://dx.doi.org/10.26421/qic17.1-2-4.

Full text

Abstract:

We present new connections between quantum information and the field of classical cryptography. In particular, we provide examples where Simon’s algorithm can be used to show insecurity of commonly used cryptographic symmetric-key primitives. Specifically, these examples consist of a quantum distinguisher for the 3-round Feistel network and a forgery attack on CBC-MAC which forges a tag for a chosen-prefix message querying only other messages (of the same length). We assume that an adversary has quantum-oracle access to the respective classical primitives. Similar results have been achieved re

APA, Harvard, Vancouver, ISO, and other styles

23

Marin, Leandro, Antonio Jara, and Antonio Skarmeta. "Multiplication and Squaring with Shifting Primes on OpenRISC Processors with Hardware Multiplier." JUCS - Journal of Universal Computer Science 19, no. (16) (2013): 2368–84. https://doi.org/10.3217/jucs-019-16-2368.

Full text

Abstract:

Cryptographic primitives are the key component in the security protocols to support the authentication, key management and secure communication establishment. For that reason, this work presents the optimization of the Elliptic Curve Cryptography through the usage of Shifting Primes for constrained devices. Specifically, this presents the optimization for the chipsets JN51XX from NXP/Jennic, which are based on OpenRISC architecture and offer a class-2 constrained device. In details, Shifting Primes features have allowed to optimize the multiplication and squaring through a double accumulator a

APA, Harvard, Vancouver, ISO, and other styles

24

Michael, N. John, Ozioma Ogoegbulem, Otobong. G. Udoaka, O. Nwala Boniface, and Perpetua Ngozi Obi. "CRYPTOGRAPHIC ENCRYPTION BASED ON RAIL-FENCE PERMUTATION CIPHER." GPH - International Journal of Mathematics 06, no. 11 (2023): 01–06. https://doi.org/10.5281/zenodo.10209885.

Full text

Abstract:

<strong>Cryptographic systems play a pivotal role in securing sensitive information in various domains. Permutation ciphers, a fundamental component of classical cryptography, involve the rearrangement of characters in a message to achieve confidentiality. This paper explores the principles and applications of permutation ciphers in cryptographic encryption. The study delves into the historical context, the underlying mechanisms of permutation ciphers, and their relevance in contemporary cryptographic practices. Using permutation on n symbols and Rail Fence Cipher, we construct an algorithm fo

APA, Harvard, Vancouver, ISO, and other styles

25

Vlasenko, A., M. Evsyukov, M. Putyato, and A. Makaryan. "Decision Support System for Finding an Optimal Postquantum Key Encapsulation Mechanism. Part 2. Prototype Evaluation." Proceedings of Telecommunication Universities 7, no. 4 (2021): 78–84. http://dx.doi.org/10.31854/1813-324x-2021-7-4-78-84.

Full text

Abstract:

This is the final part of the series of articles devoted to the development of a decision support system for choosing the optimal post-quantum key encapsulation mechanism. Efficiency of the methodology proposed for choosing the optimal implementation of the post-quantum cryptographic algorithm is evaluated and substantiated. The economic feasibility of approach is shown and its positive impact on the quality of the cryptographic information protection subsystem is demonstrated. Efficiency comparison of the prototype of the decision support system with existing software products aimed at suppor

APA, Harvard, Vancouver, ISO, and other styles

26

Zeriouh, M., A. Chillali, and Abdelkarim Boua. "Cryptography based on the Matrices." Boletim da Sociedade Paranaense de Matemática 37, no. 3 (2017): 75–83. http://dx.doi.org/10.5269/bspm.v37i3.34542.

Full text

Abstract:

In this work we introduce a new method of cryptography based on the matrices over a finite field $\mathbb{F}_{q}$, were $q$ is a power of a prime number $p$. The first time we construct thematrix $M=\left(\begin{array}{cc}A_{1} & A_{2} \\0 & A_{3} \\\end{array}\right)$ were \ $A_{i}$ \ with $i \in \{1, 2, 3 \}$ is the matrix oforder $n$ \ in \ $\mathcal{M}(\mathbb{F}_{q})$ - the set ofmatrices with coefficients in $\mathbb{F}_{q}$ - and $0$ is the zero matrix of order $n$. We prove that $M^{l}=\left(\begin{array}{cc}A_{1}^{l} & (A_{2})_{l} \\0 & A_{3}^{l} \\\end{array}\right)$

APA, Harvard, Vancouver, ISO, and other styles

27

Leevik, A. G., E. S. Malygina, E. M. Melnichuk, and D. A. Nabokov. "CURRENT PARADIGMS FOR CONSTRUCTION OF LATTICE-BASED DIGITAL SIGNATURE SCHEMES." Prikladnaya Diskretnaya Matematika, no. 67 (2025): 36–69. https://doi.org/10.17223/20710410/67/2.

Full text

Abstract:

With the advent of quantum computing, research into post-quantum cryptography has gained significant attention. This is a novel branch of cryptography that utilizes algorithms and protocols designed to withstand attacks from quantum computers. Lattice theory represents a promising area within post-quantum cryptographic research. Two early examples of lattice-based cryptosystems are the GGH and NTRU schemes. These schemes are based on the challenge of finding the closest vector in a lattice and differ primarily in the type of lattice used. The NTRUSign protocol was developed by combining the st

APA, Harvard, Vancouver, ISO, and other styles

28

ЛАВРИК, ІВАН. "ДОСЛІДЖЕННЯ АЛГОРИТМІВ ПОСТКВАНТОВОГО ЦИФРОВОГО ПІДПИСУ". Herald of Khmelnytskyi National University. Technical sciences 333, № 2 (2024): 361–69. http://dx.doi.org/10.31891/2307-5732-2024-333-2-56.

Full text

Abstract:

The continuous development of quantum computing requires the development of cryptographic algorithms resistant to quantum cryptanalysis. Therefore, the National Institute of Standards and Technology (NIST) is holding a competition to standardize algorithms in the post-quantum period, including Crystals-Dilithium, Falcon, and Sphincs+ for digital signatures. In order to determine the ways of development and ways to improve the existing methods of cryptographic protection and electronic digital signature (EDS), an urgent task arose to assess the effectiveness (stability and computational complex

APA, Harvard, Vancouver, ISO, and other styles

29

Bhosale, Akshay Gajanan, and Vikram Shripati Patil. "A (2, 2) Visual Cryptography Technique with Improved Contrast." Information Security Journal: A Global Perspective 29, no. 4 (2020): 199–208. http://dx.doi.org/10.1080/19393555.2020.1740840.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

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

31

Korzhik, V. I., V. A. Yakovlev, V. S. Starostin, and M. V. Buinevich. "Advance in Applied Cryptography Theory: Survey and Some New Results. Part 2. Keyless Cryptography." Proceedings of Telecommunication Universities 10, no. 6 (2024): 79–98. https://doi.org/10.31854/1813-324x-2024-10-6-79-98.

Full text

Abstract:

Actuality. The current paper is the second part of the paper “Advance in Applied Cryptography Theory: Survey and Some New Results. Part 1. Key Cryptography” published in the journal PTU, n.4, 2024. It is devoted to such specific area of applied cryptography as keyless one (KC\ Actuality of the current paper consists in the fact that considered in it methods allow to provide a confidentiality of information transmission over public communication channels, either without any its encryption in advance, executing a natural properties of communication channels or executing conventional key cryptogr

APA, Harvard, Vancouver, ISO, and other styles

32

Romankov, V. A. "Diophantine cryptography over innite groups." Prikladnaya diskretnaya matematika, no. 16 (June 1, 2012): 15–42. http://dx.doi.org/10.17223/20710410/16/2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Routis, George, Panagiotis Dagas, and Ioanna Roussaki. "Enhancing Privacy in the Internet of Vehicles via Hyperelliptic Curve Cryptography." Electronics 13, no. 4 (2024): 730. http://dx.doi.org/10.3390/electronics13040730.

Full text

Abstract:

The Internet of Things (IoT) is a technological paradigm that has gained significant momentum the last decade and, among other features, enables the development of intelligent and interoperable device networks. In this respect, it has triggered the creation and evolution of vehicular ad-hoc networks (VANETs), which are initially implemented in order to guarantee the safety of drivers and the avoidance of traffic accidents. The drawback is that this fast evolution comes with serious concerns in terms of the privacy of users, while the population of attackers or entities that try to eavesdrop an

APA, Harvard, Vancouver, ISO, and other styles

34

Wood, Jonathan. "Banking on quantum cryptography." Materials Today 8, no. 7 (2005): 23. http://dx.doi.org/10.1016/s1369-7021(05)70982-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Shang, Wenchao. "Development of Number Theory and the Application in Cryptography." Theoretical and Natural Science 2, no. 1 (2023): 188–93. http://dx.doi.org/10.54254/2753-8818/2/20220139.

Full text

Abstract:

The primary focus of number theory, one of the fields of fundamental mathematics, is on the characteristics of integers. The development of cryptography also benefited greatly from the contributions of number theory. The paper primarily examines the evolution of number theory and its use in cryptography using a method of literature review. The study discovers that number theory development in the East reached a prosperous phase in the 1930s. From the 15th and 16th centuries through the 19th century, number theory flourished in the first. Number theory is still being developed, as demonstrated

APA, Harvard, Vancouver, ISO, and other styles

36

Zhou, Qian, Qing Ye, Chengzhe Lai, and Guangyue Kou. "Cryptography-Based Secure Underwater Acoustic Communication for UUVs: A Review." Electronics 14, no. 12 (2025): 2415. https://doi.org/10.3390/electronics14122415.

Full text

Abstract:

Unmanned Underwater Vehicles (UUVs) play an irreplaceable role in marine exploration, environmental monitoring, and national defense. The UUV depends on underwater acoustic communication (UAC) technology to enable reliable data transmission and support efficient collaboration. As the complexity of UUV missions has increased, secure UAC has become a critical element in ensuring successful mission execution. However, underwater channels are inherently characterized by high error rates, limited bandwidth, and signal interference. These problems severely limit the efficacy of traditional security

APA, Harvard, Vancouver, ISO, and other styles

37

Pambekti, G. B., and S. Rosdiana. "Constructing an optimum 4×4 S-Box with quasigroup." Journal of Physics: Conference Series 2106, no. 1 (2021): 012021. http://dx.doi.org/10.1088/1742-6596/2106/1/012021.

Full text

Abstract:

Abstract The efficiency of cryptographic algorithms is a problem that is often encountered. One solution of this problem is the use of lightweight cryptography. S-Box is one of the basic non-linear components in a cryptographic algorithm. Among all, 4 × 4 S-Box quasigroup is one kind of S-Box which can be used in lightweight cryptography, that formed by applying quasigroup transformation. The research described in this paper is the construction of the 4 × 4 S-Box using e-transformation of quasigroup as well as to know which leader pattern produces the highest number of optimum S-Box and mostly

APA, Harvard, Vancouver, ISO, and other styles

38

George, Dipu Jo, and Tony Thomas. "A Comparative Study of Symmetric Key Algorithms." International Journal of Computer Science and Mobile Computing 12, no. 6 (2023): 71–75. http://dx.doi.org/10.47760/ijcsmc.2023.v12i06.008.

Full text

Abstract:

Security is the prime issue while transferring information across a network. Therefore, the concept of encryption and decryption of information was introduced. Cryptography is a technique of converting plain information into encrypted text. This is done so that only legitimate users can access the data being sent. Cryptography can be mainly classified into two: 1) Symmetric key cryptography: Encryption and decryption are done using the same keys, and 2) Asymmetric key cryptography: Encryption and decryption of data is executed using private and public key. The symmetric key algorithm can be fu

APA, Harvard, Vancouver, ISO, and other styles

39

Ogiela, Lidia, and Makoto Takizawa. "Personalized cryptography in cognitive management." Soft Computing 21, no. 9 (2017): 2451–64. http://dx.doi.org/10.1007/s00500-017-2546-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Canteaut, Anne, Gohar Kyureghyan, Alexander Pott, and Felix Ulmer. "Editorial: Coding and Cryptography 2019." Designs, Codes and Cryptography 88, no. 9 (2020): 1699. http://dx.doi.org/10.1007/s10623-020-00791-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Baraka, Mohammed El, and Siham Ezzouak. "Efficient Algorithms for Isogeny Computation on Hyperelliptic Curves: Their Applications in Post-Quantum Cryptography." International journal of Computer Networks & Communications 17, no. 2 (2025): 93–112. https://doi.org/10.5121/ijcnc.2025.17206.

Full text

Abstract:

We present e cient algorithms for computing isogenies between hyperelliptic curves, leveraging higher genus curves to enhance cryptographic protocols in the post-quantum context. Our algorithms reduce the computational complexity of isogeny computations from O(g 4 ) to O(g 3 ) operations for genus 2 curves, achieving signi cant e ciency gains over traditional elliptic curve methods. Detailed pseudocode and comprehensive complexity analyses demonstrate these improvements both theoretically and empirically. Additionally, we provide a thorough security analysis, including proofs of resistance to

APA, Harvard, Vancouver, ISO, and other styles

42

Barbato, Netto Natália. "Efficient Algorithms for Isogeny Computation on Hyperelliptic Curves: Their Applications in Post-Quantum Cryptography." Efficient Algorithms for Isogeny Computation on Hyperelliptic Curves: Their Applications in Post-Quantum Cryptography 17, no. 2 (2025): 978–1. https://doi.org/10.5121/ijcnc.2025.17206.

Full text

Abstract:

We present efficient algorithms for computing isogenies between hyperelliptic curves, leveraging higher genus curves to enhance cryptographic protocols in the post-quantum context. Our algorithms reduce the computational complexity of isogeny computations from O(g4) to O(g3) operations for genus 2 curves, achieving significant efficiency gains over traditional elliptic curve methods. Detailed pseudocode and comprehensive complexity analyses demonstrate these improvements both theoretically and empirically. Additionally, we provide a thorough security analysis, including proofs of resistance to

APA, Harvard, Vancouver, ISO, and other styles

43

Glukhov, M. M. "SOME APPLICATIONS OF QUASIGROUPS IN CRYPTOGRAPHY." Prikladnaya diskretnaya matematika, no. 2 (December 1, 2008): 28–32. http://dx.doi.org/10.17223/20710410/2/7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Costello, Craig, Alyson Deines-Schartz, Kristin Lauter, and Tonghai Yang. "Constructing abelian surfaces for cryptography via Rosenhain invariants." LMS Journal of Computation and Mathematics 17, A (2014): 157–80. http://dx.doi.org/10.1112/s1461157014000370.

Full text

Abstract:

AbstractThis paper presents an algorithm to construct cryptographically strong genus $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}2$ curves and their Kummer surfaces via Rosenhain invariants and related Kummer parameters. The most common version of the complex multiplication (CM) algorithm for constructing cryptographic curves in genus 2 relies on the well-studied Igusa invariants and Mestre’s algorithm for reconstructing the c

APA, Harvard, Vancouver, ISO, and other styles

45

Troutman, Justin, and Vincent Rijmen. "Green Cryptography: Cleaner Engineering through Recycling, Part 2." IEEE Security & Privacy Magazine 7, no. 5 (2009): 64–65. http://dx.doi.org/10.1109/msp.2009.120.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Koutsos, Adrien. "Decidability of a Sound Set of Inference Rules for Computational Indistinguishability." ACM Transactions on Computational Logic 22, no. 1 (2021): 1–44. http://dx.doi.org/10.1145/3423169.

Full text

Abstract:

Computational indistinguishability is a key property in cryptography and verification of security protocols. Current tools for proving it rely on cryptographic game transformations. We follow Bana and Comon’s approach [7, 8], axiomatizing what an adversary cannot distinguish. We prove the decidability of a set of first-order axioms that are computationally sound, though incomplete, for protocols with a bounded number of sessions whose security is based on an <small>IND-CCA 2 </small> encryption scheme. Alternatively, our result can be viewed as the decidability of a family of crypt

APA, Harvard, Vancouver, ISO, and other styles

47

Lihananto, David, and Alz Danny Wowor. "Regenerasi Fungsi x²-9x-99 Dalam Pembangkit Bilangan Acak Berbasis CSRPNG Chaos." AITI 16, no. 2 (2020): 125–34. http://dx.doi.org/10.24246/aiti.v16i2.125-134.

Full text

Abstract:

This study examines whether the function f(x)=x2-9x-99 can be used as a key generator in cryptography. The quadratic function is regenerated using the fixed point iteration method into an iteration function. The distribution of digits to the output of iterative function to generate a number of chaos. Randomization testing uses run test and monobit testing. Followed by cryptographic testing to get the correlation between ciphertext and key which will be used as a decision whether the resulting key is random or not. Based on research that has been done iteration function xi = (xi-12-9xi-1-99)/9

APA, Harvard, Vancouver, ISO, and other styles

48

Reza Farahani, Mohammad, Mehdi Alaeiyan, Hayder Baqer Ameen, Xiujun Zhang, and Murat Cancan. "Applied Discrete Mathematics, Combinatorics, Cryptography, Computer Science and Computation." Journal of Discrete Mathematical Sciences and Cryptography 28, no. 2 (2025): iii—iv. https://doi.org/10.47974/jdmsc-28-2-foreword.

Full text

Abstract:

This special issue of “Applied Discrete Mathematics, Combinatorics, Cryptography, Computer Science and Computation”, presents a selection of cutting-edge research in the fields of cryptography, algebra, and module theory. These areas continue to evolve and provide foundational insights for modern technology, particularly in the realms of secure communication and mathematical modeling.

APA, Harvard, Vancouver, ISO, and other styles

49

Hong-Liang, Deng, and Fang Xi-Ming. "Quantum Cryptography with Entangled QuNits." Chinese Physics Letters 22, no. 2 (2005): 275–78. http://dx.doi.org/10.1088/0256-307x/22/2/003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Kshirsagar, Padmavati N., and S. Pratap singh. "A Review of Secure Pub Sub System." Asian Journal of Electrical Sciences 3, no. 2 (2014): 56–59. http://dx.doi.org/10.51983/ajes-2014.3.2.1921.

Full text

Abstract:

In content-based publish subscribe system authentication and confidentiality are most challenging security issues. This paper presents a novel way to provide confidentiality and authentications in a broker-less contentbased publish subscribe system. The authentication of publishers and subscribers is done using pairing based cryptography. Confidentiality of events is also ensured, by adapting the pairing-based cryptography mechanisms. This paper contributes; secure communication between publisher and subscribers. Publisher use public key to encrypt message, publisher send that message along wi

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!