Explain the mathematical underpinnings of Shor's algorithm, specifically focusing on how quantum period-finding is utilized to factor large integers efficiently. Analyze the implications of this algorithm on modern public-key cryptography standards such as RSA and ECC. Discuss the timeline and feasibility of quantum supremacy in cryptanalysis and potential post-quantum cryptographic alternatives.