Relevant bibliographies by topics / Cryptography

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Cryptography'

Author: Grafiati
Published: 4 June 2021
Last updated: 9 June 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic '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.

Journal articles on the topic "Cryptography"

1

Yan, Yuhan. "The Overview of Elliptic Curve Cryptography (ECC)." Journal of Physics: Conference Series 2386, no. 1 (December 1, 2022): 012019. http://dx.doi.org/10.1088/1742-6596/2386/1/012019.

Full text
Abstract:
Abstract Elliptic Curve Cryptography (ECC) is one of the strongest and most efficient cryptographic techniques in modern cryptography. This paper gives the following introduction: The introduction of cryptography’s development; the introduction of the elliptic curve; the principle of ECC; the horizontal comparison between ECC and other types of cryptography; the modern breakthrough of ECC; the applications of ECC; by using a method of literature review. The study’s findings indicate that this factor is responsible for the rapid historical development of cryptography, from the classical password to the leap to modern cryptography. Elliptic Curve Cryptography (ECC), as one of the most important modern cryptographies, is stronger than most other cryptographies both in terms of security and strength, because it uses an elliptic curve to construct and, at the same time, uses mathematical operations to encrypt and generate keys. At the same time, elliptic curve cryptography can continue to improve the speed and intensity with the improvement of accelerators, scalar multiplication, and the speed of order operation. The applications of the elliptic curve in ECDSA and SM2 are very efficient, which further illustrates the importance of elliptic curve cryptography.
APA, Harvard, Vancouver, ISO, and other styles
2

Goldreich, Oded. "Cryptography and cryptographic protocols." Distributed Computing 16, no. 2-3 (September 1, 2003): 177–99. http://dx.doi.org/10.1007/s00446-002-0077-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Adeyemi Afolayan Adesola, Awele Mary-rose Ilusanmi, and Peter Chimee. "A review of the cryptographic approaches to data security: The impact of quantum computing, evolving challenges and future solutions." World Journal of Advanced Research and Reviews 25, no. 2 (February 28, 2025): 1916–24. https://doi.org/10.30574/wjarr.2025.25.2.0434.

Full text
Abstract:
Cryptography plays a fundamental role in defending digital data against cyberthreats and emerging quantum computer capabilities. This review discusses core cryptographic techniques such as symmetric encryption, asymmetric encryption and cryptographic hashing, as well as advanced techniques like lattice-based cryptography , code-based cryptography, multi-variate polynomial cryptography and hash-based cryptography that are quantum resistant. The review share insight into the applications of cryptographic techniques in securing communications, encrypting databases, blockchain technology, and health care ensuring that the confidentiality and integrity of data is maintained while also addressing the current need for continuing resistance to future quantum attacks. Additionally, this review discusses critical problems in implementation, usability, and the threat that quantum computing poses to existing cryptographic techniques and offers insights into quantum resistant algorithms.
APA, Harvard, Vancouver, ISO, and other styles
4

Anilkumar, Chunduru, Bhavani Gorle, and Kinthali Sowmya. "A Secure Method of Communication in Conventional Cryptography using Quantum Key Distribution." Applied and Computational Engineering 8, no. 1 (August 1, 2023): 68–73. http://dx.doi.org/10.54254/2755-2721/8/20230083.

Full text
Abstract:
Security knowledge is one of the foremost challenges in the present day. When the topic is about Information security, the concept of cryptography comes into the picture. Every day, people and organizations use cryptography to maintain the confidentiality of their communications and data as well as to preserve their privacy. Today, one of the most successful methods used by businesses to protect their storage systems, whether at rest or in transit, is cryptography. Yet, cryptography is an effective technique to secure the data, the modern technology can break the cryptographic techniques. But some data encryption algorithms are several times stronger than today's conventional cryptography and can be constructed using quantum computing. They are "Quantum Cryptographic Algorithms ". Quantum cryptography uses the rules of quantum physics instead of classical encryption, which is based on mathematics, to protect and transmit data in a way that cannot be intercepted. Quantum key distribution is the greatest illustration of quantum cryptography and offers a safe solution to the key exchange issue. The proposed work deals with quantum cryptography and mainly focuses on how the quantum cryptographic algorithm is more secure than traditional cryptography.
APA, Harvard, Vancouver, ISO, and other styles
5

Donia Fadil Chalob, Rusul Hussein Hasan, and Suaad M. Saber. "A Comprehensive Review on Cryptography Algorithms: Methods and Comparative Analysis." International Journal of Scientific Research in Science, Engineering and Technology 12, no. 1 (February 18, 2025): 275–82. https://doi.org/10.32628/ijsrset25121171.

Full text
Abstract:
The evolution of cryptography has been crucial to preservation subtle information in the digital age. From early cipher algorithms implemented in earliest societies to recent cryptography methods, cryptography has developed alongside developments in computing field. The growing in cyber threats and the increase of comprehensive digital communications have highlighted the significance of selecting effective and robust cryptographic techniques. This article reviews various cryptography algorithms, containing symmetric key and asymmetric key cryptography, via evaluating them according to security asset, complexity, and execution speed. The main outcomes demonstrate the growing trust on elliptic curve cryptography outstanding its capability and small size, while highlighting the requirement for study in the post-quantum cryptographic field to address the threats rising from quantum computing. The comparative analysis shows a comprehensive understanding that combines classical cryptography algorithms with up-to-date approaches such as chaotic-based system and post-quantum cryptography, confirming that the study addresses the future of cryptography security in the aspect of emerging challenge like quantum computing.
APA, Harvard, Vancouver, ISO, and other styles
6

Bhoomika, P. Shetty, S. Darshan, B. R. Drakshayanamma, and Abdulhayan Sayed. "Review on Quantum Key Distribution." Journal of Optical Communication Electronics 5, no. 2 (May 1, 2019): 1–4. https://doi.org/10.5281/zenodo.2656087.

Full text
Abstract:
<em>There have been tremendous developments in the field of cryptography. Quantum computers is one among them. Solving complex mathematical calculations are made easy using quantum computers. Introducing quantum physics into cryptography led to growth of quantum cryptography. Quantum cryptography is a technique of using photons to generate a cryptographic key and transmit it to a receiver using a suitable communication channel. Quantum cryptography uses quantum mechanical principles such as Heisenberg Uncertainty principle and photon polarisation principle to perform cryptographic tasks towards providing an effective security system. This study describes on to generate a key which is then converted into Quantum bits (Qubits) and send to the receiver securely.</em>
APA, Harvard, Vancouver, ISO, and other styles
7

Wei, Yuchong. "A Survey of Lattice Cryptography." Applied and Computational Engineering 135, no. 1 (February 27, 2025): 210–16. https://doi.org/10.54254/2755-2721/2025.21190.

Full text
Abstract:
Lattice cryptography has become one of the focal points in the era of quantum computing development. RSA and ECC, traditional public key cryptosystems, may become insecure in the face of quantum computers. In contrast, lattice cryptography is considered a potential solution for cryptographic security in the quantum computing age due to its inherent mathematical problems that require the use of quantum computers to solve. Moreover, lattice cryptographic algorithms can achieve efficient encryption and decryption processes and support a variety of cryptographic constructions, including encryption, signatures, and fully homomorphic encryption (FHE). With its high efficiency, multifunctionality, and high security, lattice cryptography has applications in various fields such as finance, e-commerce, government agencies, military, and network communications. It has also become one of the top contenders for the post-quantum cryptographic algorithm standards that have been recognized by the National Institute of Standards and Technology (NIST). This paper discusses the main contributions of lattice cryptography to society and its potential future development directions, as well as the challenges it may face and potential solutions. This thesis elaborates on lattice-based cryptography and comprehensively discusses the key technologies of lattice cryptography, its applications, security analysis, performance evaluation, and the latest progress.
APA, Harvard, Vancouver, ISO, and other styles
8

Pasupuleti, Murali Krishna. "Algebraic Geometry Methods in Cryptographic Protocol Design." International Journal of Academic and Industrial Research Innovations(IJAIRI) 05, no. 04 (April 21, 2025): 296–304. https://doi.org/10.62311/nesx/rp2525.

Full text
Abstract:
Abstract: Algebraic geometry offers a powerful and elegant mathematical framework for the design and analysis of modern cryptographic protocols. This research paper investigates the application of algebraic geometry methods—such as elliptic curves, abelian varieties, and projective algebraic structures—in enhancing the security, efficiency, and scalability of cryptographic systems. By bridging advanced algebraic structures with cryptographic primitives, the study demonstrates how algebraic geometry enables the construction of secure public key protocols, zero-knowledge proofs, and post-quantum resilient schemes. Through theoretical modeling, performance benchmarking, and comparative analysis with classical cryptographic approaches, the paper illustrates the advantages of algebraic geometry in terms of computational hardness assumptions, structural integrity, and potential for innovation in secure communications. The findings contribute to the evolving landscape of cryptography by positioning algebraic geometry as a foundational tool in next-generation cryptographic protocol design. Keywords: algebraic geometry, cryptographic protocols, elliptic curves, public key cryptography, post-quantum cryptography, projective varieties, zero-knowledge proofs, secure communication, mathematical cryptography, abelian varieties
APA, Harvard, Vancouver, ISO, and other styles
9

Rusetskaya, Irina A. "CRYPTOGRAPHY. FROM THE PAST TO THE FUTURE." RSUH/RGGU Bulletin. Series Information Science. Information Security. Mathematics, no. 4 (2021): 47–57. http://dx.doi.org/10.28995/2686-679x-2021-4-47-57.

Full text
Abstract:
The article is devoted to the analysis of modern trends in the development of cryptography, which are related to the issues of cryptography of the past and are reflected in the prospects for the development of cryptography in the future. New trends in the development of cryptography that are relevant in recent decades are highlighted, the main ones of which include: awareness of the mathematical nature of data encryption problems, the rapid increase in the volume of processed and encrypted information that is distributed among a large unlimited circle of users of the modern data transmission devices, practical and theoretical interest of user s in cryptography. It analyzes the continuity of the issues facing cryptography. Among such issues there are: an importance of the human factor in the use of any cryptographic system, the traditional participation of the state in the cryptography development, as well as the theoretical substantiation of ideas of the cryptographic data protection, generalizing the practical experience of using encryption. The author also analyzes the main tasks of cryptography, which include identification, authentication, maintaining the integrity, confidentiality and availability of information during its transfer and storage, emphasizing the need to solve them within the framework of the design and implementation of the complex security systems. Using the development of quantum cryptography as an example, the article emphasizes that the development of new approaches to the cryptographic data protection traditionally leads to the emergence of new vulnerability factors, which means that the traditional issue of cryptography is also to stay ahead of potential attackers.
APA, Harvard, Vancouver, ISO, and other styles
10

Goyal, Rohit. "Quantum Cryptography: Secure Communication Beyond Classical Limits." Journal of Quantum Science and Technology 1, no. 1 (March 31, 2024): 1–5. http://dx.doi.org/10.36676/jqst.v1.i1.01.

Full text
Abstract:
Quantum cryptography promises secure communication protocols that surpass the limitations of classical cryptography. By leveraging the principles of quantum mechanics, particularly the phenomenon of quantum entanglement and the uncertainty principle, quantum cryptography protocols offer provable security guarantees against eavesdropping attacks. In this paper, we provide an overview of quantum cryptography, discussing its theoretical foundations, key protocols such as quantum key distribution (QKD), and experimental implementations. We highlight the advantages of quantum cryptography over classical cryptographic techniques and explore its potential applications in secure communication networks, financial transactions, and data privacy. Furthermore, we discuss ongoing research efforts and challenges in the practical deployment of quantum cryptography systems, including the development of robust quantum hardware and the integration of quantum cryptographic protocols into existing communication infrastructures. Overall, quantum cryptography holds great promise for enabling secure communication channels that are resilient to quantum attacks, paving the way for a new era of ultra-secure information exchange.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Cryptography"

1

Poschmann, Axel York. "Lightweight cryptography cryptographic engineering for a pervasive world." Berlin Bochum Dülmen London Paris Europ. Univ.-Verl, 2009. http://d-nb.info/996578153/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Almeida, Braga Daniel de. "Cryptography in the wild : the security of cryptographic implementations." Thesis, Rennes 1, 2022. http://www.theses.fr/2022REN1S067.

Full text
Abstract:
Les attaques par canaux auxiliaire sont redoutables face aux implémentations cryptographiques. Malgré les attaques passées, et la prolifération d'outils de vérification, ces attaques affectent encore de nombreuses implémentations. Dans ce manuscrit, nous abordons deux aspects de cette problématique, centrés autour de l'attaque et de la défense. Nous avons dévoilé plusieurs attaques par canaux auxiliaires microarchitecturaux sur des implémentations de protocoles PAKE. En particulier, nous avons exposé des attaques sur Dragonfly, utilisé dans la nouvelle norme Wi-Fi WPA3, et SRP, déployé dans de nombreux logiciel tels que ProtonMail ou Apple HomeKit. Nous avons également exploré le manque d'utilisation par les développeurs d'outil permettant de détecter de telles attaques. Nous avons questionné des personnes impliqués dans différents projets cryptographiques afin d'identifier l'origine de ce manque. De leur réponses, nous avons émis des recommandations. Enfin, dans l'optique de mettre fin à la spirale d'attaques-correction sur les implémentations de Dragonfly, nous avons fournis une implémentation formellement vérifiée de la couche cryptographique du protocole, dont l'exécution est indépendante des secrets<br>Side-channel attacks are daunting for cryptographic implementations. Despite past attacks, and the proliferation of verification tools, these attacks still affect many implementations. In this manuscript, we address two aspects of this problem, centered around attack and defense. We unveil several microarchitectural side-channel attacks on implementations of PAKE protocols. In particular, we exposed attacks on Dragonfly, used in the new Wi-Fi standard WPA3, and SRP, deployed in many software such as ProtonMail or Apple HomeKit. We also explored the lack of use by developers of tools to detect such attacks. We questioned developers from various cryptographic projects to identify the origin of this lack. From their answers, we issued recommendations. Finally, in order to stop the spiral of attack-patch on Dragonfly implementations, we provide a formally verified implementation of the cryptographic layer of the protocol, whose execution is secret-independent
APA, Harvard, Vancouver, ISO, and other styles
3

Yerushalmi, Yoav. "Incremental cryptography." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42789.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.<br>Includes bibliographical references (leaves 147-148).<br>by Yoav Yerushalmi.<br>M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
4

Shamonin, K. E. "Quantum cryptography." Thesis, Sumy State University, 2018. http://essuir.sumdu.edu.ua/handle/123456789/66837.

Full text
Abstract:
To advance most popular encryption algorithms such as public-key encryption and signature-based schemes, methods of quantum cryptography can be used. The main advantage of quantum cryptography is the fact it cannot be broken by any non-quantum computers and eavesdropping is impossible in quantum key distribution. Fundamental quantum mechanics is used in quantum key distribution to guarantee the safety of data transmitted. It is based on entangled pairs of photons in E91 protocol or photon polarization states in BB84 protocol.
APA, Harvard, Vancouver, ISO, and other styles
5

Lopez, Samuel. "MODERN CRYPTOGRAPHY." CSUSB ScholarWorks, 2018. https://scholarworks.lib.csusb.edu/etd/729.

Full text
Abstract:
We live in an age where we willingly provide our social security number, credit card information, home address and countless other sensitive information over the Internet. Whether you are buying a phone case from Amazon, sending in an on-line job application, or logging into your on-line bank account, you trust that the sensitive data you enter is secure. As our technology and computing power become more sophisticated, so do the tools used by potential hackers to our information. In this paper, the underlying mathematics within ciphers will be looked at to understand the security of modern ciphers. An extremely important algorithm in today's practice is the Advanced Encryption Standard (AES), which is used by our very own National Security Agency (NSA) for data up to TOP SECRET. Another frequently used cipher is the RSA cryptosystem. Its security is based on the concept of prime factorization, and the fact that it is a hard problem to prime factorize huge numbers, numbers on the scale of 2^{2048} or larger. Cryptanalysis, the study of breaking ciphers, will also be studied in this paper. Understanding effective attacks leads to understanding the construction of these very secure ciphers.
APA, Harvard, Vancouver, ISO, and other styles
6

Minaud, Brice. "Analyse de primitives cryptographiques récentes." Thesis, Rennes 1, 2016. http://www.theses.fr/2016REN1S066/document.

Full text
Abstract:
Dans cette thèse, nous nous intéressons à la sécurité de quelques primitives cryptographiques récentes, d’abord symétriques puis asymétriques, en passant par le modèle en boîte blanche, qui est à certains égards intermédiaire. Dans un premier temps, nous montrons l’existence de fonctions linéaires non triviales commutant avec la fonction de tour de certains chiffrements par bloc, dont découlent des attaques par auto-similarité et sous-espace invariant. Nous nous intéressons ensuite à la cryptanalyse de la structure ASASA, où deux couches non linéaires S sont imbriquées dans des couches affines A. Notre cryptanalyse structurelle permet de casser des instances de chiffrement symétrique, multivarié et en boîte blanche. En nous concentrant sur le modèle d’incompressibilité en boîte blanche, nous montrons ensuite comment réaliser un chiffrement par bloc et un générateur de clef efficaces dont la sécurité est prouvable. Finalement, du côté purement asymétrique, nous décrivons une attaque polynomiale contre une construction récente d’application multilinéaire<br>In this thesis, we study the security of some recent cryptographic primitives, both symmetric and asymmetric. Along the way we also consider white-box primitives, which may be regarded as a middle ground between symmetric and asymmetric cryptography. We begin by showing the existence of non-trivial linear maps commuting with the round function of some recent block cipher designs, which give rise to self-similarity and invariant subspace attacks. We then move on to the structural cryptanalysis of ASASA schemes, where nonlinear layers S alternate with affine layers A. Our structural cryptanalysis applies to symmetric, multivariate, as well as white-box instances. Focusing on the white-box model of incompressibility, we then build an efficient block cipher and key generator that offer provable security guarantees. Finally, on the purely asymmetric side, we describe a polynomial attack against a recent multilinear map proposal
APA, Harvard, Vancouver, ISO, and other styles
7

PRIYADHARSHINI, THIRUTHUVADOSS ANGELINE. "Comparison and Performance Evaluation of Modern Cryptography and DNA Cryptography." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-120103.

Full text
Abstract:
In this paper, a new cryptographic method called DNA cryptography and the already existing methods of modern cryptography are studied, implemented and results are obtained. Both these cryptographic method’s results are compared and analyzed to find out the better approach among the two methods. The comparison is done in the main aspects of process running time, key size, computational complexity and cryptographic strength. And the analysis is made to find the ways these above mentioned parameters are enhancing the respective cryptographic methods and the performance is evaluated. For comparison the Triple Data Encryption Algorithm (TDEA) from the modern methods and the DNA hybridization and the chromosomes DNA indexing methods from the DNA cryptography methods are implemented and analyzed. These intended methods are dependent on the main principles of mathematical calculations and bio molecular computations. The Triple DES algorithm uses three keys. In this method the DES block cipher algorithm is utilized three times to each different block of the input data to obtain the encrypted text. And then the DES block cipher decryption algorithm is applied to the obtained cipher text three times using the same three keys and the original message is obtained. The key size is increased in Triple DES more than that of the DES which makes the algorithm more secured. In the DNA hybridization method, the original message which is referred as plain text is converted in the form of binary. This binary form of data is then compared with the randomly generated OTP key in the DNA form and the encrypted message is obtained. This obtained encrypted message is also in the form of DNA. The decryption message is carried out in reverse using the encrypted data and the OTP key and the original message is retrieved. In the DNA indexing method, the plain text which is the original message is converted to the binary form and again to the DNA form. The OTP keys are generated randomly from the public database. This OTP key and the DNA form of the plain text are compared and a random index is generated, which is the encrypted data. Decryption process is carried out in the opposite order to obtain the original plain text message. Finally, the results of DNA cryptography are compared with that of the results obtained in Triple DES algorithm and the performance is evaluated to find out the most secured and less time consuming technique. The proposed work is implemented using bio informatics toolbox in MATLAB.
APA, Harvard, Vancouver, ISO, and other styles
8

Nyman, Ellinor. "Cryptography : A study of modern cryptography and its mathematical methods." Thesis, Uppsala universitet, Analys och sannolikhetsteori, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-447460.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Idrees, Zunera. "Elliptic Curves Cryptography." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-17544.

Full text
Abstract:
In the thesis we study the elliptic curves and its use in cryptography. Elliptic curvesencompasses a vast area of mathematics. Elliptic curves have basics in group theory andnumber theory. The points on elliptic curve forms a group under the operation of addition.We study the structure of this group. We describe Hasse’s theorem to estimate the numberof points on the curve. We also discuss that the elliptic curve group may or may not becyclic over finite fields. Elliptic curves have applications in cryptography, we describe theapplication of elliptic curves for discrete logarithm problem and ElGamal cryptosystem.
APA, Harvard, Vancouver, ISO, and other styles
10

Roe, Michael Robert. "Cryptography and evidence." Thesis, University of Cambridge, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.627396.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Cryptography"

1

Stinson, Douglas R., and Maura B. Paterson. Cryptography. Fourth edition. | Boca Raton : CRC Press, Taylor & Francis: Chapman and Hall/CRC, 2018. http://dx.doi.org/10.1201/9781315282497.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rubinstein-Salzedo, Simon. Cryptography. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94818-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Slayton, Rebecca, ed. Democratizing Cryptography. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3549993.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Franklin, Matthew, ed. Financial Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48390-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Omondi, Amos R. Cryptography Arithmetic. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-34142-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Easttom, William. Modern Cryptography. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-63115-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hirschfeld, Rafael, ed. Financial Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63594-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hirchfeld, Rafael, ed. Financial Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055468.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ferguson, Niels, Bruce Schneier, and Tadayoshi Kohno. Cryptography Engineering. Indianapolis, Indiana: Wiley Publishing, Inc., 2015. http://dx.doi.org/10.1002/9781118722367.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Blaze, Matt, ed. Financial Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-36504-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Cryptography"

1

Hofheinz, Dennis, and Eike Kiltz. "Scalable Cryptography." In Lecture Notes in Computer Science, 169–78. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-21534-6_9.

Full text
Abstract:
AbstractIn our modern digital society, cryptography is vital to protect the secrecy and integrity of transmitted and stored information. Settings like digital commerce, electronic banking, or simply private email communication already rely on encryption and signature schemes.However, today’s cryptographic schemes do not scale well, and thus are not suited for the increasingly large sets of data they are used on. For instance, the security guarantees currently known for RSA encryption—one of the most commonly used type of public-key encryption scheme—degrade linearly in the number of users and ciphertexts. Hence, larger settings (such as cloud computing, or simply the scenario of encrypting all existing email traffic) may enable new and more efficient attacks. To maintain a reasonable level of security in larger scenarios, RSA keylengths must be chosen significantly larger, and the scheme becomes very inefficient. Besides, a switch in RSA keylengths requires an update of the whole public key infrastructure, an impossibility in truly large scenarios. Even worse, when the scenario grows beyond an initially anticipated size, we may lose all security guarantees.This problematic is the motivation for our project “Scalable Cryptography”, which aims at offering a toolbox of cryptographic schemes that are suitable for huge sets of data. In this overview, we summarize the approach, and the main findings of our project. We give a number of settings in which it is possible to indeed provide scalable cryptographic building blocks. For instance, we survey our work on the construction of scalable public-key encryption schemes (a central cryptographic building block that helps secure communication), but also briefly mention other settings such as “reconfigurable cryptography”. We also provide first results on scalable quantum-resistant cryptography, i.e., scalable cryptographic schemes that remain secure even in the presence of a quantum computer.
APA, Harvard, Vancouver, ISO, and other styles
2

Buchmann, Johannes. "Sustainable Cryptography." In International Symposium on Mathematics, Quantum Theory, and Cryptography, 3. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-5191-8_1.

Full text
Abstract:
Abstract Cryptography is a fundamental tool for cybersecurity and privacy which must be protected for long periods of time. However, the security of most cryptographic algorithms relies on complexity assumptions that may become invalid over time. In this talk I discuss how sustainable cybersecurity and privacy can be achieved in this situation.
APA, Harvard, Vancouver, ISO, and other styles
3

Hardy, Yorick, and Willi-Hans Steeb. "Cryptography." In Classical and Quantum Computing, 215–28. Basel: Birkhäuser Basel, 2001. http://dx.doi.org/10.1007/978-3-0348-8366-5_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wallis, W. D. "Cryptography." In Mathematics in the Real World, 157–67. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8529-2_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

O’Regan, Gerard. "Cryptography." In Texts in Computer Science, 155–70. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44561-8_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Koblitz, Neal. "Cryptography." In Mathematics Unlimited — 2001 and Beyond, 749–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-56478-9_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kizza, Joseph Migga. "Cryptography." In Guide to Computer Network Security, 225–48. London: Springer London, 2015. http://dx.doi.org/10.1007/978-1-4471-6654-2_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Corsini, Piergiulio, and Violeta Leoreanu. "Cryptography." In Applications of Hyperstructure Theory, 247–56. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4757-3714-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hansmann, Uwe, Martin S. Nicklous, Thomas Schäck, and Frank Seliger. "Cryptography." In Smart Card Application Development Using Java, 49–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-642-98052-7_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Norberg, Scott. "Cryptography." In Advanced ASP.NET Core 3 Security, 57–101. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-6014-2_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Cryptography"

1

