Feedback | SoME

The Quadratic Sieve: Fast Integer Factorization Algorithm.

Audience:

Tags: cryptography

Explore the fascinating world of cryptography and integer factorization with the Quadratic Sieve Algorithm! This video covers the basics of symmetric and asymmetric cryptography, the importance of large prime numbers, and the complexity of factoring. We walk through classic methods like trial division and Fermat's factorization, then dive deep into the Quadratic Sieve—one of the fastest algorithms for factoring large numbers.

Analytics

4.5 Overall score*

141 Rank

9 Votes

4 Comments

Comments

5.8

I found this video very interesting. It was well thought off and well animated. It was a great topic for today’s world with dealing with security on the Internet. Keep on creating these great videos.

Does not explore new ideas neither provides new ways of looking at cryptography. Video is not hooking and all content or ideas are popular and already covered before

4.5

1:55 Ass-ymetric :) — it’s asymmetric

Video lacks breaks

5.8

The motivation makes sense, and the final example really makes everything clear. But for most of the explanation of the quadratic sieve, it felt like you were rushing through the formulas. Give the audience enough time to understand each step. Also, there are enough typos and places where what you say doesn’t match what you write to be distracting. An extra round of editing would help.