نتایج جستجو برای: public key cryptosystem
تعداد نتایج: 897768 فیلتر نتایج به سال:
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very large keys, hence recent research has focused mainly on trying to reduce the public key size. Previous proposals tried to replace the class of Goppa codes with other families of codes, but this was revealed to be an ins...
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of security against all attacks known. However, the cryptosystem drops one of the confidence-inspiring shields built into the original McEliece cryptosystem, namely a large pool of Goppa polynomials to choose from. This pape...
We show that it is possible to know whether the secret Goppa code of an instance of the McEliece public-key cryptosystem was chosen with a binary generator polynomial. Furthermore, whenever such a weak key is used, we present an attack which can be completed, for codes of length 1024 and dimension 524, with a large, but feasible amount of computation.
Fully Homomorphic Encryption (FHE) was initially introduced as a concept shortly after the development of the RSA cryptosystem, by Rivest et al. [54]. Although long sought after, the first functional scheme was only proposed over thirty years later by Gentry [34, 35] in 2009. The same blueprint to construct FHE has been followed in all subsequent work. First a scheme is constructed which can ev...
Not surprisingly, the common use of any public key crypto system involves publishing the public key and keeping the private key secret. There are however a few applications where both the private and public key are kept secret, thereby effectively converting a public key crypto algorithm to a symmetric algorithm. We show that if the RSA cryptosystem is used in such a symmetric application, it i...
We performed a sanity check of public keys collected on the web. Our main goal was to test the validity of the assumption that different random choices are made each time keys are generated. We found that the vast majority of public keys work as intended. A more disconcerting finding is that two out of every one thousand RSA moduli that we collected offer no security. Our conclusion is that the...
EPOC-2 is an asymmetric (public-key) hybrid encryption scheme based on the asymmetric cryptosystem of Okamoto and Uchiyama, [13], and the hybrid encryption scheme of Fujisaki and Okamoto, [5]. In simple terms it generates a random key for use with a symmetric cipher and enciphers the message using that symmetric cipher. It then enciphers the key, along with a check value, using the Okamoto-Uchi...
We propose a new variant of the McEliece cryptosystem which ensures that the code used as the public key is not permutationequivalent to the secret code. This allows to increase the security of the public key, and to reconsider possible adoption of classical families of codes, like Reed-Solomon codes. A reduction in the key size or, equivalently, an increased level of security against informati...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید