Results 231 to 240 of about 59,589 (271)
Some of the next articles are maybe not open access.
Cryptanalysis of the GGH Cryptosystem
Mathematics in Computer Science, 2010In this correspondence, we show that partial information of plaintext can be used to simplify the decryption problem in the case of the GGH cryptosystem. Combined with Nguyen’s previous attack, we solve the numerical GGH challenge of the highest dimension 400, proposed on the Internet by the authors of the cryptosystem.
Lee, M.S., Hahn, S.G. Hahn, Sang-Geun
openaire +2 more sources
A cryptosystem based on cellular automata
Chaos: An Interdisciplinary Journal of Nonlinear Science, 1998Cryptosystems for binary information are based on two primitives: an indexed family of permutations of binary words and a generator of pseudorandom sequences of indices. A very efficient implementation of the primitives is constructed using the phenomenon of synchronization in cellular automata.
Jesús Urías +2 more
openaire +3 more sources
2010
After Whitfield Diffie and Martin Hellman introduced public-key cryptography in their landmark 1976 paper [58], a new branch of cryptography suddenly opened up. As a consequence, cryptologists started looking for methods with which public-key encryption could be realized. In 1977, Ronald Rivest, Adi Shamir and Leonard Adleman (cf. Fig.
Christof Paar, Jan Pelzl
openaire +2 more sources
After Whitfield Diffie and Martin Hellman introduced public-key cryptography in their landmark 1976 paper [58], a new branch of cryptography suddenly opened up. As a consequence, cryptologists started looking for methods with which public-key encryption could be realized. In 1977, Ronald Rivest, Adi Shamir and Leonard Adleman (cf. Fig.
Christof Paar, Jan Pelzl
openaire +2 more sources
Journal of Ambient Intelligence and Humanized Computing, 2021
W. El-shafai +3 more
semanticscholar +1 more source
W. El-shafai +3 more
semanticscholar +1 more source
A novel image encryption cryptosystem based on true random numbers and chaotic systems
Multimedia Systems, 2021Shuang Zhou +5 more
semanticscholar +1 more source
Key-Aggregate Authentication Cryptosystem for Data Sharing in Dynamic Cloud Storage
2017 14th International Symposium on Pervasive Systems, Algorithms and Networks & 2017 11th International Conference on Frontier of Computer Science and Technology & 2017 Third International Symposium of Creative Computing (ISPAN-FCST-ISCC), 2017Sharing encrypted data with different users via public cloud storage is an important research issue. This paper proposes a key-aggregate authentication cryptosystem.
Cheng Guo +6 more
semanticscholar +1 more source
2018
So, we now understand one pretty secure modern cryptosystem, namely ElGamal. Is this the end of the story? Actually, it’s not. One disadvantage of ElGamal is that it makes the message twice as long, since Bob has to send two numbers when he only wants to encrypt one. So this is a bit inefficient.
openaire +2 more sources
So, we now understand one pretty secure modern cryptosystem, namely ElGamal. Is this the end of the story? Actually, it’s not. One disadvantage of ElGamal is that it makes the message twice as long, since Bob has to send two numbers when he only wants to encrypt one. So this is a bit inefficient.
openaire +2 more sources
Communications of the ACM, 1993 Designers of cryptographic systems are at a disadvantage to most other engineers, in that information on how their systems fail is hard to get: their major users have traditionally been government agencies, which are very secretive about their mistakes.In this article, we present the results of a survey of the failure modes of retail banking systems ...
openaire +1 more source