نتایج جستجو برای: elgamal

تعداد نتایج: 569  

2008
Chong Hee Kim Philippe Bulens Christophe Petit Jean-Jacques Quisquater

Many cryptosystems suffer from fault attacks when implemented in physical devices such as smart cards. Fault attacks on secret key elements have successfully targeted many protocols relying on the Elliptic Curve Discrete Logarithm Problem (ECDLP), the Integer Factorization Problem (IFP) or the Discrete Logarithm Problem (DLP). More recently, faults attacks have also been designed against the pu...

Journal: :International Journal of Advanced Trends in Computer Science and Engineering 2020

Journal: :CoRR 2010
Omar Khadir

In this paper, a new variant of ElGamal signature scheme is presented and its security analyzed. We also give, for its theoretical interest, a general form of the signature equation. Mathematics Subject Classification: 94A60

2006
Ricardo Corin Jerry den Hartog

We extend a Probabilistic Hoare-style logic to formalize gamebased cryptographic proofs. Our approach provides a systematic and rigorous framework, thus preventing errors from being introduced. We illustrate our technique by proving semantic security of ElGamal.

2004
Jaimee Brown Ed Dawson Juan Manuel González Nieto

We present our experience from implementing the public-key cryptosystem of González, Boyd and Dawson. We discuss different computational methods and compare their relative efficiency experimentally. We also compare the efficiency of this cryptosystem with that of the ElGamal cipher.

1994
Patrick Horster Markus Michels Holger Petersen

There have been several approaches in the past to obtain signature schemes with appendix and signature schemes giving message recovery based on the discrete logarithm problem. Most of them can be embedded into a Meta-ElGamal and Meta-Message recovery scheme. In this paper we present the Meta-blind signature schemes which have been developed from the ElGamal based blind signature scheme and the ...

Journal: :IACR Cryptology ePrint Archive 2005
Ricardo Corin Jerry den Hartog

We extend a Probabilistic Hoare-style logic to formalize game-based cryptographic proofs. Our approach provides a systematic and rigorous framework, thus preventing errors from being introduced. We illustrate our technique by proving semantic security of ElGamal.

2005
Ricardo Corin Jerry den Hartog

We extend a Probabilistic Hoare-style logic to formalize reduction based cryptographic proofs. Our approach provides a systematic and rigorous framework, thus preventing errors from being introduced. We illustrate our technique by proving semantic security of ElGamal.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید