Results 101 to 110 of about 1,357 (137)
Some of the next articles are maybe not open access.
A cryptosystem for multiple communication
Information Processing Letters, 1980zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fabrizio Luccio, S. Mazzone
openaire +1 more source
On the Wagner–Magyarik Cryptosystem
2006We investigate a monoid variant of the scheme based on the word problem on groups proposed by Wagner and Magyarik at Crypto'84, that has the advantage of being immune to reaction attacks so far. We study the security of this variant. Our main result is a complexity-theoretic one: we show that the problem underlying this cryptosystem, say WM, is NP-hard.
Françoise Levy-dit-Vehel +1 more
openaire +1 more source
Protocol failures in cryptosystems
Proceedings of the IEEE, 1988When a cryptoalgorithm is used to solve data security or authentication problems, it is implemented within the context of a protocol that specifies the appropriate procedures for data handling. The purpose of the protocol is to ensure that when the cryptosystem is applied, the level of security or authentication required by the system is actually ...
openaire +1 more source
Montgomery-suitable cryptosystems
1994Montgomery's algorithm [8], hereafter denoted Mn(·,·), is a process for computing Mn(A,B)=ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is obtained by Mn(Mn(A,B),N−2 mod n) but in this article, we introduce an alternative approach consisting in pre-integrating N into cryptographic keys so that a single Mn(·,·) will ...
David Naccache, David M'Raïhi
openaire +1 more source
PROBLEMS WITH CHAOTIC CRYPTOSYSTEMS
Cryptologia, 1989Matthews [1] has proposed a function based on chaos theory for generating sequences of random numbers to be used like a one-time pad. When implemented on digital computer systems, these functions must produce repeating cycles of values. The cycle length turns out to be unpredictable and often short. The function is not suitable for cryptographic use in
openaire +1 more source
Cryptosystems for hierarchical groups
1996This paper addresses the problem of information protection in hierarchical groups. Higher level groups of participants can control the information flow (the decryption ability) to lower level groups. If a higher level group decides to allow a lower level group to read the message, it passes a go ahead ticket so the lower level group can decrypt the ...
Hossein Ghodosi +3 more
openaire +1 more source
1998
We propose a modified ElCamal cryptosystem which can broadcast communicate by encrypting every different plaintext (same plaintext is also acceptable) for plural users, and is also applicable to the systems which have hierarchical structures. And, we show that the security of this cryptosystem is based on difficulties of solving discrete logarithm ...
Daisuke Nakamura, Kunikatsu Kobayashi
openaire +1 more source
We propose a modified ElCamal cryptosystem which can broadcast communicate by encrypting every different plaintext (same plaintext is also acceptable) for plural users, and is also applicable to the systems which have hierarchical structures. And, we show that the security of this cryptosystem is based on difficulties of solving discrete logarithm ...
Daisuke Nakamura, Kunikatsu Kobayashi
openaire +1 more source
Implementing the RSA cryptosystem
Computers & Security, 1987Techniques for a software implementation of the RSA cryptosystem are presented. They allow both space and time requirements of the RSA scheme to be minimized. A hash function to be used in connection with the cryptosystem is presented; this function avoids weaknesses of other hash functions published previously.
openaire +1 more source