# Discrete algorithm

## Discrete logarithm problem in elliptic curve cryptography

For example, in the group of the integers modulo p under addition, the power bk becomes a product bk, and equality means congruence modulo p in the integers. At the same time, the inverse problem of discrete exponentiation is not difficult it can be computed efficiently using exponentiation by squaring , for example. The course is offered annually in the Spring term. Academic writing courses Learning outcomes An ability to give scientific presentations. Cryptography[ edit ] There exist groups for which computing discrete logarithms is apparently difficult. An ability to peer-review and give feedback on written work and on presentations. Assessment practices and criteria Grading is

ElGamal encryptionDiffieâ€”Hellman key exchangeand the Digital Signature Algorithm and cyclic subgroups of elliptic curves over finite fields see Elliptic curve cryptography.

Cryptography[ edit ] There exist groups for which computing discrete logarithms is apparently difficult.

Assessment practices and criteria Grading is Academic writing courses Learning outcomes An ability to give scientific presentations.

Completion methods The course is separated into a 3-cr seminar part and a 2-cr implementation project part, which can be taken independently. An ability to peer-review and give feedback on written work and on presentations. Elementary Number Theory and Its Application 6th ed.

The project is an implementation of an algorithm and its evaluation, reported as a poster presentation and short report.

Rated 7/10
based on 72 review

Download