نتایج جستجو برای: rao nam cryptosystem
تعداد نتایج: 16923 فیلتر نتایج به سال:
A chaotic map has sensitivity to a change in initial conditions and parameters, and a long-term forecast becomes impossible by iterations of a chaotic map. These features look similar to the properties of the cryptology. For that reason, it is effective to use chaotic maps for cryptosystems. In this research, we propose a cryptosystem using iterations of a chaotic map. This cryptosystem uses ex...
In this paper we analyse a technique designed to transform any discrete logarithm based cryptosystem into an identity-based cryptosystem. The transformation method is claimed to be efficient and secure and to eliminate the need to invent new identity-based cryptosystems. However, we show that the identity-based cryptosystem created by the proposed transformation method suffers from a number of ...
This paper describes the implementation of a threshold cryptosystem for Civitas, a secure electronic voting system. The cryptosystem improves the availability of Civitas by enabling tabulation to complete despite the failure of some agents. The implementation includes a sophisticated distributed key generation protocol, which was designed by Gennaro, Jarecki, Krawczyk, and Rabin. The cryptosyst...
فعل غیرشخصی فعلی است که به صورت سوّم شخص مفرد صرف می شود و فاعل منطقی آن حالت غیر فاعلی دارد. این گونه افعال غالباً در بر دارندة معانی تجارب فیزیکی، ذهنی و ادراکی هستند که بر فاعل منطقی حادث می شوند و خارج از کنترل و ارادة او هستند. این فاعل منطقی که همیشه جاندار است تجربه گر نامیده می شود. عنصر دیگری که در جملات غیرشخصی ظاهر می شود منشأ بروز واقعه یا تجربه است و حضور آن در جمله بستگی به معنای ف...
This study is mainly about the discrete logarithm problem in the ElGamal cryptosystem over the abelian group U(n) where n is one of the following forms p, or 2p where p is an odd large prime and m is a positive integer. It is another good way to deal with the ElGamal Cryptosystem using that abelian group U(n)={x: x is a positive integer such that x<n and gcd(n,x)=1} in the setting of the discre...
The principle of compressed sensing (CS) can be applied in a cryptosystem by providing the notion of security. In this paper, we study the computational security of a CS-based cryptosystem that encrypts a plaintext with a partial unitary sensing matrix embedding a secret keystream. The keystream is obtained by a keystream generator of stream ciphers, where the initial seed becomes the secret ke...
BACKGROUND Nested association mapping (NAM) is a novel genetic mating design that combines the advantages of linkage analysis and association mapping. This design provides opportunities to study the inheritance of complex traits, but also requires more advanced statistical methods. In this paper, we present the detailed algorithm of a QTL linkage mapping method suitable for genetic populations ...
Wearable devices can capture objective day-to-day data about Parkinson's Disease (PD). This study aims to assess the feasibility of implementing wearable technology to collect data from multiple sensors during the daily lives of PD patients. The Parkinson@home study is an observational, two-cohort (North America, NAM; The Netherlands, NL) study. To recruit participants, different strategies wer...
Elliptic curve cryptosystems are expected to be a next standard of public-key cryptosystems. A security level of elliptic curve cryptosystems depends on a difficulty of a discrete logarithm problem on elliptic curves. The security level of a elliptic curve cryptosystem which has a public-key of 160-bit is equivalent to that of a RSA system which has a public-key of 1024-bit. We propose an ellip...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید