Sign inSign in

Round function

The repeating function applied for 80 rounds in SHA-1, consisting of additions, bit shifts, and Boolean functions.
as Christof Paar defines itRuhr University BochumThe wording closest to all 3 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Block cipher1Boolean operations1Float1Function1Hash function1Iterative structures1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • David J. Malan

    Harvard University · Introductory

    The round function takes as input a number and rounds it to the nearest integer or to a specified number of digits.
  • Christof Paar

    Ruhr University Bochum · Undergraduate

Connections

8

The lectures that define it or assume it, and the concepts next to it.

Concepts5

Lectures3

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.