Diffie-Hellman (DH) Key Exchange - Part 3
Автор: DG
Загружено: 2020-03-15
Просмотров: 141
In Part 2, we saw how the DH works with a safe prime. In this session,
we demonstrate the benefits of using a generalized safe prime p = jq + 1 (p and q are primes and j is an even number). We show that DH runs much faster when using a generalized safe prime in comparison to a traditional safe prime. Of course, the size of the q has to be not too small; q shall be at least 256-bit.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке: