Dear colleagues,

let me invite you to the doctoral seminar tomorrow at 9:50 in S6. Jana Syrovátková will present a paper:

Manindra Agrawal, Nitin Saxena, Shubham Sahai Srivastava: Integer Factoring Using Small Algebraic Dependencies

The integer factoring is a curious number theory problem with wide applications in complexity and cryptography. We will discuss time complexity of some interesting algebraic methods of factoring numbers in a form n=p*q, where p and q are primes. In many cases the algorithm is polynomial!

https://www.cse.iitk.ac.in/users/nitin/papers/integerFact.pdf