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 20 of 235 for “"decryption"”.

  1. Decryption Failure Attacks on Post-Quantum Cryptography

    … how does the low but non-zero probability of decryption failures affect the cryptanalysis of these new PQC candidates?And 2) how might side-channel vulnerabilities inadvertently be introduced when going from theory to the practice of software/hardware implementations?Of main concern are PQC …

    lund Repository record for Decryption Failure Attacks on Post-Quantum Cryptography (opens in a new tab) Download PDF for Decryption Failure Attacks on Post-Quantum Cryptography (opens in a new tab)

  2. RECONSTRUCTION OF SATELLITE DECRYPTION AND DATA HANDLING PROCESSES

    … study examines how to reconstruct a satellite decryption process from source information. It examines how cryptographic algorithms are implemented in software and what software components are required to access data in a useable format. This examination enabled the reverse engineering and …

    nps Repository record for RECONSTRUCTION OF SATELLITE DECRYPTION AND DATA HANDLING PROCESSES (opens in a new tab)

  3. SEMI-PASSIVE TRANSPORT LAYER SECURITY VERSION 1.3 DECRYPTION OPPORTUNITIES

    … now available, the end result is a successful decryption of passively captured network traffic. Key logging of distinct Gmail email sessions and multiple compression techniques were experimented and analyzed. The outcome has provided proven viable benefits for both the offensive and defensive …

    nps Repository record for SEMI-PASSIVE TRANSPORT LAYER SECURITY VERSION 1.3 DECRYPTION OPPORTUNITIES (opens in a new tab)

  4. Hiding Decryption Latency in Intel SGX using Metadata Prediction

    … security add a significant performance overhead. Decryption of data using secret OTPs, which are generated by modified Counter Mode Encryption AES blocks, results in a significant latency overhead that contributes to the overall SGX performance loss. This thesis introduces a metadata prediction …

    vt Repository record for Hiding Decryption Latency in Intel SGX using Metadata Prediction (opens in a new tab)

  5. Compelled Decryption and the Right Against Self-Incrimination: Obsta Principiis

    Amidst the debate over compelled decryption, most courts and commentators have failed to recognize that the Act of Production Doctrine has swallowed the right against self-incrimination. The right against self-incrimination was created for the express purpose of preventing the government from …

    wustl Repository record for Compelled Decryption and the Right Against Self-Incrimination: Obsta Principiis (opens in a new tab)

  6. Sniffing, Decoding and Decryption of GSM Signals Using low cost hardware and Open-source software

    We have participated in the creation of almost two terabytes of tables aimed at cracking A5/1, the most common ciphering algorithm used in GSM. Given 114-bit of known plaintext, we are able to recover the session key with a hit rate of 19%. The tables are expected to be unique as they provide the …

    cuny Repository record for Sniffing, Decoding and Decryption of GSM Signals Using low cost hardware and Open-source software (opens in a new tab)

  7. Embedded Cryptography: An Analysis and Evaluation of Performance and Code Optimization Techniques for Encryption and Decryption in Embedded Systems

    … while keeping the overhead of encryption and decryption to a minimum. Embedded systems are very resource sensitive. An embedded system is composed of different components, which are implemented in both hardware and software. Therefore, hardware-software co-synthesis is a crucial factor …

    usf Repository record for Embedded Cryptography: An Analysis and Evaluation of Performance and Code Optimization Techniques for Encryption and Decryption in Embedded Systems (opens in a new tab)

  8. Optimization of RSA Cryptography for FPGA and ASIC Applications

    … the MOD exponent operation for encryption and decryption, and through non finite-field arithmetic. This thesis translates the RSA cryptosystem into the finite-field domain of arithmetic which greatly increases the range of encryption and decryption keys and replaces the MOD exponent with a …

    unt Repository record for Optimization of RSA Cryptography for FPGA and ASIC Applications (opens in a new tab)

  9. ACRSES – Advanced Cryptography on a Resource Scarce Embedded System

    … implementations were used to achieve encryption, decryption and CMAC verification. Various tests cases were constructed to investigate the Raspberry Pi Pico’s performance under these test cases. The performance of the system was analysed by extracting data about the execution time. The data …

    chalmers Repository record for ACRSES – Advanced Cryptography on a Resource Scarce Embedded System (opens in a new tab)

  10. The Elgamal Cryptosystem is better than Th RSA Cryptosystem for Mental Poker

    … implementation is based on a joint encryption/decryption of individual cards. Both implementations use shared private key encryption/decryption schemes and neither uses a trusted third party (TTP). The comparison criteria will be concentrated on the security and computational complexity of the …

    duquesne Repository record for The Elgamal Cryptosystem is better than Th RSA Cryptosystem for Mental Poker (opens in a new tab)

  11. A Collection of New Algorithms in Post-Quantum Cryptography

    … to Stern's algorithm that reduces average decryption time by approximately 14% for a code of length 1024, dimension 524 capable of correcting 50 errors. We accomplish this by adding 3 extra columns to the columns reduced to the identity matrix and performing extra row reductions that …

    carleton Repository record for A Collection of New Algorithms in Post-Quantum Cryptography (opens in a new tab)

  12. FairBlock: Preventing Blockchain Front-running with Minimal Overheads

    … block, a committee only needs to exchange S decryption shares (independent of N). In comparison, previous solutions are based on threshold decryption schemes, where each transaction in a block must be decrypted separately by the committee, resulting in bandwidth overhead of N*S. Along the …

    waterloo Repository record for FairBlock: Preventing Blockchain Front-running with Minimal Overheads (opens in a new tab)

  13. Towards implementing RSA-based CP-ABE algorithm on Android system : a thesis presented in partial fulfilment of the requirements for the degree of Master of Information Sciences at Massey University, Auckland, New Zealand

    … are setup, key generation, encryption and decryption. During the setup process, the CP-ABE scheme uses the RSA algorithm to choose two prime numbers. These prime numbers are used to a master public key and a master private key. In the key generation algorithm, a secret key is generated for …

    massey Repository record for Towards implementing RSA-based CP-ABE algorithm on Android system : a thesis presented in partial fulfilment of the requirements for the degree of Master of Information Sciences at Massey University, Auckland, New Zealand (opens in a new tab)

  14. Exploring Physical Unclonable Functions for Efficient Hardware Assisted Security in the IoT

    … When cryptographic keys used for encryption and decryption are stored on memory present on these devices, they can be retrieved by attackers or adversaries to gain control of the system. For this purpose, Physical Unclonable Functions (PUFs) were proposed to generate the keys required for …

    unt Repository record for Exploring Physical Unclonable Functions for Efficient Hardware Assisted Security in the IoT (opens in a new tab)

  15. Crumpled and Abraded Encryption: Implementation and Provably Secure Construction

    … Crumpled encryption ensures that each decryption is costly and prevents law enforcement from performing mass decryption of messages. Abrasion ensures that only large organizations like law enforcement are able to access any messages. The current abrasion construction uses public key …

    portland-state Repository record for Crumpled and Abraded Encryption: Implementation and Provably Secure Construction (opens in a new tab)

  16. Duomenų šifravimo aplikacijos kūrimas taikant chaotinius atvaizdžius /

    … • Indicators of chaos. • Need of cryptography. • Decryption and encryption. • Classification of encryption. Afterward going to link these two sciences by describing two chaotic cryptography algorithms: Baptist’s and Rani - Nitharwal. Will distinguish strengths and weaknesses, go through encryption …

    vilnius Repository record for Duomenų šifravimo aplikacijos kūrimas taikant chaotinius atvaizdžius / (opens in a new tab)

  17. Performance Comparison of Learning with Errors Cryptosystems

    … the amortized LWE obtains similar encryption and decryption speed to the Ring-LWE system, but requires a much larger public key that is slow to generate. We also show that the basic LWE and normal-form LWE cryptosystems have significantly slower encryption times than the amortized LWE and Ring-LWE …

    rit Repository record for Performance Comparison of Learning with Errors Cryptosystems (opens in a new tab)

  18. The Effects of Side-Channel Attacks on Post-Quantum Cryptography: Influencing FrodoKEM Key Generation Using the Rowhammer Exploit

    … the flipped bits known, an adversary can obtain decryption failures at a higher rate compared to an honest user. This allows for secret information to be obtained via a decryption failure attack. Multiple engineering strategies are implemented in this thesis to accomplish this attack. The attack …

    arkansas Repository record for The Effects of Side-Channel Attacks on Post-Quantum Cryptography: Influencing FrodoKEM Key Generation Using the Rowhammer Exploit (opens in a new tab)

Page 1 of 12