938 resultados para Cryptographic key
Resumo:
The RSA-based Password-Authenticated Key Exchange (PAKE) protocols have been proposed to realize both mutual authentication and generation of secure session keys where a client is sharing his/her password only with a server and the latter should generate its RSA public/private key pair (e, n), (d, n) every time due to the lack of PKI (Public-Key Infrastructures). One of the ways to avoid a special kind of off-line (so called e-residue) attacks in the RSA-based PAKE protocols is to deploy a challenge/response method by which a client verifies the relative primality of e and φ(n) interactively with a server. However, this kind of RSA-based PAKE protocols did not give any proof of the underlying challenge/response method and therefore could not specify the exact complexity of their protocols since there exists another security parameter, needed in the challenge/response method. In this paper, we first present an RSA-based PAKE (RSA-PAKE) protocol that can deploy two different challenge/response methods (denoted by Challenge/Response Method1 and Challenge/Response Method2). The main contributions of this work include: (1) Based on the number theory, we prove that the Challenge/Response Method1 and the Challenge/Response Method2 are secure against e-residue attacks for any odd prime e; (2) With the security parameter for the on-line attacks, we show that the RSA-PAKE protocol is provably secure in the random oracle model where all of the off-line attacks are not more efficient than on-line dictionary attacks; and (3) By considering the Hamming weight of e and its complexity in the RSA-PAKE protocol, we search for primes to be recommended for a practical use. We also compare the RSA-PAKE protocol with the previous ones mainly in terms of computation and communication complexities.
Resumo:
Natl Univ Defen Technol, China & Nanyang Technol Univ, NUDT
Resumo:
Strong supramolecular interactions, which induced tight packing and rigid molecules in crystals of cyano substituent oligo(para-phenylene vinylene) (CN-DPDSB), are the key factor for the high luminescence efficiency of its crystals; opposite to its isolated molecules in solution which have very low luminescence efficiency.
Resumo:
RNA interference (RNAi) is an evolutionarily conserved mechanism by which double-stranded RNA (dsRNA) initiates post-transcriptional silencing of homologous genes. Here we report the amplification and characterisation of a full length cDNA from black tiger shrimp (Penaeus monodon) that encodes the bidentate RNAase III Dicer, a key component of the RNAi pathway. The full length of the shrimp Dicer (Pm Dcr1) cDNA is 7629 bp in length, including a 51 untranslated region (UTR) of 130 bp, a 3' UTR of 77 bp, and an open reading frame of 7422 bp encoding a polypeptide of 2473 amino acids with an estimated molecular mass of 277.895 kDa and a predicted isoelectric point of 4.86. Analysis of the deduced amino acid sequence indicated that the mature peptide contains all the seven recognised functional domains and is most similar to the mosquito (Aedes aegypti) Dicer-1 sequence with a similarity of 34.6%. Quantitative RT-PCR analysis showed that Pm Dcr1 mRNA is most highly expressed in haemolymph and lymphoid organ tissues (P 0.05). However, there was no correlation between Pm Dcr1 mRNA levels in lymphoid organ and the viral genetic loads in shrimp naturally infected with gill-associated virus (GAV) and Mourilyan virus (P > 0.05). Treatment with synthetic dsRNA corresponding to Pm Dcr1 sequence resulted in knock-down of Pm Dcr1 mRNA expression in both uninfected shrimp and shrimp infected experimentally with GAV. Knock-down of Pm Dcr1 expression resulted in more rapid mortalities and higher viral loads. These data demonstrated that Dicer is involved in antiviral defence in shrimp. (c) 2007 Elsevier Ltd. All rights reserved.