Chapter 10 Number-Theoretic Primitives Number theory is a source of several computational problems that serve as primitives in the design of cryptographic schemes. Asymmetric cryptography in particular relies on these pr - Discrete logarithm - Document - PDFSEARCH.IO

First Page	Meta Content
	Chapter 10 Number-Theoretic Primitives Number theory is a source of several computational problems that serve as primitives in the design of cryptographic schemes. Asymmetric cryptography in particular relies on these pr Add to Reading List Document Date: 2009-09-20 23:35:30 Open Document File Size: 129,04 KB Share Result on Facebook Company G. / / Currency USD / / IndustryTerm logarithm algorithm / purpose discrete logarithm computation devices / later applications / generation algorithm / public-key cryptography solutions / fixed / extended-gcd algorithm / above algorithm / baby-step giant-step algorithm / modulii product / cyclic / inversion algorithm / 525MHz quadri-processor / exhaustive search / secret key exchange protocol / / Position General / / Technology encryption / Alpha / logarithm algorithm / inversion algorithm / above algorithm / cryptography / randomized algorithm / secret key / extended-gcd algorithm / x0 This algorithm / digital signature / secret key exchange protocol / generation algorithm / baby-step giant-step algorithm / time algorithm / 525MHz quadri-processor / / SocialTag Group theory Finite fields Computational hardness assumptions Logarithms Discrete logarithm Diffie–Hellman problem Baby-step giant-step Elliptic curve Diffie–Hellman key exchange Abstract algebra

Chapter 10 Number-Theoretic Primitives Number theory is a source of several computational problems that serve as primitives in the design of cryptographic schemes. Asymmetric cryptography in particular relies on these prAdd to Reading List