Academic literature on the topic 'Cryptographic key generation'

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 'Cryptographic key generation.'

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 "Cryptographic key generation"

1

Nurullaev, Mirkhon Mukhammadovich, and Rakhmatillo Djuraevich Aloev. "Working with cryptographic key information." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 1 (2023): 911–19. https://doi.org/10.11591/ijece.v13i1.pp911-919.

Full text
Abstract:
It is important to create a cryptographic system such that the encryption system does not depend on the secret storage of the algorithm that is part of it, but only on the private key that is kept secret. In practice, key management is a separate area of cryptography, which is considered a problematic area. This paper describes the main characteristics of working with cryptographic key information. In that, the formation of keys and working with cryptographic key information are stored on external media. The random-number generator for generating random numbers used for cryptographic key generation is elucidated. To initialize the sensor, a source of external entropy, mechanism “Electronic Roulette” (biological random number), is used. The generated random bits were checked on the basis of National Institute of Standards and Technology (NIST) statistical tests. As a result of the survey, the sequence of random bits was obtained from the tests at a value of P ≥ 0.01. The value of P is between 0 and 1, and the closer the value of P is to 1, the more random the sequence of bits is generated. This means that random bits that are generated based on the proposed algorithm can be used in cryptography to generate crypto-resistant keys.
APA, Harvard, Vancouver, ISO, and other styles
2

Nathanael, Hizkia, and Alz Danny Wowor. "Chaos CSPRNG Design As a Key in Symmetric Cryptography Using Logarithmic Functions." Komputasi: Jurnal Ilmiah Ilmu Komputer dan Matematika 21, no. 1 (2024): 83–91. http://dx.doi.org/10.33751/komputasi.v21i1.9265.

Full text
Abstract:
This research uses the logarithm function as a key component in generating random numbers in the Chaos CSPRNG framework. The main problem addressed here is the generation of keys for cryptography, recognizing the important role of cryptographic keys in safeguarding sensitive information. By using mathematical functions, specifically logarithmic functions, as a key generation method, this research explores the potential for increasing the uncertainty and strength of cryptographic keys. The proposed approach involves the systematic utilization of various mathematical functions to generate diverse and unpredictable data sets. This data set, derived from the application of logarithmic functions, serves as the basis for generating random numbers. Through a series of tests such as Randomness Test and Cryptography Test, this research shows that the data generated from these functions can be utilized effectively as a reliable source for generating random numbers, and has a low correlation value, thereby contributing to the overall security of a symmetric cryptographic system.
APA, Harvard, Vancouver, ISO, and other styles
3

Turčaník, Michal, and Martin Javurek. "Cryptographic Key Generation by Genetic Algorithms." Information & Security: An International Journal 43, no. 1 (2019): 54–61. http://dx.doi.org/10.11610/isij.4305.

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

Mukhammadovich, Nurullaev Mirkhon, and Aloev Rakhmatillo Djuraevich. "Working with cryptographic key information." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 1 (2023): 911. http://dx.doi.org/10.11591/ijece.v13i1.pp911-919.

Full text
Abstract:
It is important to create a cryptographic system such that the encryption system does not depend on the secret storage of the algorithm that is part of it, but only on the private key that is kept secret. In practice, key management is a separate area of cryptography, which is considered a problematic area. This paper describes the main characteristics of working with cryptographic key information. In that, the formation of keys and working with cryptographic key information are stored on external media. The random-number generator for generating random numbers used for cryptographic key generation is elucidated. To initialize the sensor, a source of external entropy, mechanism “Electronic Roulette” (biological random number), is used. The generated random bits were checked on the basis of National Institute of Standards and Technology (NIST) statistical tests. As a result of the survey, the sequence of random bits was obtained from the tests at a value of P≥0.01. The value of P is between 0 and 1, and the closer the value of P is to 1, the more random the sequence of bits is generated. This means that random bits that are generated based on the proposed algorithm can be used in cryptography to generate crypto-resistant keys.
APA, Harvard, Vancouver, ISO, and other styles
5

Pasupuleti, Murali Krishna. "Post-Quantum Cryptography: Algorithms and Implementation Challenges." International Journal of Academic and Industrial Research Innovations(IJAIRI) 05, no. 06 (2025): 234–43. https://doi.org/10.62311/nesx/rphcrcscrbc4.

Full text
Abstract:
The advent of quantum computing presents a significant threat to classical public-key cryptographic systems, including RSA and Elliptic Curve Cryptography (ECC), thereby accelerating the development and standardization of post-quantum cryptography (PQC). This study evaluates the performance and implementation challenges of leading PQC algorithms across three major categories: lattice-based, hash-based, and multivariate cryptographic schemes. Utilizing empirical benchmark data from NIST candidate algorithms, the analysis focuses on key generation time, encryption latency, and memory consumption. Simulations and regression modeling reveal that lattice-based algorithms, particularly Kyber, demonstrate favorable trade-offs between computational efficiency and cryptographic strength. However, these schemes also present integration difficulties, especially in resource-constrained or legacy systems. Hash-based schemes like SPHINCS+ exhibit strong security guarantees but suffer from high latency and memory overhead, while multivariate algorithms such as Rainbow offer compact key sizes with moderate performance. The findings highlight the need for application-specific evaluation in selecting PQC solutions and provide actionable insights for guiding secure and efficient cryptographic transitions in the post-quantum era. Keywords: Post-Quantum Cryptography, Lattice-Based Cryptography, Hash-Based Cryptography, Multivariate Cryptography, Quantum Computing, Cryptographic Algorithms, Key Generation, Encryption Latency, Implementation Challenges, NIST PQC Standardization
APA, Harvard, Vancouver, ISO, and other styles
6

Kaleem, Waseem, Mohammad Sajid, and Ranjit Rajak. "Salp Swarm Algorithm to solve Cryptographic Key Generation problem for Cloud computing." International Journal of Experimental Research and Review 31, Spl Volume (2023): 85–97. http://dx.doi.org/10.52756/10.52756/ijerr.2023.v31spl.009.

Full text
Abstract:
Cryptographic keys are long strings of random bits generated using specialized algorithms and help secure data by making it unpredictable to any adversary. Cryptographic keys are used in various cryptographic algorithms in many domains, i.e., Cloud computing, Internet-of-Things (IoT), Fog computing, and others. The key generation algorithms are essential in cryptographic data encryption and decryption algorithms. This work proposed a cryptographic key generation algorithm based on Shannon entropy and the Salp Swarm algorithm (SSA) for generating randomized keys. The proposed Cryptographic Key Generation algorithm utilizes the dynamic movement of salps to create high-quality, robust, and randomized keys against attacks. The transfer function and quantization method convert a salp into a cryptographic key. The proposed Cryptographic Key Generation algorithm has been evaluated on four transfer functions against three state-of-the-art swarm intelligence metaheuristics, i.e., particle swarm optimization, BAT, and grey wolf optimization algorithms. The keys of eight different bit lengths, i.e., 512, 256, 192, 128, 96, 80, 64, were generated and evaluated due to their applications in the different encryption algorithms, i.e., AES, DES, PRESENT, SIMON, SPECK, and 3DES. The simulation study confirms that the proposed key generation algorithm effectively produces secure cryptographic keys.
APA, Harvard, Vancouver, ISO, and other styles
7

Vlachou, C., J. Rodrigues, P. Mateus, N. Paunković, and A. Souto. "Quantum walk public-key cryptographic system." International Journal of Quantum Information 13, no. 07 (2015): 1550050. http://dx.doi.org/10.1142/s0219749915500501.

Full text
Abstract:
Quantum Cryptography is a rapidly developing field of research that benefits from the properties of Quantum Mechanics in performing cryptographic tasks. Quantum walks are a powerful model for quantum computation and very promising for quantum information processing. In this paper, we present a quantum public-key cryptographic system based on quantum walks. In particular, in the proposed protocol the public-key is given by a quantum state generated by performing a quantum walk. We show that the protocol is secure and analyze the complexity of public key generation and encryption/decryption procedures.
APA, Harvard, Vancouver, ISO, and other styles
8

B S Spoorthi. "Quantum Key Generation Integration with AES Encryption for Quantum Attack Resilience." Journal of Information Systems Engineering and Management 10, no. 31s (2025): 1069–76. https://doi.org/10.52783/jisem.v10i31s.5208.

Full text
Abstract:
Quantum cryptography, with the chance of advancement offered by its basis on the single principle of quantum mechanics, constitutes a notable point of strength in the advancement of new cryptography research. Utilizing the distinctive properties of quantum mechanism, such as qubits, quantum cryptography offers enhanced protection against quantum computer attacks. This paper proposes a novel quantum cryptographic algorithm that integrates quantum key generation with the Advanced Encryption Standard (AES) technique to safeguard data from quantum threats. By combining quantum bit generation with AES encryption, the confidentiality of information exchanged between parties is preserved. The quantum bit generation technique exploits the inherent properties of quantum mechanics, particularly quantum superposition, to generate secure cryptographic keys. Leveraging the efficiency and robustness of the AES encoding standard, this approach offers heightened security against quantum attacks. Experimental analysis using MATLAB software validates the effectiveness of the proposed method.Top of Form
APA, Harvard, Vancouver, ISO, and other styles
9

Sagar Ramesh Rane. "Quantum-Resistant Cryptographic Algorithms: A Comparative Analysis for Securing Next-Generation Communication Networks." Journal of Information Systems Engineering and Management 10, no. 13s (2025): 725–31. https://doi.org/10.52783/jisem.v10i13s.2155.

Full text
Abstract:
The advent of quantum computing poses a significant challenge to conventional cryptographic methods such as RSA, Elliptic Curve Cryptography (ECC), and Diffie-Hellman key exchange. Quantum algorithms, particularly Shor’s algorithm, have the potential to break these encryption techniques, making it essential to develop cryptographic approaches that can withstand quantum threats. Post-quantum cryptography (PQC) has emerged as a crucial area of research, aiming to establish cryptographic mechanisms that remain secure even in the presence of quantum adversaries. This study presents a detailed comparative analysis of five primary categories of quantum-resistant cryptographic algorithms: lattice-based, code-based, hash-based, multivariate polynomial, and isogeny-based encryption schemes. Each of these approaches offers distinct advantages and challenges in terms of security, efficiency, and implementation feasibility. Among them, lattice-based cryptography has gained significant attention due to its robust security properties and computational efficiency, making it a strong candidate for standardization. Conversely, code-based cryptography provides high security but is hindered by its large key sizes, affecting its practical deployment. The research includes a real-time performance assessment of selected PQC algorithms, analyzing key factors such as encryption speed, key size, and computational demands. Furthermore, the study examines the challenges associated with transitioning from classical encryption standards to quantum-resistant frameworks, including compatibility constraints, computational overhead, and the necessity for global standardization. Potential mitigation approaches, such as hybrid cryptographic techniques that integrate both classical and post-quantum encryption models, are also explored. Our findings emphasize that while quantum-resistant cryptography is still evolving, early adoption of PQC frameworks is essential for safeguarding future communication networks. This paper provides valuable insights for researchers, cybersecurity professionals, and policymakers on strategic measures to implement quantum-secure encryption systems effectively.
APA, Harvard, Vancouver, ISO, and other styles
10

Pasupuleti, Murali Krishna. "Algebraic Geometry Methods in Cryptographic Protocol Design." International Journal of Academic and Industrial Research Innovations(IJAIRI) 05, no. 04 (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
More sources

Dissertations / Theses on the topic "Cryptographic key generation"

1

Park, DongGook. "Cryptographic protocols for third generation mobile communication systems." Thesis, Queensland University of Technology, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mokhled, Al Tarawneh. "Fingerprint image processing for generating biometric cryptographic key." Thesis, University of Newcastle Upon Tyne, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.514462.

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

Çağrıcı, Gökhan Koltuksuz Ahmet. "An analysis of key generation efficiency of rsa cryptos ystem in distributed environments/." [s.l.]: [s.n.], 2005. http://library.iyte.edu.tr/tezler/master/bilgisayaryazilimi/T000406.pdf.

Full text
Abstract:
Thesis (Master)--İzmir Institute of Technology, İzmir, 2005.<br>Keywords: Cryptosystem, rivest-Shamir-Adleman, parallel computing, parallel algorithms, Random number. Includes bibliographical references (leaves. 68).
APA, Harvard, Vancouver, ISO, and other styles
4

Quist, Britton T. "Improved Channel Probing for Secret Key Generation with Multiple Antenna Systems." BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/3554.

Full text
Abstract:
Establishing secret keys from the commonly-observed randomness of reciprocal wireless propagation channels has recently received considerable attention. In this work we propose improved strategies for channel estimation between MIMO or beamforming systems for secret key generation. The amount of mutual information that can be extracted from the channel matrix estimates is determined by the quality of channel matrix estimates. By allocating increased energy to channel estimation for higher gain beamforming combinations at the expense of low-gain combinations, key establishment performance can be increased. Formalizing the notion of preferential energy allocation to the most efficient excitations is the central theme of this dissertation. For probing with beamforming systems, we formulate a theoretically optimal probing strategy that upper bounds the number of key bits that can be generated from reciprocal channel observations. Specifically, we demonstrate that the eigenvectors of the channel spatial covariance matrix should be used as beamformer weights during channel estimation and we optimize the energy allocated to channel estimation for each beamformer weight under a total energy constraint. The optimal probing strategy is not directly implementable in practice, and therefore we propose two different modifications to the optimal algorithm based on a Kronecker approximation to the spatial covariance matrix. Though these approximations are suboptimal, they each perform well relative to the upper bound. To explore how effective an array is at extracting all of the information available in the propagation environment connecting two nodes, we apply the optimal beamformer probing strategy to a vector current basis function expansion on the array volume. We prove that the resulting key rate is a key rate spatial bound that upper bounds the key rate achievable by any set of antenna arrays probing the channel with the same total energy constraint. For MIMO systems we assume the channel is separable with a Kronecker model, and then for that model we propose an improved probing strategy that iteratively optimizes the energy allocation for each node using concave maximization. The performance of this iterative approach is better than that achieved using the traditional probing strategy in many realistic probing scenarios.
APA, Harvard, Vancouver, ISO, and other styles
5

Del, Prete Simone. "Ray-tracing assessment of the robustness of Physical Layer Security key generation protocol." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/24081/.

Full text
Abstract:
Nowadays, information security is a very important topic. In particular, wireless networks are experiencing an ongoing widespread diffusion, also thanks the increasing number of Internet Of Things devices, which generate and transmit a lot of data: protecting wireless communications is of fundamental importance, possibly through an easy but secure method. Physical Layer Security is an umbrella of techniques that leverages the characteristic of the wireless channel to generate security for the transmission. In particular, the Physical Layer based-Key generation aims at allowing two users to generate a random symmetric keys in an autonomous way, hence without the aid of a trusted third entity. Physical Layer based-Key generation relies on observations of the wireless channel, from which harvesting entropy: however, an attacker might possesses a channel simulator, for example a Ray Tracing simulator, to replicate the channel between the legitimate users, in order to guess the secret key and break the security of the communication. This thesis work is focused on the possibility to carry out a so called Ray Tracing attack: the method utilized for the assessment consist of a set of channel measurements, in different channel conditions, that are then compared with the simulated channel from the ray tracing, to compute the mutual information between the measurements and simulations. Furthermore, it is also presented the possibility of using the Ray Tracing as a tool to evaluate the impact of channel parameters (e.g. the bandwidth or the directivity of the antenna) on the Physical Layer based-Key generation. The measurements have been carried out at the Barkhausen Institut gGmbH in Dresden (GE), in the framework of the existing cooperation agreement between BI and the Dept. of Electrical, Electronics and Information Engineering "G. Marconi" (DEI) at the University of Bologna.
APA, Harvard, Vancouver, ISO, and other styles
6

Cederlöf, Jörgen. "Authentication in quantum key growing." Thesis, Linköping University, Department of Mathematics, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-3214.

Full text
Abstract:
<p>Quantum key growing, often called quantum cryptography or quantum key distribution, is a method using some properties of quantum mechanics to create a secret shared cryptography key even if an eavesdropper has access to unlimited computational power. A vital but often neglected part of the method is unconditionally secure message authentication. This thesis examines the security aspects of authentication in quantum key growing. Important concepts are formalized as Python program source code, a comparison between quantum key growing and a classical system using trusted couriers is included, and the chain rule of entropy is generalized to any Rényi entropy. Finally and most importantly, a security flaw is identified which makes the probability to eavesdrop on the system undetected approach unity as the system is in use for a long time, and a solution to this problem is provided.</p>
APA, Harvard, Vancouver, ISO, and other styles
7

Pappala, Swetha. "Device Specific Key Generation Technique for Anti-Counterfeiting Methods Using FPGA Based Physically Unclonable Functions and Artificial Intelligence." University of Toledo / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1336613043.

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

Marangon, Davide Giacomo. "Improving Quantum Key Distribution and Quantum Random Number Generation in presence of Noise." Doctoral thesis, Università degli studi di Padova, 2015. http://hdl.handle.net/11577/3424117.

Full text
Abstract:
The argument of this thesis might be summed up as the exploitation of the noise to generate better noise. More specifically this work is about the possibility of exploiting classic noise to effectively transmit quantum information and measuring quantum noise to generate better quantum randomness. What do i mean by exploiting classical noise to transmit effectively quantum information? In this case I refer to the task of sending quantum bits through the atmosphere in order set up transmissions of quantum key distribution (QKD) and this will be the subject of Chapter 1 and Chapter 2. In the Quantum Communications framework, QKD represents a topic with challenging problems both theoretical and experimental. In principle QKD offers unconditional security, however practical realizations of it must face all the limitations of the real world. One of the main limitation are the losses introduced by real transmission channels. Losses cause errors and errors make the protocol less secure because an eavesdropper could try to hide his activity behind the losses. When this problem is addressed under a full theoretical point of view, one tries to model the effect of losses by means of unitary transforms which affect the qubits in average according a fixed level of link attenuation. However this approach is somehow limiting because if one has a high level of background noise and the losses are assumed in average constant, it could happen that the protocol might abort or not even start, being the predicted QBER to high. To address this problem and generate key when normally it would not be possible, we have proposed an adaptive real time selection (ARTS) scheme where transmissivity peaks are instantaneously detected. In fact, an additional resource may be introduced to estimate the link transmissivity in its intrinsic time scale with the use of an auxiliary classical laser beam co-propagating with the qubits but conveniently interleaved in time. In this way the link scintillation is monitored in real time and the selection of the time intervals of high channel transmissivity corresponding to a viable QBER for a positive key generation is made available. In Chapter 2 we present a demonstration of this protocol in conditions of losses equivalent to long distance and satellite links, and with a range of scintillation corresponding to moderate to severe weather. A useful criterion for the preselection of the low QBER interval is presented that employs a train of intense pulses propagating in the same path as the qubits, with parameters chosen such that its fluctuation in time reproduces that of the quantum communication. For what concern the content of Chapter 3 we describe a novel principle for true random number generator (TRNG) which is based on the observation that a coherent beam of light crossing a very long path with atmospheric turbulence may generate random and rapidly varying images. To implement our method in a proof of concept demonstrator, we have chosen a very long free space channel used in the last years for experiments in Quantum Communications at the Canary Islands. Here, after a propagation of 143 km at an altitude of the terminals of about 2400 m, the turbulence in the path is converted into a dynamical speckle at the receiver. The source of entropy is then the atmospheric turbulence. Indeed, for such a long path, a solution of the Navier-Stokes equations for the {atmospheric flow in which the beam propagates is out of reach. Several models are based on the Kolmogorov statistical theory, which parametrizes the repartition of kinetic energy as the interaction of decreasing size eddies. However, such models only provide a statistical description for the spot of the beam and its wandering and never an instantaneous prediction for the irradiance distribution. These are mainly ruled by temperature variations and by the wind and cause fluctuations in the air refractive index. For such reason, when a laser beam is sent across the atmosphere, this latter may be considered as a dynamic volumetric scatterer which distorts the beam wavefront. We will evaluate the experimental data to ensure that the images are uniform and independent. Moreover, we will assess that our method for the randomness extraction based on the combinatorial analysis is optimal in the context of Information Theory. In Chapter 5 we will present a new approach for what concerns the generation of random bits from quantum physical processes. Quantum Mechanics has been always regarded as a possible and valuable source of randomness, because of its intrinsic probabilistic Nature. However the typical paradigm is employed to extract random number from a quantum system it commonly assumes that the state of said system is pure. Such assumption, only in theory would lead to full and unpredictable randomness. The main issue however it is that in real implementations, such as in a laboratory or in some commercial device, it is hardly possible to forge a pure quantum state. One has then to deal with quantum state featuring some degree of mixedness. A mixed state however might be somehow correlated with some other system which is hold by an adversary, a quantum eavesdropper. In the extreme case of a full mixed state, practically one it is like if he is extracting random numbers from a classical state. In order to do that we will show how it is important to shift from a classical randomness estimator, such as the min-classical entropy H-min(Z) of a random variable Z to quantum ones such as the min-entropy conditioned on quantum side information E. We have devised an effective protocol based on the entropic uncertainty principle for the estimation of the min-conditional entropy. The entropic uncertainty principle lets one to take in account the information which is shared between multiple parties holding a multipartite quantum system and, more importantly, lets one to bound the information a party has on the system state after that it has been measured. We adapted such principle to the bipartite case where an user Alice, A, is supplied with a quantum system prepared by the provider Eve, E, who could be maliciously correlated to it. In principle then Eve might be able to predict all the outcomes of the measurements Alice performs on the basis Z in order to extract random numbers from the system. However we will show that if Alice randomly switches from the measurement basis to a basis X mutually unbiased to Z, she can lower bound the min entropy conditioned to the side information of Eve. In this way for Alice is possible to expand a small initial random seed in a much larger amount of trusted numbers. We present the results of an experimental demonstration of the protocol where random numbers passing the most rigorous classical tests of randomness were produced. In Chapter 6, we will provide a secure generation scheme for a continuos variable (CV) QRNG. Since random true random numbers are an invaluable resource for both the classical Information Technology and the uprising Quantum one, it is clear that to sustain the present and future even growing fluxes of data to encrypt it is necessary to devise quantum random number generators able to generate numbers in the rate of Gigabit or Terabit per second. In the Literature are given several examples of QRNG protocols which in theory could reach such limits. Typically, these are based on the exploitation of the quadratures of the electro-magnetic field, regarded as an infinite bosonic quantum system. The quadratures of the field can be measured with a well known measurement scheme, the so called homodyne detection scheme which, in principle, can yield an infinite band noise. Consequently the band of the random signal is limited only by the passband of the devices used to measure it. Photodiodes detectors work commonly in the GHz band, so if one sample the signal with an ADC enough fast, the Gigabit or Terabit rates can be easily reached. However, as in the case of discrete variable QRNG, the protocols that one can find in the Literature, do not properly consider the purity of the quantum state being measured. The idea has been to extend the discrete variable protocol of the previous Chapter, to the Continuous case. We will show how in the CV framework, not only the problem of the state purity is given but also the problem related to the precision of the measurements used to extract the randomness.<br>L'argomento di questa tesi può essere riassunto nella frase utilizzare il rumore classico per generare un migliore rumore quantistico. In particolare questa tesi riguarda da una parte la possibilita di sfruttare il rumore classico per trasmettere in modo efficace informazione quantistica, e dall'altra la misurazione del rumore classico per generare una migliore casualita quantistica. Nel primo caso ci si riferisce all'inviare bit quantistici attraverso l'atmosfera per creare trasmissioni allo scopo di distribuire chiavi crittografiche in modo quantistico (QKD) e questo sara oggetto di Capitolo 1 e Capitolo 2. Nel quadro delle comunicazioni quantistiche, la QKD è caratterizzata da notevoli difficolta sperimentali. Infatti, in linea di principio la QKD offre sicurezza incondizionata ma le sue realizzazioni pratiche devono affrontare tutti i limiti del mondo reale. Uno dei limiti principali sono le perdite introdotte dai canali di trasmissione. Le perdite causano errori e gli errori rendono il protocollo meno sicuro perché un avversario potrebbe camuffare la sua attivita di intercettazione utilizzando le perdite. Quando questo problema viene affrontato da un punto di vista teorico, si cerca di modellare l'effetto delle perdite mediante trasformazioni unitarie che trasformano i qubits in media secondo un livello fisso di attenuazione del canale. Tuttavia questo approccio è in qualche modo limitante, perché se si ha ha un elevato livello di rumore di fondo e le perdite si assumono costanti in media, potrebbe accadere che il protocollo possa abortire o peggio ancora, non iniziare, essendo il quantum bit error rate (QBER) oltre il limite (11\%) per la distribuzione sicura. Tuttavia, studiando e caratterizzando un canale ottico libero, si trova che il livello di perdite è tutt'altro che stabile e che la turbolenza induce variazioni di trasmissivita che seguono una statistica log-normale. Il punto pertanto è sfruttare questo rumore classico per generare chiave anche quando normalmente non sarebbe possibile. Per far ciò abbiamo ideato uno schema adattativo per la selezione in tempo reale (ARTS) degli istanti a basse perdite in cui vengono istantaneamente rilevati picchi di alta trasmissivita. A tal scopo, si utilizza un fascio laser classico ausiliario co-propagantesi con i qubit ma convenientemente inframezzato nel tempo. In questo modo la scintillazione viene monitorata in tempo reale e vengono selezionati gli intervalli di tempo che daranno luogo ad un QBER praticabile per una generazione di chiavi. Verra quindi presentato un criterio utile per la preselezione dell'intervallo di QBER basso in cui un treno di impulsi intensi si propaga nello stesso percorso dei qubits, con i parametri scelti in modo tale che la sua oscillazione nel tempo riproduce quello della comunicazione quantistica. Nel Capitolo 2 presentiamo quindi una dimostrazione ed i risultati di tale protocollo che è stato implementato presso l'arcipelago delle Canarie, tra l'isola di La Palma e quella di Tenerife: tali isole essendo separate da 143 km, costituiscono un ottimo teatro per testare la validita del protocollo in quanto le condizioni di distanza sono paragonabili a quelle satellitari e la gamma di scintillazione corrisponde quella che si avrebbe in ambiente con moderato maltempo in uno scenario di tipo urbano. Per quanto riguarda il contenuto del Capitolo 3 descriveremo un metodo innovativo per la generazione fisica di numeri casuali che si basa sulla constatazione che un fascio di luce coerente, attraversando un lungo percorso con turbolenza atmosferica da luogo ad immagini casuali e rapidamente variabili. Tale fenomeno è stato riscontrato a partire dai diversi esperimenti di comunicazione quantistica effettuati alle Isole Canarie, dove il fascio laser classico utilizzato per puntare i terminali, in fase di ricezione presentava un fronte d'onda completamente distorto rispetto al tipico profilo gaussiano. In particolare ciò che si osserva è un insieme di macchie chiare e scure che si evolvono geometricamente in modo casuale, il cosiddetto profilo dinamico a speckle. La fonte di tale entropia è quindi la turbolenza atmosferica. Infatti, per un canale di tale lunghezza, una soluzione delle equazioni di Navier-Stokes per il flusso atmosferico in cui si propaga il fascio è completamente fuori portata, sia analiticamente che per mezzo di metodi computazionali. Infatti i vari modelli di dinamica atmosferica sono basati sulla teoria statistica Kolmogorov, che parametrizza la ripartizione dell'energia cinetica come l'interazione di vortici d'aria di dimensioni decrescenti. Tuttavia, tali modelli forniscono solo una descrizione statistica per lo spot del fascio e delle sue eventuali deviazioni ma mai una previsione istantanea per la distribuzione dell' irraggiamento. Per tale motivo, quando un raggio laser viene inviato attraverso l'atmosfera, quest'ultima può essere considerato come un diffusore volumetrico dinamico che distorce il fronte d'onda del fascio. All'interno del Capitolo verranno presentati i dati sperimentali che assicurano che le immagini del fascio presentano le caratteristiche di impredicibilita tali per cui sia possibile numeri casuali genuini. Inoltre, verra presentato anche il metodo per l'estrazione della casualita basato sull'analisi combinatoria ed ottimale nel contesto della Teoria dell'Informazione. In Capitolo 5 presenteremo un nuovo approccio per quanto riguarda la generazione di bit casuali dai processi fisici quantistici. La Meccanica quantistica è stata sempre considerata come la migliore fonte di casualita, a causa della sua intrinseca natura probabilistica. Tuttavia il paradigma tipico impiegato per estrarre numeri casuali da un sistema quantistico assume che lo stato di detto sistema sia puro. Tale assunzione, in principio comporta una generazione in cui il risultato delle misure è complemente impredicibile secondo la legge di Born. Il problema principale tuttavia è che nelle implementazioni reali, come in un laboratorio o in qualche dispositivo commerciale, difficilmente è possibile creare uno stato quantico puro. Generalmente ciò che si ottiene è uno stato quantistico misto. Uno stato misto tuttavia potrebbe essere in qualche modo correlato con un altro sistema quantistico in possesso, eventualmente, di un avversario. Nel caso estremo di uno stato completamente misto, un generatore quantistico praticamente è equivalente ad un generatore che impiega un processo di fisica classica, che in principio è predicibile. Nel Capitolo, si mostrera quindi come sia necessario passare da un estimatore di casualita classico, come l' entropia minima classica $ H_ {min (Z) $ di una variabile casuale $ Z $ ad un estimatore che tenga conto di una informazione marginale $E$ di tipo quantistico, ovvero l'entropia minima condizionata $H_{min(Z|E)$. La entropia minima condizionata è una quantita fondamentale perchè consente di derivare quale sia il minimo contenuto di bit casuali estraibili dal sistema, in presenza di uno stato non puro. Abbiamo ideato un protocollo efficace basato sul principio di indeterminazione entropica per la stima dell'entropia min-condizionale. In generale, il principio di indeterminazione entropico consente di prendere in considerazione le informazioni che sono condivise tra più parti in possesso di un sistema quantistico tri-partitico e, soprattutto, consente di stimare il limite all'informazione che un partito ha sullo stato del sistema, dopo che è stato misurato. Abbiamo adattato tale principio al caso bipartito in cui un utente Alice, $A$, è dotato di un sistema quantistico che nel caso in studio ipotizziamo essere preparato dall'avversario stesso, Eve $E$, e che quindi potrebbe essere con esso correlato. Quindi, teoricamente Eve potrebbe essere in grado di prevedere tutti i risultati delle misurazioni che Alice esegue sulla sua parte di sistema, cioè potrebbe avere una conoscenza massima della variabile casuale $Z$ in cui si registrano i risultati delle misure nella base $\mathcal{Z$. Tuttavia mostreremo che se Alice casualmente misura il sistema in una base $\mathcal{X$ massimamente complementare a $\mathcal{Z$, Alice può inferire un limite inferiore l'entropia per $H_{min(Z|E)$. In questo modo per Alice, utilizzando tecniche della crittografia classeica, è possibile espandere un piccolo seme iniziale di casualita utilizzato per la scelta delle basi di misura, in una quantita molto maggiore di numeri sicuri. Presenteremo i risultati di una dimostrazione sperimentale del protocollo in cui sono stati prodotti numeri casuali che passano i più rigorosi test per la valutazione della casualita. Nel Capitolo 6, verra illustrato un sistema di generazione ultraveloce di numeri casuali per mezzo di variabili continue(CV) QRNG. Siccome numeri casuali genuini sono una preziosa risorsa sia per l'Information Technology classica che quella quantistica, è chiaro che per sostenere i flussi sempre crescenti di dati per la crittografia, è necessario mettere a punto generatori in grado di produrre streaming con rate da Gigabit o Terabit al secondo. In Letteratura sono riportati alcuni esempi di protocolli QRNG che potrebbero raggiungere tali limiti. In genere, questi si basano sulla misura dele quadrature del campo elettromagnetico che può essere considerato come un infinito sistema quantistico bosonico. Le quadrature del campo possono essere misurate con il cosiddetto sistema di rivelazione a omodina che, in linea di principio, può estrarre un segnale di rumore a banda infinita. Di conseguenza, la banda del segnale casuale viene ad essere limitata solo dalla banda passante dei dispositivi utilizzati per misurare. Siccome, rilevatori a fotodiodi lavorano comunemente nella banda delle decine dei GHz, se il segnale è campionato con un ADC sufficientemente veloce e con un elevato numero di bit di digitalizzazione, rate da Gigabit o Terabit sono facilmente raggiungibili. Tuttavia, come nel caso dei QRNG a variabili discrete, i protocolli che si hanno in Letteratura, non considerano adeguatamente la purezza dello stato quantistico da misurare. Nel L'idea è di estendere il protocollo a variabile discreta del capitolo precedente, al caso continuo. Mostreremo come nell'ambito CV, non solo sia abbia il problema della purezza dello stato ma anche il problema relativo alla precisione delle misure utilizzate su di esso. Proporremo e daremo i risultati sperimentali per un nuovo protocollo in grado di estrarre numeri casuali ad alto rate e con un elevato grado di sicurezza.
APA, Harvard, Vancouver, ISO, and other styles
9

Leifgen, Matthias. "Protocols and components for quantum key distribution." Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät, 2016. http://dx.doi.org/10.18452/17473.

Full text
Abstract:
In dieser Doktorarbeit werden zwei Konzepte der Quanteninformationsverarbeitung realisiert. Der Quantenschlüsselaustausch ist revolutionär, weil er perfekte Sicherheit gewährleistet. Zahlreiche Quantenkryptografieprotokolle wurden schon untersucht. Zwei Probleme bestehen. Zum einen ist es sehr schwer, die Bedingungen herzustellen, die in den Annahmen für perfekte Sicherheit impliziert sind. Zum anderen sind die Reichweiten auf momentan etwa 200 km begrenzt, aufgrund des abnehmenden Signals gegenüber des konstanten Rauschens. Ein Experiment dieser Doktorarbeit beschäftigt sich mit dem ersten Problem. Insbesondere der übertragene Quantenzustands ist kritisch für die Sicherheit des Verfahrens. Es werden Einzelphotonen von Stickstoff- Fehlstellen-Zentren und zum ersten Mal von Silizium-Fehlstellen-Zentren für einen Quantenschlüsselaustausch mit Hilfe des BB84-Protokolls benutzt. Die Abweichung von idealen Einzelphotonenzuständen sowie deren Bedeutung für die Sicherheit werden analysiert. Die Übertragung von Quantenzuständen via Satellit könnte das Problem der begrenzten Reichweite lösen. Das neue Frequenz-Zeit- Protokoll eignet sich dafür besonders gut. Es wird während dieser Arbeit zum ersten Mal überhaupt implementiert. Umfangreiche Untersuchungen inklusive der Variation wesentlicher experimenteller Parameter geben Aufschluss über die Leistungsfähigkeit und Sicherheit des Protokolls. Außerdem werden elementare Bestandteile eines vollautomatischen Experiments zum Quantenschlüsselaustausch über Glasfasern in der sogenannten Time-bin-Implementierung mit autonomem Sender und Empfänger realisiert. Ein anderes Konzept der Quanteninformationsverarbeitung ist die Herstellung zufälliger Bitfolgen durch den Quantenzufall. Zufällige Bitfolgen haben zahlreiche Anwendungsgebiete in der Kryptografie und der Informatik. Die Realisierung eines Quantenzufallszahlengenerators mit mathematisch beschreibbarer und getesteter Zufälligkeit und hoher Bitrate wird ebenfalls beschrieben.<br>In this thesis, photonic quantum states are used for experimental realisations of two different concepts of quantum information processing. Quantum key distribution (QKD) is revolutionary because it is the only cryptographic scheme offering unconditional security. Two major problems prevail: Firstly, matching the conditions for unconditional security is challenging, secondly, long distance communication beyond 200 km is very demanding because an increasingly attenuated quantum state starts to fail the competition with constant noise. One experiment accomplished in this thesis is concerned with the first problem. The realisation of the actual quantum state is critical. Single photon states from nitrogen and for the first time also silicon vacancy defect centres are used for a QKD transmission under the BB84 (Bennett and Brassard 1984). The deviation of the used single photon states from the ideal state is thoroughly investigated and the information an eavesdropper obtains due to this deviation is analysed. Transmitting quantum states via satellites is a potential solution to the limited achievable distances in QKD. A novel protocol particularly suited for this is implemented for the first time in this thesis, the frequency-time (FT) protocol. The protocol is thoroughly investigated by varying the experimental parameters over a wide range and by evaluating the impact on the performance and the security. Finally, big steps towards a fully automated fibre-based BB84 QKD experiment in the time-bin implementation with autonomous sender and receiver units are accomplished. Another important concept using quantum mechanical properties as a resource is a quantum random number generator (QRNG). Random numbers are used for various applications in computing and cryptography. A QRNG supplying bits with high and quantifiable randomness at a record-breaking rate is reported and the statistical properties of the random output is thoroughly tested.
APA, Harvard, Vancouver, ISO, and other styles
10

Mazloum, Taghrid. "Analyse et modélisation du canal radio pour la génération de clés secrètes." Thesis, Paris, ENST, 2016. http://www.theses.fr/2016ENST0012/document.

Full text
Abstract:
La sécurité des communications sans fil omniprésentes devient, ces dernières années, de plus en plus une exigence incontournable. Bien que la cryptographie symétrique assure largement la confidentialité des données, la difficulté concerne la génération et la distribution de clés secrètes. Récemment, des études indiquent que les caractéristiques inhérentes du canal de propagation peuvent être exploitées afin de consolider la sécurité. En particulier, le canal radio fournit en effet une source d'aléa commune à deux utilisateurs à partir de laquelle des clés secrètes peuvent être générées. Dans la présente dissertation, nous nous intéressons au processus de génération de clés secrètes (SKG), tout en reliant les propriétés du canal radio à la qualité des clés générées. D'abord nous développons un modèle du canal stochastique, traitant la sécurité du point de vue de l'espion, qui montre une mémoire de canal résiduelle bien au-delà d'une distance de quelques longueurs d'onde (scénarios spatialement non-stationnaires). Ensuite, nous exploitons les degrés de liberté (DOF) du canal et analysons leur impact sur la performance de SKG dans différentes conditions, tout en considérant des canaux plus réalistes en environnements extérieur et intérieur (respectivement grâce à des données déterministes simulées et à des mesures). Les résultats montrent que, même pour des bandes modérées (comme standardisées dans la norme IEEE 802.11), le seul DoF de fréquence ou de son association avec le DoF spatial est souvent suffisant pour générer des longues clés, à condition d'utiliser une méthode efficace de quantification des coefficients complexes du canal<br>Nowadays, the security of ubiquitous wireless communications becomes more and more a crucial requirement. Even though data is widely protected via symmetric ciphering keys, a well-known difficulty is the generation and distribution of such keys. In the recent years therefore, a set of works have addressed the exploitation of inherent characteristics of the fading propagation channel for security. In particular, secret keys could be generated from the wireless channel, considered as a shared source of randomness, available merely to a pair of communicating entities. ln the present dissertation, we are interested in the approach of secret key generation (SKG) from wireless channels, especially in relating the radio channel properties to the generated keys quality. We first develop a stochastic channel model, focusing on the security with respect to the eavesdropper side, which shows a residual channel memory weil beyond a few wavelengths distance (spatially nonstationary scenarios). Then, we analyze the channel degrees of freedom (DoF) and their impact on the SKG performance in different channel conditions, especially by considering more realistic channels in both outdoor and indoor environments (respectively through simulated ray tracing data and through measurements). The results show that, even for moderately wide band (such as standardized in IEEE 802.11), the sole frequency DOF or its association with the spatial DOF is often enough for generating long keys, provided an efficient quantization method of the complex channel coefficients is used
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Cryptographic key generation"

1

Martin, Keith M. Key Management. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198788003.003.0010.

Full text
Abstract:
This chapter provides an understanding of the fundamental principles behind key management. We consider the typical stages in the lifecycle of a cryptographic key and then review each of these stages in some detail. We discuss the choosing of key lengths and look at different techniques for key generation, including key derivation and generation from components. We then look at different techniques for key establishment, including the use of key hierarchies, key wrapping, and quantum key establishment. We then look at key storage and discuss the role of hardware security modules. We also consider key separation, key change, and key destruction, before closing with a short discussion on governance of key management.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Cryptographic key generation"

1

Suresh, K., Rajarshi Pal, and S. R. Balasundaram. "Fingerprint Based Cryptographic Key Generation." In Intelligent Data Communication Technologies and Internet of Things. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34080-3_79.

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

Krähenbühl, Cyrill, and Adrian Perrig. "Key Management." In Trends in Data Protection and Encryption Technologies. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33386-6_4.

Full text
Abstract:
AbstractKey management describes how cryptographic keys are created, securely stored, distributed to the respective key holders, and used in accordance with protocol specifications. It is thus a cornerstone of most cryptographic systems and must be handled with care. Advances in hardware security modules used in key storage and high-end and low-cost random number generator used in key generation show a promising future for secure and affordable key management. However, future challenges, such as quantum resilience, have to be overcome by new key management systems. For the military, existing experience in handling cryptographic keys could help develop a key management system, and the reputation of Switzerland could help promote key management systems developed in Switzerland.
APA, Harvard, Vancouver, ISO, and other styles
3

García-Perera, L. Paola, Juan A. Nolazco-Flores, and Carlos Mex-Perera. "Cryptographic-Speech-Key Generation Architecture Improvements." In Pattern Recognition and Image Analysis. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11492542_71.

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

Sarkar, Arpita, Binod Kr Singh, and Ujjayanta Bhaumik. "Cryptographic Key Generation Scheme from Cancellable Biometrics." In Advances in Intelligent Systems and Computing. Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-7871-2_26.

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

Alharbi, Sarah, Md Saiful Islam, and Saad Alahmadi. "Time-Invariant Cryptographic Key Generation from Cardiac Signals." In Advances in Intelligent Systems and Computing. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-32523-7_23.

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

Mishra, Pawan, Pooja, and Shashi Prakash Tripathi. "SwarmCryptOpt - enhancing cryptographic key generation through swarm intelligence." In Advances in Electronics, Computer, Physical and Chemical Sciences. CRC Press, 2025. https://doi.org/10.1201/9781003616252-44.

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

Sommerhalder, Maria. "Hardware Security Module." In Trends in Data Protection and Encryption Technologies. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-33386-6_16.

Full text
Abstract:
AbstractHardware security modules are specialized devices that perform cryptographic operations. Their functions include key generation, key management, encryption, decryption, and hashing. The advent of cloud computing has increased the complexity of securing critical data. As a result, double-key encryption has become increasingly popular, which encrypts data using two keys. A copy is stored on an HSM, and a copy is stored in the cloud. Furthermore, as Hardware security modules can manage keys and enable users to manage keys, they provide significant security benefits to applications utilizing cryptography.
APA, Harvard, Vancouver, ISO, and other styles
8

Zheng, Zhiyong, Kun Tian, and Fengxia Liu. "A Generalization of NTRUencrypt." In Financial Mathematics and Fintech. Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-7644-5_7.

Full text
Abstract:
AbstractNTRU cryptosystem is a new public key cryptosystem based on lattice hard problem proposed in 1996 by three digit theorists Hoffstein, Piper and Silverman of Brown University in the United States. The essence of NTRU cryptographic design is the generalization of RSA on polynomials, so it is called the cryptosystem based on polynomial rings. Its main feature is that the key generation is very simple, and the encryption and decryption algorithm is much faster than the commonly used RSA and elliptic curve cryptography. In particular, NTRU can resist quantum computing attacks and is considered to be a potential public key cryptography that can replace RSA in the post-quantum cryptography era.
APA, Harvard, Vancouver, ISO, and other styles
9

Maiti, Diptadip, Madhuchhanda Basak, and Debashis Das. "Fingerprint-Based Asymmetric Bio-Cryptographic Key Generation Using Convolution Network." In Lecture Notes in Networks and Systems. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-9040-5_3.

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

Garcia-Baleon, H. A., V. Alarcon-Aquino, and O. Starostenko. "K-Medoids-Based Random Biometric Pattern for Cryptographic Key Generation." In Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10268-4_10.

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

Conference papers on the topic "Cryptographic key generation"

1

Ren, Yichong, Chia-Heng Sun, and Pai-Yen Chen. "Cryptographic Key Generation Based on RF Graphene Quantum Capacitor Trimmers." In 2024 IEEE International Conference on RFID Technology and Applications (RFID-TA). IEEE, 2024. https://doi.org/10.1109/rfid-ta64374.2024.10965150.

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

Raikwal, Pushpa, Nipun Gupta, Nikhil Agarwal, Mahima Maheshwari, and Neelam Dayal. "Security Key Generation in SRAM based PUF for Cryptographic Applications." In 2025 Fifth International Conference on Advances in Electrical, Computing, Communication and Sustainable Technologies (ICAECT). IEEE, 2025. https://doi.org/10.1109/icaect63952.2025.10958966.

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

Pandey, Anvesha, Tanu, Yashdeep Tyagi, Shashank Varshney, Arun Kumar Maurya, and Nitin Sharma. "A Novel Cryptographic Approach: Armstrong Number Key Generation with RGB Encoding for Enhanced Data." In 2024 3rd International Conference on Automation, Computing and Renewable Systems (ICACRS). IEEE, 2024. https://doi.org/10.1109/icacrs62842.2024.10841574.

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

Shakil, Faisal Amin, Mirza Mahir Faiaz, and Fakir Sharif. "Modeling Attack Resistant Enhanced Cryptographic Key Generation and Optimized Selection Using Crossover Ring Oscillator PUF." In 2024 27th International Conference on Computer and Information Technology (ICCIT). IEEE, 2024. https://doi.org/10.1109/iccit64611.2024.11022544.

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

Khan, Muhammad Shahbaz, Jawad Ahmad, Muhammad Ali, Ahmed Al Dubai, Nikolaos Pitropakis, and William J. Buchanan. "VisCrypt: Image Encryption Featuring Novel Chaotic Key Generation and Block Permutation Techniques with Visual Cryptography." In 2024 IEEE 7th International Conference on Advanced Technologies, Signal and Image Processing (ATSIP). IEEE, 2024. http://dx.doi.org/10.1109/atsip62566.2024.10639041.

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

Miah, Arafat, Faisal Amin, and Fakir Sharif Hossain. "Generating Robust Cryptographic Keys using Crossover Ring Oscillator PUFs: Resilience against Machine Learning Attacks." In 2024 15th International Conference on Computing Communication and Networking Technologies (ICCCNT). IEEE, 2024. http://dx.doi.org/10.1109/icccnt61001.2024.10724123.

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

S, Samra S., Sreehari K. N, and Ramesh Bhakthavatchalu. "PUF Based Cryptographic Key Generation." In 2022 2nd Asian Conference on Innovation in Technology (ASIANCON). IEEE, 2022. http://dx.doi.org/10.1109/asiancon55314.2022.9908649.

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

Freire-Santos, M., J. Fierrez-Aguilar, and J. Ortega-Garcia. "Cryptographic key generation using handwritten signature." In Defense and Security Symposium, edited by Patrick J. Flynn and Sharath Pankanti. SPIE, 2006. http://dx.doi.org/10.1117/12.665875.

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

Moosavi, Sanaz Rahimi, Ethiopia Nigussie, Seppo Virtanen, and Jouni Isoaho. "Cryptographic key generation using ECG signal." In 2017 14th IEEE Annual Consumer Communications & Networking Conference (CCNC). IEEE, 2017. http://dx.doi.org/10.1109/ccnc.2017.7983280.

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

Chen, B., and V. Chandran. "Biometric Based Cryptographic Key Generation from Faces." In 9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007). IEEE, 2007. http://dx.doi.org/10.1109/dicta.2007.4426824.

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

Reports on the topic "Cryptographic key generation"

1

Barker, Elaine, and Allen Roginsky. Recommendation for Cryptographic Key Generation. National Institute of Standards and Technology, 2012. http://dx.doi.org/10.6028/nist.sp.800-133.

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

Barker, Elaine, and Allen Roginsky. Recommendation for cryptographic key generation. National Institute of Standards and Technology, 2019. http://dx.doi.org/10.6028/nist.sp.800-133r1.

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

Barker, Elaine, Allen Roginsky, and Richard Davis. Recommendation for cryptographic key generation. National Institute of Standards and Technology, 2020. http://dx.doi.org/10.6028/nist.sp.800-133r2.

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

Pasupuleti, Murali Krishna. Quantum Intelligence: Machine Learning Algorithms for Secure Quantum Networks. National Education Services, 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
5

Yuen, Horace P. Physical Cryptography: A New Approach to Key Generation and Direct Encryption. Defense Technical Information Center, 2009. http://dx.doi.org/10.21236/ada512847.

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

Leathers, Emily, Clayton Thurmer, and Kendall Niles. Encryption for edge computing applications. Engineer Research and Development Center (U.S.), 2024. http://dx.doi.org/10.21079/11681/48596.

Full text
Abstract:
As smart sensors and the Internet of Things (IoT) exponentially expand, there is an increased need for effective processing solutions for sensor node data located in the operational arena where it can be leveraged for immediate decision support. Current developments reveal that edge computing, where processing and storage are performed close to data generation locations, can meet this need (Ahmed and Ahmed 2016). Edge computing imparts greater flexibility than that experienced in cloud computing architectures (Khan et al. 2019). Despite these benefits, the literature highlights open security issues in edge computing, particularly in the realm of encryption. A prominent limitation of edge devices is the hardware’s ability to support the computational complexity of traditional encryption methodologies (Alwarafy et al. 2020). Furthermore, encryption on the edge poses challenges in key management, the process by which cryptographic keys are transferred and stored among devices (Zeyu et al. 2020). Though edge computing provides reduced latency in data processing, encryption mechanism utilization reintroduces delay and can hinder achieving real-time results (Yu et al. 2018). The IoT is composed of a wide range of devices with a diverse set of computational capabilities, rendering a homogeneous solution for encryption impractical (Dar et al. 2019). Edge devices are often deployed in operational locations that are vulnerable to physical tampering and attacks. Sensitive data may be compromised if not sufficiently encrypted or if keys are not managed properly. Furthermore, the distributed nature and quantity of edge devices create a vast attack surface that can be compromised in other ways (Xiao et al. 2019). Understanding established mechanisms and exploring emerging methodologies for encryption reveals potential solutions for developing a robust solution for edge computing applications. The purpose of this document is to detail the current research for encryption methods in the edge computing space and highlight the major challenges associated with executing successful encryption on the edge.
APA, Harvard, Vancouver, ISO, and other styles
7

Young, Derek P., Michael A. Forman, and Donald Ryan Dowdle. The generation of shared cryptographic keys through channel impulse response estimation at 60 GHz. Office of Scientific and Technical Information (OSTI), 2010. http://dx.doi.org/10.2172/1008128.

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

Perdigão, Rui A. P. Neuro-Quantum Cyber-Physical Intelligence (NQCPI). Synergistic Manifolds, 2024. http://dx.doi.org/10.46337/241024.

Full text
Abstract:
Neuro-Quantum Cyber-Physical Intelligence (NQCPI) is hereby introduced, entailing a novel framework for nonlinear natural-based neural post-quantum information physics, along with novel advances in far-from-equilibrium thermodynamics and evolutionary cognition in post-quantum neurobiochemistry for next-generation information physical systems intelligence. NQCPI harnesses and operates with the higher-order nonlinear nature of previously elusive quantum behaviour, including in open chaotic dissipative systems in thermodynamically and magneto-electrodynamically disruptive conditions, such as in natural biological and environmental systems, thereby paving new pathways for post-quantum information technologies, including new paradigms for information encoding, encryption, transmission and security elusive to SoA post-quantum approaches. NQCPI further harnesses and operates with novel quantum properties including new classes of high-order emergence and entanglement structures, new neuro-quantum physical properties, with higher-order post-quantum-proof improvements in security, storage and relaying of information. It further empowers new capabilities to disarm security protocols of adversarial powers including those already at SoA quantum and post-quantum levels. This new technology is implemented into a novel coevolutionary system-of-systems seamlessly operating across classical, quantum, post-quantum cryptographic and key distribution approaches, thereby generalising them with added value whilst ensuring backward compatibility for seamless articulation with legacy and SoA protocols. Having demonstrated disruptive added value relative to post-quantum security, NQCPI is also tested and implemented in other quantum technological developments, ranging from sensing to communication and computation, in articulation with QITES (Quantum Information Technologies in the Earth Sciences), QuASI (Quantum Aerospace Systems Intelligence), AIPSI (Augmented Information Physical Systems Intelligence), and Synergistic Nonlinear Quantum Wave Intelligence Networks (SyNQ-WIN), respectively from Perdigão (2020, 2023) and Perdigão and Hall (2023, 2024). Perdigão, R.A.P. (2020): QITES - Quantum Information Technologies in the Earth Sciences. https://doi.org/10.46337/qites.200628 Perdigão, R.A.P. (2023): QuASI - Quantum Aerospace Systems Intelligence. https://doi.org/10.46337/quasi.230901 Perdigão, R.A.P.; Hall, J. (2023): Augmented Information Physical Systems Intelligence (AIPSI). https://doi.org/10.46337/230414 Perdigão, R.A.P.; Hall, J. (2024): Synergistic Nonlinear Quantum Wave Intelligence Networks (SyNQ-WIN). https://doi.org/10.46337/240118
APA, Harvard, Vancouver, ISO, and other styles
9

Pasupuleti, Murali Krishna. Quantum Semiconductors for Scalable and Fault-Tolerant Computing. National Education Services, 2025. https://doi.org/10.62311/nesx/rr825.

Full text
Abstract:
Abstract: Quantum semiconductors are revolutionizing computing by enabling scalable, fault-tolerant quantum processors that overcome the limitations of classical computing. As quantum technologies advance, superconducting qubits, silicon spin qubits, topological qubits, and hybrid quantum-classical architectures are emerging as key solutions for achieving high-fidelity quantum operations and long-term coherence. This research explores the materials, device engineering, and fabrication challenges associated with quantum semiconductors, focusing on quantum error correction, cryogenic control systems, and scalable quantum interconnects. The study also examines the economic feasibility, industry adoption trends, and policy implications of quantum semiconductors, assessing their potential impact on AI acceleration, quantum cryptography, and large-scale simulations. Through a comprehensive analysis of quantum computing frameworks, market trends, and emerging applications, this report provides a roadmap for integrating quantum semiconductors into next-generation high-performance computing infrastructures. Keywords: Quantum semiconductors, scalable quantum computing, fault-tolerant quantum processors, superconducting qubits, silicon spin qubits, topological qubits, hybrid quantum-classical computing, quantum error correction, quantum coherence, cryogenic quantum systems, quantum interconnects, quantum cryptography, AI acceleration, quantum neural networks, post-quantum security, quantum-enabled simulations, quantum market trends, quantum computing policy, quantum fabrication techniques.
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!