Results 221 to 230 of about 11,187 (236)
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
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
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
An evaluation methodology for the security of cryptosystems
2008 Ph.D. Research in Microelectronics and Electronics, 2008This paper describes an integrated circuit design methodology which evaluates at the gate level the resistance of the circuit to a class of attacks, among them is the well-known Differential Power Analysis (DPA). This is of particular concern since it enables the designer to detect design strengths and weaknesses and to compare and choose different ...
Laabidi, Selma +2 more
openaire +3 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
Cryptanalysis of the Hidden Matrix Cryptosystem
2010In this paper, we present an efficient cryptanalysis of the so-called HM cryptosystem which was published at Asiacrypt’1999, and one perturbed version of HM. Until now, this scheme was exempt from cryptanalysis. We first present a distinguisher which uses a differential property of the public key.
Faugère, Jean-Charles +3 more
openaire +4 more sources
An implementation of the McEliece-cryptosystem
ACM SIGSAC Review, 1991Most asymmetric cryptosystems are based on hard number-theoretic problems such as integer factorization or taking discrete logarithms in finite groups [2]. Their performance aspect are well investigated [3].
openaire +3 more sources
1990
The framework presented in Section 2.2 for the construction of public-key cryptosystems is very general. Indeed, the area or subject matter of the underlying problem is not specified in any way. Any one-way street could be worth a try, and many streets have actually been tried.
openaire +2 more sources
The framework presented in Section 2.2 for the construction of public-key cryptosystems is very general. Indeed, the area or subject matter of the underlying problem is not specified in any way. Any one-way street could be worth a try, and many streets have actually been tried.
openaire +2 more sources