Singh, Pankaj, Ashutosh Srivastava, Divya Srivastava, Shivam, Madhushi Verma, and Vaishnavi Srivastava. "An Overview of Quantum Cryptography Evolution From Classical Cryptography." In 2025 International Conference on Cognitive Computing in Engineering, Communications, Sciences and Biomedical Health Informatics (IC3ECSBHI), 1–6. IEEE, 2025. https://doi.org/10.1109/ic3ecsbhi63591.2025.10990566.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Seeburrun, Koshik, Karel Veerabudren, Mrinal Sharma, and Girish Bekaroo. "Demystifying Cryptography: An Experimental Study of Classical and Quantum Cryptography." In 2024 5th International Conference on Emerging Trends in Electrical, Electronic and Communications Engineering (ELECOM), 1–7. IEEE, 2024. https://doi.org/10.1109/elecom63163.2024.10892169.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ishaq, Muhammad, and Bushra Al-Anesi. "Quantum Cryptography and Post-Quantum Security: Safeguarding Cryptographic Protocols Against Quantum Threats." In 2025 2nd International Conference on Advanced Innovations in Smart Cities (ICAISC), 1–7. IEEE, 2025. https://doi.org/10.1109/icaisc64594.2025.10959635.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jovanović, Boriša, Ivan Tot, and Silvana Ilić. "Contemporary cryptography: Recent achievement and research perspectives." In 11th International Scientific Conference on Defensive Technologies - OTEX 2024, 376–80. Military Technical Institute, Belgrade, 2024. http://dx.doi.org/10.5937/oteh24067j.

Full text
Abstract:
In modern times, cryptography has been considered as a branch of both mathematics and computer science, and is tightly related to information security. With the accelerated progress of the Internet and the increase of digital communication, the need for stronger and more effective methods of cryptographic protection has become more pronounced. With the rapid increase in computing power, the potential for breaking cryptographic algorithms also increases. This fact in modern cryptography creates a need for stronger and more advanced cryptographic algorithms. One development direction of modern cryptography is post-quantum cryptography, which can withstand the attacks of quantum computers. In addition to the potential threats to traditional cryptographic techniques, there is also the potential to integrate artificial intelligence tools with the process of developing and implementing cryptographic algorithms. For instance, advanced machine learning algorithms can be used to identify potential vulnerabilities in cryptographic systems and algorithms and improve their security. As technology continues to evolve, new techniques are being developed in the field of cryptography in order to stay one step ahead of new threats. In this paper, the current achievements of modern cryptography are explored and the research perspectives in this field are explained.
APA, Harvard, Vancouver, ISO, and other styles
5

Slutsky, Boris A., R. Rao, L. Tancevski, P. C. Sun, and Y. Fainman. "Information Leakage Estimates in Quantum Cryptography." In Optics in Computing. Washington, D.C.: Optica Publishing Group, 1997. http://dx.doi.org/10.1364/oc.1997.owc.2.

Full text
Abstract:
Quantum cryptography permits two parties, who share no secret information initially, to communicate over an open channel and establish between themselves a shared secret sequence of bits [1]. Quantum cryptography is provably secure against an eavesdropping attack because any attempt by a third party to monitor a quantum cryptographic channel reveals itself through transmission errors between the legitimate users.
APA, Harvard, Vancouver, ISO, and other styles
6

Faz-Hernández, Armando, and Julio López. "High-Performance Elliptic Curve Cryptography: A SIMD Approach to Modern Curves." In Concurso de Teses e Dissertações. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/ctd.2023.230156.

Full text
Abstract:
Cryptography based on elliptic curves is endowed with efficient methods for public-key cryptography. Recent research has shown the superiority of the Montgomery and Edwards curves over the Weierstrass curves as they require fewer arithmetic operations. Using these modern curves has, however, introduced several challenges to the cryptographic algorithm’s design, opening up new opportunities for optimization. Our main objective is to propose algorithmic optimizations and implementation techniques for cryptographic algorithms based on elliptic curves. In order to speed up the execution of these algorithms, our approach relies on the use of extensions to the instruction set architecture. In addition to those specific for cryptography, we use extensions that follow the Single Instruction, Multiple Data (SIMD) parallel computing paradigm. In this model, the processor executes the same operation over a set of data in parallel. We investigated how to apply SIMD to the implementation of elliptic curve algorithms. As part of our contributions, we design parallel algorithms for prime field and elliptic curve arithmetic. We also design a new three-point ladder algorithm for the scalar multiplication P + kQ, and a faster formula for calculating 3P on Montgomery curves. These algorithms have found applicability in isogeny-based cryptography. Using SIMD extensions such as SSE, AVX, and AVX2, we develop optimized implementations of the following cryptographic algorithms: X25519, X448, SIDH, ECDH, ECDSA, EdDSA, and qDSA. Performance benchmarks show that these implementations are faster than existing implementations in the state of the art. Our study confirms that using extensions to the instruction set architecture is an effective tool for optimizing implementations of cryptographic algorithms based on elliptic curves. May this be an incentive not only for those seeking to speed up programs in general but also for computer manufacturers to include more advanced extensions that support the increasing demand for cryptography.
APA, Harvard, Vancouver, ISO, and other styles
7

Faz-Hernandez, Armando, and Julio López. "High-Performance Elliptic Curve Cryptography: A SIMD Approach to Modern Curves." In Anais Estendidos do Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais, 49–56. Sociedade Brasileira de Computação - SBC, 2024. http://dx.doi.org/10.5753/sbseg_estendido.2024.241959.

Full text
Abstract:
Cryptography based on elliptic curves is endowed with efficient methods for public-key cryptography. Recent research has shown the superiority of the Montgomery and Edwards curves over the Weierstrass curves as they require fewer arithmetic operations. Using these modern curves has, however, introduced several challenges to the cryptographic algorithm’s design, opening up new opportunities for optimization. Our main objective is to propose algorithmic optimizations and implementation techniques for cryptographic algorithms based on elliptic curves. In order to speed up the execution of these algorithms, our approach relies on the use of extensions to the instruction set architecture. In addition to those specific for cryptography, we use extensions that follow the Single Instruction, Multiple Data (SIMD) parallel computing paradigm. In this model, the processor executes the same operation over a set of data in parallel. We investigated how to apply SIMD to the implementation of elliptic curve algorithms. As part of our contributions, we design parallel algorithms for prime field and elliptic curve arithmetic. We also design a new three-point ladder algorithm for the scalar multiplication P + kQ, and a faster formula for calculating 3P on Montgomery curves. These algorithms have found applicability in isogeny-based cryptography. Using SIMD extensions such as SSE, AVX, and AVX2, we develop optimized implementations of the following cryptographic algorithms: X25519, X448, SIDH, ECDH, ECDSA, EdDSA, and qDSA. Performance benchmarks show that these implementations are faster than existing implementations in the state of the art. Our study confirms that using extensions to the instruction set architecture is an effective tool for optimizing implementations of cryptographic algorithms based on elliptic curves. May this be an incentive not only for those seeking to speed up programs in general but also for computer manufacturers to include more advanced extensions that support the increasing demand for cryptography.
APA, Harvard, Vancouver, ISO, and other styles
8

Duta, Cristinaloredana, and Laura Gheorghe. "ELEARNING FRAMEWORK FOR UNDERSTANDING CRYPTOGRAPHY AT ALL LEVELS." In eLSE 2015. Carol I National Defence University Publishing House, 2015. http://dx.doi.org/10.12753/2066-026x-15-026.

Full text
Abstract:
Nowadays security is needed in order to transmit confidential information over the network, which means that is required in everyday life of humanity. The best way to ensure data confidentiality is by using cryptography, which is considered an essential component in many modern applications. In this context, it is important for developers to understand how to efficiently and correctly implement security mechanisms and also how to apply them properly. In this paper, we present an eLearning platform for teachers, students, developers and other users interested in cryptography. The application allows users to experiment with cryptographic algorithms, and to learn how to implement, apply and evaluate cryptographic concepts. The eLearning framework encourages users to develop their own cryptographic algorithms and to verify them, by including a wide variety of cryptographic mechanisms for symmetric and asymmetric algorithms and many analysis tools. For instance, it allows users to analyze the randomness of the generated data, to determine the performance in terms of speed and throughput, and to evaluate the cryptographic properties of substitution and permutation functions. Moreover, the framework allows the user to test all the cryptographic algorithms that are included and to add new cryptographic algorithms for testing, without requiring the application to be modified. Additionally, it provides flexibility, which means that the existing or new algorithms can be fully parameterized by the users. Also the cryptographic eLearning platform allows users to track the execution of complex algorithms on real world examples in a step by step detailed view. It is an easy-to-use application, which offers a consistent and rich user experience.
APA, Harvard, Vancouver, ISO, and other styles
9

Лацин, Семен Михайлович, and Наталья Александровна Борсук. "ANALYSIS OF ELLIPTICAL CRYPTOGRAPHY ON THE EXAMPLE OF THE BITCOIN BLOCKCHAIN." In Методики фундаментальных и прикладных научных исследований: сборник статей всероссийской научной конференции (Санкт-Петербург, Декабрь 2022). Crossref, 2023. http://dx.doi.org/10.37539/221223.2022.83.11.008.

Full text
Abstract:
Криптография на основе эллиптических кривых была недавней областью исследований в криптографии. Она обеспечивает более высокий уровень безопасности с меньшим размером ключа по сравнению с другими методами шифрования. В статье рассмотрен принцип работы эллиптической криптографии. Elliptic curve cryptography has been a recent research area in the field of cryptography. It provides higher level of security with lesser key size compared to other cryptographic techniques. The article considers the principle of operation of elliptic curve cryptography.
APA, Harvard, Vancouver, ISO, and other styles
10

AXENTI, Ilie, and Olga CERBU. "Criptografia vizuală." In Materialele Conferinţei Ştiinţifice Internaţionale "Abordări inter/transdisciplinare în predarea ştiinţelor reale, (concept STEAM)", 249–53. Ion Creangă Pedagogical State University, 2024. https://doi.org/10.46727/c.steam-2024.p249-253.

Full text
Abstract:
Visual Cryptography (VC) is a cryptographic methodology that enables the encryption of visual information, such as text, images, etc., so that decryption can be performed by the human visual system without the assistance of computers. The purpose of this study is to provide readers with an overview of the first method of visual cryptography, along with various methods developed and proposed over time. This paper also offers a study of applications based on the concept of Visual Cryptography.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Cryptography"

1

Nechvatal, James. Public-key cryptography. Gaithersburg, MD: National Institute of Standards and Technology, 1991. http://dx.doi.org/10.6028/nist.sp.800-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

de Abreu, Jonas, and Mariana Cunha e Melo. Extending Pix: An approach to offline Dynamic QR Code generation. Center for Technology and Public Interest, SL, April 2023. http://dx.doi.org/10.59262/9qu6ex.

Full text
Abstract:
The Pix Dynamic QR Code URI can be extended to allow for offline QR Code generation. The proposed solution involves generating URIs that can be used as a vehicle to transmit information from the client to the server, allowing the payee to generate their own URIs. The document also goes into detail about URI properties, encoding, and cryptography. The proposed design balances tradeoffs between the amount of data that can be transmitted and cryptographic guarantees, and uses commonly available cryptographic primitives to reduce implementation costs.
APA, Harvard, Vancouver, ISO, and other styles
3

Jonsson, J., and B. Kaliski. Public-Key Cryptography Standards (PKCS) #1: RSA Cryptography Specifications Version 2.1. RFC Editor, February 2003. http://dx.doi.org/10.17487/rfc3447.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Mouha, Nicky. Review of the Advanced Encryption Standard. National Institute of Standards and Technology, July 2021. http://dx.doi.org/10.6028/nist.ir.8319.

Full text
Abstract:
The field of cryptography continues to advance at a very rapid pace, leading to new insights that may impact the security properties of cryptographic algorithms. The Crypto Publication Review Board ("the Board") has been established to identify publications to be reviewed. This report subjects the first standard to the review process: Federal Information Processing Standard (FIPS) 197, which defines the Advanced Encryption Standard (AES).
APA, Harvard, Vancouver, ISO, and other styles
5

Pasupuleti, Murali Krishna. Quantum Intelligence: Machine Learning Algorithms for Secure Quantum Networks. National Education Services, March 2025. https://doi.org/10.62311/nesx/rr925.

Full text
Abstract:
Abstract: As quantum computing and quantum communication technologies advance, securing quantum networks against emerging cyber threats has become a critical challenge. Traditional cryptographic methods are vulnerable to quantum attacks, necessitating the development of AI-driven security solutions. This research explores the integration of machine learning (ML) algorithms with quantum cryptographic frameworks to enhance Quantum Key Distribution (QKD), post-quantum cryptography (PQC), and real-time threat detection. AI-powered quantum security mechanisms, including neural network-based quantum error correction (QEC), deep learning-driven anomaly detection, and reinforcement learning for adaptive encryption, provide a self-learning security model for quantum communication systems. The study also examines quantum blockchain integration, AI-optimized quantum network traffic management, and secure quantum biometric authentication as emerging trends in AI-enhanced quantum cybersecurity. Additionally, it evaluates industry adoption, policy considerations, and global quantum security initiatives across China, the US, the EU, and India. By addressing scalability, automation, and real-time quantum security monitoring, this research provides a roadmap for leveraging AI in next-generation secure quantum networks to enable fault-tolerant, self-healing cybersecurity frameworks. Keywords: Quantum intelligence, machine learning, secure quantum networks, AI-driven quantum cryptography, quantum key distribution, post-quantum cryptography, neural network-based quantum error correction, deep learning anomaly detection, reinforcement learning in quantum security, AI-driven quantum authentication, quantum blockchain security, quantum biometric authentication, quantum-enhanced AI cybersecurity, real-time quantum security monitoring, AI-optimized quantum routing, scalable quantum encryption, quantum cybersecurity policy, AI-powered post-quantum security, self-healing quantum networks, AI-driven quantum forensics.
APA, Harvard, Vancouver, ISO, and other styles
6

Blake-Wilson, S., D. Brown, and P. Lambert. Use of Elliptic Curve Cryptography (ECC) Algorithms in Cryptographic Message Syntax (CMS). RFC Editor, April 2002. http://dx.doi.org/10.17487/rfc3278.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Turner, S., and D. Brown. Use of Elliptic Curve Cryptography (ECC) Algorithms in Cryptographic Message Syntax (CMS). RFC Editor, January 2010. http://dx.doi.org/10.17487/rfc5753.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Draelos, Timothy John, Mark Dolan Torgerson, William Douglas Neumann, Donald R. Gallup, Michael Joseph Collins, and Cheryl Lynn Beaver. Hybrid cryptography key management. Office of Scientific and Technical Information (OSTI), November 2003. http://dx.doi.org/10.2172/918318.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

McKay, Kerry A., Larry Bassham, Meltem Sonmez Turan, and Nicky Mouha. Report on lightweight cryptography. Gaithersburg, MD: National Institute of Standards and Technology, March 2017. http://dx.doi.org/10.6028/nist.ir.8114.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Torgerson, Mark Dolan, Timothy John Draelos, Richard Crabtree Schroeppel, Russell D. Miller, and William Erik Anderson. Small circuits for cryptography. Office of Scientific and Technical Information (OSTI), October 2005. http://dx.doi.org/10.2172/875977.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Cryptography' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography