(台大资工系).pptVIP

2005/3/21 Maximum-Density Segment @ CS.CCU An optimal algorithm for identifying a maximum-density segment 呂學一 (台大資工系) .tw/~hil/ What do algorithm people do? Inventing efficient recipes to solve combinatorial problems A famous combinatorial problem The Factorization Problem Input: a number N Output: “yes” if N is a prime number; A factorization of N if N is not a prime number. For example, N = 323264989793317. Output =* OPEN QUESTION Is there an efficient recipe for the Factorization Problem? Why Factorization? The security of many encryption schemes is based upon the assumption that the factorization problem is difficult. RSA encryption –– 1978 RSA factorization challenges US$10,000 –– RSA-576 1881988129206079638386972394616504398071635633794138270076335642298885971523466548531906060650474304531738801130339671619969232120573403187955065699621305168759307650257059 RSA-576 factored in December 3, 2003 398075086424064937397125500550386491199064362342526708406385189575946388957261768583317 472772146107435302536223071973048224632914695302097116459852171130520711256363590397527 At the same time, Adi Shamir gave two talks at NTU (Dec. 4, 2003 ?) US$20,000 –– RSA-640 3107418240490043721350750035888567930037346022842727545720161948823206440518081504556346829671723286782437916272838033415471073108501919548529007337724822783525742386454014691736602477652346609 US$200,000 –– RSA-2048 25195908475657893494027183240048398571429282126204032027777137836043662020707595556264018525880784406918290641249515082189298559149176184502808489120072844992687392807287776735971418347270261896375014971824691165077613379859095700097330459748808428401797429100642458691817195118746121515172654632282216869987549182422433637259085141865462043576798423387184774447920739934236584823824281198163815010674810451660377306056201619676256133844143603833904414952634432190114657544454178424020924616515723350778707749817125772467962926386356373289912154831438167899885040445364023