نتایج جستجو برای: elgamal
تعداد نتایج: 569 فیلتر نتایج به سال:
We propose public-key encryption algorithms based on chaotic maps, which are generalization of well-known and commercially used algorithms: Rivest-Shamir-Adleman (RSA), ElGamal, and Rabin. For the case of generalized RSA algorithm we discuss in detail its software implementation and properties. We show that our algorithm is as secure as RSA algorithm.
In this paper we present a method of attacking public-key cryptosystems (PKCs) on tamper resistant devices. The attack makes use of transient faults and seems applicable to many types of PKCs. In particular, we show how to attack the RSA, the ElGamal signature scheme, the Schnorr signature scheme, and the DSA. We also present some possible methods to counter the attack.
I continue the discussion initiated in [22] of whether or not computer-assisted proofs are a promising approach to preventing errors in reductionist security arguments. I examine some recent papers that describe automated security proofs for hashed ElGamal encryption, Boneh-Franklin identity-based encryption, and OAEP.
در این پروژه دو نوع سیستم رمزنگاری از لحاظ تولید کلید، رمزنگاری و رمزگشایی شبیه سازی شده است . این دو نوع سیستم عبارتند از: سیستم رمزنگاری rsa که براساس فاکتور کردن عدد صحیح بزرگ ایجاد شده و سیستم رمزنگاری elgamal که براساس لگاریتم عدد در مدول عدد اول بزرگ ایجاد شده است . با توجه به اینکه کاربران مختلف به سطوح امنیت مختلف نیاز دارند، این دو سیستم که در این پروژه شبیه سازی شده اند این امتیاز را ...
In 2002, Hwang et al. propose an asymmetric cryptosystem in which a large message is broken into smaller plaintexts which are then encrypted efficiently. They claim that based on the assumption of the intractability of the discrete logarithm problem, their cryptosystem is secure in the sense that even knowing some pairs of plaintext-ciphertext does not allow an intruder to acquire other plainte...
We generalize the ElGamal signature scheme for cyclic groups to a signature scheme for n-dimensional vector spaces. The higher dimensional version is based on the untractability of the vector decomposition problem (VDP). Yoshida has shown that under certain conditions, the VDP on a two-dimensional vector space is at least as hard as the computational Diffie-Hellman problem (CDHP) on a one-dimen...
In 2004, Yoon et al. proposed a user authentication scheme based on generalized ElGamal signature scheme using smart cards. In their scheme, the previous session keys will be compromised if the secret key of the system is leaked. In this paper, we propose a new scheme which can offer forward secrecy. Our scheme is also secure against forgery attack while keeping the merits of the scheme propose...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید