Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Random key"”.
-
Application of biased random-key genetic algorithm and formulations for the Grundy coloring problem and the connected Grundy coloring problem
… genético de chaves aleatórias viesado (Biased random-key genetic algorithm - BRKGA) e do uso de formulações de programação inteira usando uma abordagem mais tradicional (padrão) e uma por representativos. Também é proposto um novo limite superior combinatório que é válido para ambos os …
-
The use of a logistic map for key generation
A key generation scheme is proposed and its performance analyzed. The method, the logistic map scheme (LMS), is applicable for use on wireless networks because it does not require devices to engage in computationally intensive algorithms. In addition, the method is shown to achieve reliability from …
-
Implementation of Secure Key Management Techniques in Wireless Sensor Networks
… The communicating nodes must agree on secret keys in order to be able to encrypt packets. Sensor networks do not have many resources and so, achieving such key agreements is a difficult matter. Many key agreement schemes like Diffie-Hellman and public-key based schemes are not suitable for …
-
Cryptography and Computer Communications Security. Extending the Human Security Perimeter through a Web of Trust
… work modifies Shamir’s algorithm by sharing a random key that is used to lock up the secret data; as against sharing the data itself. This is significant in cloud computing, especially with homomorphic encryption. Using web design, the resultant scheme practically globalises secret sharing with …
-
Effective and efficient estimation of distribution algorithms for permutation and scheduling problems.
… this thesis is on addressing redundancies in the Random Key representation, preserving diversity in EDA, simplifying the complexity attributed to the use of multiple local improvement procedures and transferring knowledge from solving a benchmark project scheduling problem to a similar real-world …
-
High-dimensional entanglement-based quantum key distribution
Conventional quantum key distribution (QKD) uses a discrete two-dimensional Hilbert space for key encoding, such as the polarization state of a single photon. In contrast, high-dimensional QKD allows encoding onto a larger state space, such as multiple levels of a continuous variable of a single …
-
Dynamic key scheduling algorithm for block ciphers using quasigroup string transformation
Cryptographic ciphers depend on how quickly the key affects the output of the ciphers (ciphertext). Keys are traditionally generated from small size input (seed) to a bigger size random key(s). Key scheduling algorithm (KSA) is the mechanism that generates and schedules all sub-keys for each round …
-
Hardware Implementations for Symmetric Key Cryptosystems
… any of these security goals, namely, asymmetric key algorithms and symmetric key algorithms. The security of asymmetric key algorithms is based on the hardness of the underlying computational problems, which usually require large overhead of space and time complexities. On the other hand, the …
-
Computational aspects of communication amid uncertainty
… it can occur as mismatches in the shared randomness used by the distributed agents, or as ambiguity in the shared context or goal of the communication. We study many modern models of uncertainty, some of which have been considered in the literature but are not well-understood, while others …