The algorithm credited to Euclid for easily finding the greatest common divisor of two integers has broad significance in cryptography. 1. True 2. False

The algorithm credited to Euclid for easily finding the greatest common divisor of two integers has broad significance in cryptography is True.

1. True

Explanation:

The Euclidean calculation, or Euclid's algorithm, is an effective strategy for registering the best regular divisor (GCD) of two numbers, the biggest number that partitions them two without leaving a leftover portion.

The Euclidean calculation is an approach to locate the best regular divisor of two positive whole numbers, an and b. For numbers, the calculation ends when isolates precisely, so, all in all, compared to the best normal divisor of two qualities.