Related papers: RSA+: An RSA variant
This paper puts forward a safe mechanism of data transmission to tackle the security problem of information which is transmitted in Internet. The encryption standards such as DES (Data Encryption Standard), AES (Advanced Encryption…
This paper presents results on generalized public key cryptography with exponentials modulo primes and composite numbers where the mapping is not one-to-one and the uniqueness is achieved by additional side information. Such transformations…
Electronic whistleblowing systems are widely used due to their efficiency and convenience. The key to designing such systems lies in protecting the identity privacy of whistleblowers, preventing malicious whistleblowing, and ensuring the…
A number of security mechanisms have been proposed to harden programs written in unsafe languages, each of which mitigates a specific type of memory error. Intuitively, enforcing multiple security mechanisms on a target program will improve…
We introduce Rabia, a simple and high performance framework for implementing state-machine replication (SMR) within a datacenter. The main innovation of Rabia is in using randomization to simplify the design. Rabia provides the following…
General problems in analyzing information in a probabilistic database are considered. The practical difficulties (and occasional advantages) of storing uncertain data, of using it conventional forward- or backward-chaining inference…
In the RSA cryptosystem integers of the form n=p.q with p and q primes of comparable size (`RSA-integers') play an important role. It is a folklore result of cryptographers that C_r(x), the number of integers n<=x that are of the form n=pq…
A revocable-storage attribute-based encryption (RS-ABE) scheme is an encryption scheme which extends attribute-based encryption by intro- ducing user revocation. A key-policy RS-ABE scheme links each key to an access structure. We propose a…
We revisit Fermat's factorization method for a positive integer $n$ that is a product of two primes $p$ and $q$. Such an integer is used as the modulus for both encryption and decryption operations of an RSA cryptosystem. The security of…
Rivest-Shamir-Adleman (RSA) cryptosystem uses modular multiplication for encryption and decryption. So, performance of RSA can be drastically improved by optimizing modular multiplication. This paper proposes a new parallel, high-radix…
Nowadays, using cryptographic systems play an effective role in security and safety technologies. One of the most applied kind of cryptography is Symmetric Cryptography and its applications. New aspects of symmetric Cryptography…
Despite numerous countermeasures proposed by practitioners and researchers, remote control-flow alteration of programs with memory-safety vulnerabilities continues to be a realistic threat. Guaranteeing that complex software is completely…
The statistical distribution, when determined from an incomplete set of constraints, is shown to be suitable as host for encrypted information. We design an encoding/decoding scheme to embed such a distribution with hidden information. The…
Stake systems which issue stakes as well as coins are proposed. Two subadditive stake systems are studied: one is the radical stake system, the other is the logarithmic stake system. Securities of both systems are analysed.
Primality generation is the cornerstone of several essential cryptographic systems. The problem has been a subject of deep investigations, but there is still a substantial room for improvements. Typically, the algorithms used have two parts…
In 2013, Tsai et al. cryptanalyzed Yeh et al. scheme and shown that Yeh et al., scheme is vulnerable to various cryptographic attacks and proposed an improved scheme. In this poster we will show that Tsai et al., scheme is also vulnerable…
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by now. Most of these problems are search problems, i.e., they…
This paper investigates a quantum version of McEliece public-key encryption (PKE) scheme, and analyzes its security. As is well known, the security of classical McEliece PKE is not stronger than the onewayness of related classical one-way…
Braids groups provide an alternative to number theoretic public cryptography and can be implemented quite efficiently. The paper proposes five signature schemes: Proxy Signature, Designated Verifier, Bi-Designated Verifier, Designated…
A computationally secure noised based cipher system is proposed. The advantage of this cipher system is that it operates above noise level. Therefore computationally secure communication can be done when error correction code fails. Another…