Discrete logarithm

This paper proposes methods for developing digital signature scheme based on the difficulty of the discrete logarithm problem. From the establishment of overview scheme, some digital signature schema have been proposed for practical applications.

8p luuhongdung 02-01-2016 9 1   Download

Using a recent idea of Gaudry and exploiting rational repre-sentations of algebraic tori, we present an index calculus type a lgorithm for solving the discrete logarithm problem that works directly in these groups.

20p dunglh2013 02-04-2014 24 3   Download

(BQ) Part 2 book "Introduction to modern cryptography" has contents: Number theory and cryptographic hardness assumptions, factoring and computing discrete logarithms, private key management and the public key revolution, digital signature schemes,....and other contents.

294p bautroibinhyen20 06-03-2017 2 1   Download

TRAPDOOR ONE-WAY FUNCTIONThe main idea behind asymmetric-key cryptography is the concept of the trapdoor one-way function. TrapdoorOne-WayFunction(TOWF) One-WayFunction(OWF) 1.fiseasytocompute. 2. f −1 is difficult to compute. 3. Given y and a trapdoor, x can be computed easily.

10p vovantien_2 05-12-2012 641 608   Download

USE OF MODERN BLOCK CIPHERS Symmetric-key encipherment can be done using modern block ciphers. Modes of operation have been devised to encipher text of any size employing either DES or AES. Error Propagation A single bit error in transmission can create errors in several in the corresponding block.

20p vovantien_2 05-12-2012 553 518   Download

USE OF MODERN BLOCK CIPHERS Symmetric-key encipherment can be done using modern block ciphers. Modes of operation have been devised to encipher text of any size employing either DES or AES. 1 USE OF MODERN BLOCK CIPHERS Electronic codebook (ECB) mode Error Propagation A single bit error in transmission can create errors in several in the corresponding block. However, the error does not have any effect on the other blocks.

10p vovantien_2 05-12-2012 76 43   Download

How many padding bits must be added to a message of 100 characters if 8bit ASCII is used for encoding and the block cipher accepts blocks of 64 bits? Suppose that we have a block cipher where n = 64. If there are 10 1’s in the ciphertext, how many trialanderror tests does Eve need to do to recover the plaintext from the intercepted ciphertext in each of the following cases?

24p vovantien_2 05-12-2012 29 5   Download

How many padding bits must be added to a message of 100 characters if 8-bit ASCII is used for encoding and the block cipher accepts blocks of 64 bits? 1 MODERN BLOCK CIPHERS Substitution or Transposition ? To be resistant to exhaustive-search attack, a modern block cipher needs to be designed as a substitution cipher. Suppose that we have a block cipher where n = 64. If there are 10 1’s in the ciphertext, how many trial-and-error tests does Eve need to do to recover the plaintext from the intercepted ciphertext in each of the following cases? a. The cipher is designed as a...

12p vovantien_2 05-12-2012 31 4   Download

This paper presents an approach related to authenticate mutually a RFID (Radio Frequency Identification) tag from a RFID reader by using the cryptography based on Elliptic curve. Our proposal mutual authentication lies on the Elliptic curve discrete logarithm problem, which is considered the core in order to fight against all of attacks like replay attack, forgery attack and man-in-the-middle attack. Scientifically, we prove not only the accuracy and the security of our approach, but also its performance in the mutual authentication between a RFID tag and a reader. ...

8p tuanlocmuido 13-12-2012 15 2   Download

The paper discusses the implementation of ECC on two finite fields, prime field and binary field. It also gives an overview of ECC implementation on different coordinate systems called the projective coordinate systems.

11p dunglh2013 02-04-2014 22 1   Download

The paper gives an introduction to elliptic curve cryptography (ECC) and how it is used in the implementation of digital signature (ECDSA) and key agreement (ECDH) Algorithms. The paper discusses the implementation of ECC on two finite fields, prime field and binary field.

11p dunglh2013 02-04-2014 13 0   Download

The Digital Signature Algorithm (DSA) was specified in a U.S. Government Federal Information Processing Standard (FIPS) called the Digital Signature Standard (DSS [70]).

56p dunglh2013 02-04-2014 21 0   Download

THE recent development of various methods of modulation such as PCM and PPM which exchange bandwidth for signal-to-noise ratio has intensified the interest in a general theory of communication. A basis for such a theory is contained in the important papers of Nyquist1 and Hartley2 on this subject. In the present paper we will extend the theory to include a number of new factors, in particular the effect of noise in the channel, and the savings possible due to the statistical structure of the original message and due to the nature of the final destination of the information....

55p toad_prince9x 30-09-2011 46 16   Download

14 Exponential functions, continuous growth and differential equations Use the exponential function and natural logarithms to derive the final sum, initial sum and growth rate when continuous growth takes place. Compare and contrast continuous and discrete growth rates.

33p thegun16 26-11-2010 34 6   Download

Topological Hochschild homology and localization 2. The homotopy groups of T (A|K) 3. The de Rham-Witt complex and TR· (A|K; p) ∗ 4. Tate cohomology and the Tate spectrum 5. The Tate spectral sequence for T (A|K) 6. The pro-system TR· (A|K; p, Z/pv ) ∗ Appendix A. Truncated polynomial algebras References Introduction In this paper we establish a connection between the Quillen K-theory of certain local fields and the de Rham-Witt complex of their rings of integers with logarithmic poles at the maximal ideal.

114p tuanloccuoi 04-01-2013 19 5   Download