Results 131 to 140 of about 1,377 (175)

Complexity Measures for Public-Key Cryptosystems

SIAM Journal on Computing, 1988
A general theory of public-key cryptography is developed that is based on the mathematical framework of complexity theory. Two related approaches are taken to the development of this theory, and these approaches correspond to different but equivalent formulations of the problem of cracking a public-key cryptosystem (PKCS).
Joachim Grollmann, Alan L. Selman
openaire   +2 more sources

Protocols for Public Key Cryptosystems

1980 IEEE Symposium on Security and Privacy, 1980
New Cryptographic protocols which take full advantage of the unique properties of public key cryptosystems are now evolving. Several protocols for public key distribution and for digital signatures are briefly compared with each other and with the conventional alternative.
openaire   +1 more source

Searching for Public-Key Cryptosystems

1984 IEEE Symposium on Security and Privacy, 1984
This article suggests the use of undecidable problems in constructing public-key cryptosystems. Any such system must still be in NP, but intuitive arguments suggest that this approach might be a reasonable alternative to the use of NP-complete problems.
openaire   +1 more source

Distributed public key cryptosystems

1998
The cryptographic community has developed many tools to incorporate distributed trust mechanisms into cryptographic primitives and protocols as well as primitives where parties are naturally distributed. Since the fastest growing paradigm in computing is distributed systems and communication networks, the importance of distributed mechanisms has been ...
Yair Frankel, Moti Yung
openaire   +1 more source

Coalition Public-Key Cryptosystems

Cybernetics and Systems Analysis, 2001
A coalition is understood to be a group of participants (coalitionists) who can collaborate in order to achieve common objectives. The basic principle of a coalition is the absence of a threat to communication flows within the coalition from its participants. In this paper, two new RSA coalition protocols are considered. According to the first protocol,
openaire   +1 more source

Cryptanalysis of the WD public-key cryptosystem

First International Symposium on Cyber Worlds, 2002. Proceedings., 2003
The theory of generalized inverses of matrices over finite fields has been used in cryptographic applications in recent years. Wu and Dawson (1998) proposed a public-key cryptosystem based on generalized inverses of matrices. In 2001, Sun proposed a scheme for cryptanalysing Wu and Dawson's public-key cryptosystem. However, his method is time intensive
Hui-Feng Huang, Chin-Chen Chang 0001
openaire   +1 more source

A new development of public key cryptosystem

2010 7th International Symposium on Communication Systems, Networks & Digital Signal Processing (CSNDSP 2010), 2010
A public-key encryption algorithm and a practical hybrid scheme are proposed in this paper. This algorithm uses the advanced transform techniques, i.e. the Number Theoretic Transforms (NTTs) to diffuse data, and uses a non-linear technique based on the Elliptic Curve Discrete Logarithm Problem (ECDLP) to confuse data. The main advantage of the proposed
Xiao Bo Yang, Said Boussakta, Mohammed Falih Al-Gailani   +2 more
openaire   +1 more source

Public-Key Cryptosystems

2003
In 1976 Diffie and Hellman [152] described the framework for public-key cryptography. It was not until 1978 that three designs for public-key cryptosystems were published. Rivest, Shamir, and Adleman [431] showed how the discrete logarithm and factorization problems could be used to construct a public-key cryptosystem.
Josef Pieprzyk, Thomas Hardjono, Jennifer Seberry   +2 more
openaire   +1 more source

A New Knapsack Public-Key Cryptosystem

2009 Fifth International Conference on Information Assurance and Security, 2009
A new knapsack-type public key cryptosystem is proposed by constructing an easy knapsack problem. The cryptosystem is shown to be secure against Shamir's key-recovery attack in that it does not use a super-increasing knapsack sequence in the construction process.
Weidong Zhang, Baocang Wang, Yupu Hu
openaire   +1 more source

Cryptanalysis of a Knapsack Public Key Cryptosystem

2009 Fifth International Conference on Information Assurance and Security, 2009
Murakami and Nasako proposed a knapsack public key cryptosystem in2008. They claimed that their proposal is secure against some known attacks. In this paper, we propose a cryptanalytic attack on the cryptosystem. We use a heuristic method to show that the secret key can be recovered with lattice reduction algorithms.
Baocang Wang, Hui Liu, Yupu Hu
openaire   +1 more source