Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 11 of 11
Full-Text Articles in Physical Sciences and Mathematics
Enhancing The Perceived Visual Quality Of A Size Invariant Visual Cryptography Scheme, Yang-Wai Chow, Willy Susilo, Duncan S Wong
Enhancing The Perceived Visual Quality Of A Size Invariant Visual Cryptography Scheme, Yang-Wai Chow, Willy Susilo, Duncan S Wong
Professor Willy Susilo
Two of the main areas of research in visual cryptography have been on improving the visual quality of the recovered image and in reducing the pixel expansion of the shares. This paper addresses both of these visual cryptography issues. First, a method to enhance the perceived visual quality of the recovered image using various image filtering techniques is presented. In particular, these image filtering techniques are used to enhance the local and global contrasts of a grayscale image. Second, a multi-pixel block size invariant visual cryptography scheme that maintains the relative density of local neighboring pixels is proposed. This method …
Enhancing The Perceived Visual Quality Of A Size Invariant Visual Cryptography Scheme, Yang-Wai Chow, Willy Susilo, Duncan S Wong
Enhancing The Perceived Visual Quality Of A Size Invariant Visual Cryptography Scheme, Yang-Wai Chow, Willy Susilo, Duncan S Wong
Dr Yang-Wai Chow
Two of the main areas of research in visual cryptography have been on improving the visual quality of the recovered image and in reducing the pixel expansion of the shares. This paper addresses both of these visual cryptography issues. First, a method to enhance the perceived visual quality of the recovered image using various image filtering techniques is presented. In particular, these image filtering techniques are used to enhance the local and global contrasts of a grayscale image. Second, a multi-pixel block size invariant visual cryptography scheme that maintains the relative density of local neighboring pixels is proposed. This method …
Blackbox Reduction Of Some Cryptographic Constructions., Rishiraj Bhattacharyya Dr.
Blackbox Reduction Of Some Cryptographic Constructions., Rishiraj Bhattacharyya Dr.
Doctoral Theses
No abstract provided.
Effects Of Architecture On Information Leakage Of A Hardware Advanced Encryption Standard Implementation, Eric A. Koziel
Effects Of Architecture On Information Leakage Of A Hardware Advanced Encryption Standard Implementation, Eric A. Koziel
Theses and Dissertations
Side-channel analysis (SCA) is a threat to many modern cryptosystems. Many countermeasures exist, but are costly to implement and still do not provide complete protection against SCA. A plausible alternative is to design the cryptosystem using architectures that are known to leak little information about the cryptosystem's operations. This research uses several common primitive architectures for the Advanced Encryption Standard (AES) and assesses the susceptibility of the full AES system to side-channel attack for various primitive configurations. A combined encryption/decryption core is also evaluated to determine if variation of high-level architectures affects leakage characteristics. These different configurations are evaluated under …
An Analysis Of Error Reconciliation Protocols For Use In Quantum Key Distribution, James S. Johnson
An Analysis Of Error Reconciliation Protocols For Use In Quantum Key Distribution, James S. Johnson
Theses and Dissertations
Quantum Key Distribution (QKD) is a method for transmitting a cryptographic key between a sender and receiver in a theoretically unconditionally secure way. Unfortunately, the present state of technology prohibits the flawless quantum transmission required to make QKD a reality. For this reason, error reconciliation protocols have been developed which preserve security while allowing a sender and receiver to reconcile the errors in their respective keys. The most famous of these protocols is Brassard and Salvail's Cascade, which is effective, but suffers from a high communication complexity and therefore results in low throughput. Another popular option is Buttler's Winnow protocol, …
Some Results On Cryptanalysis Of Rsa And Factorization., Santanu Sarkar Dr.
Some Results On Cryptanalysis Of Rsa And Factorization., Santanu Sarkar Dr.
Doctoral Theses
In this thesis, we propose some new results in Cryptanalysis of RSA and related Factorization problems. Till date, the best known algorithm to solve the Integer Factorization problem is the Number Field Sieve, which has a runtime greater than exp(log1/3 N) for factoring an integer N. However, if one obtains certain information about the RSA parameters, there are algorithms which can factor the RSA modulus N = pq quite efficiently. The intention of this thesis is to identify such weaknesses of the RSA cryptosystem and its variants. Further we study results related to factorization.In Africacrypt 2008, Nitaj presented a class …
Fast Software Multiplication In F_2[X] For Embedded Processors, Serdar Süer Erdem
Fast Software Multiplication In F_2[X] For Embedded Processors, Serdar Süer Erdem
Turkish Journal of Electrical Engineering and Computer Sciences
We present a novel method for fast multiplication of polynomials over F_2 which can be implemented efficiently in embedded software. Fast polynomial multiplication methods are needed for the efficient implementation of some cryptographic and coding applications. The proposed method follows a strategy to reduce the memory accesses for input data and intermediate values during computation. This strategy speeds up the binary polynomial multiplication significantly on typical embedded processors with limited memory bandwidth. These multiplications are usually performed by the comb method or the Karatsuba-based methods in embedded software. The proposed method has speed and memory advantages over these methods on …
An Introduction To Modern Cryptology Within An Algebraic Framework, John Szwast
An Introduction To Modern Cryptology Within An Algebraic Framework, John Szwast
EWU Masters Thesis Collection
No abstract provided.
Enhancing The Perceived Visual Quality Of A Size Invariant Visual Cryptography Scheme, Yang-Wai Chow, Willy Susilo, Duncan S Wong
Enhancing The Perceived Visual Quality Of A Size Invariant Visual Cryptography Scheme, Yang-Wai Chow, Willy Susilo, Duncan S Wong
Faculty of Informatics - Papers (Archive)
Two of the main areas of research in visual cryptography have been on improving the visual quality of the recovered image and in reducing the pixel expansion of the shares. This paper addresses both of these visual cryptography issues. First, a method to enhance the perceived visual quality of the recovered image using various image filtering techniques is presented. In particular, these image filtering techniques are used to enhance the local and global contrasts of a grayscale image. Second, a multi-pixel block size invariant visual cryptography scheme that maintains the relative density of local neighboring pixels is proposed. This method …
Unification Modulo Theories Of Blind Signatures, Serdar Erbatur
Unification Modulo Theories Of Blind Signatures, Serdar Erbatur
Legacy Theses & Dissertations (2009 - 2024)
This thesis is concerned with equational unification problems that are relevant in formal verification of cryptographic protocols which deploy blind signature schemes. Blind signatures are signature schemes that keep the content confidential and have applications in modern cryptography for electronic voting and digital cash schemes. Equational unification problems studied here originate from blind RSA signatures and El Gamal encryption.
Equational Unification : Algorithms And Complexity With Applications To Cryptographic Protocol Analysis, Andrew Marshall
Equational Unification : Algorithms And Complexity With Applications To Cryptographic Protocol Analysis, Andrew Marshall
Legacy Theses & Dissertations (2009 - 2024)
The techniques and tools of unification theory have long been a core component of many