<transcript><audio_75>it is like in Z cach the first iteration of it it was actually used in growth 16 um so uh jens's growth who happened to be for a period in time in UCL of all the people</transcript><transcript><audio_76>that might know UCL he was there and he published the paper while he was there and it was in 2016 and that that then uh the sche improved and there were a whole bunch of other ones that happen so SN actually have this uh how could I say</transcript><transcript><audio_77>exposure to a conic computer what I mean by that is like a world where we have cor computers we have the ability to do both the street lock problem which is what I was describing elliptical discret lock problem which is what I was</transcript><transcript><audio_78>describing and also RSA is integer factorization given a very very arbitrary large Rand uh you know composite number you could Factor it into uh you know primes in that sense so</transcript><transcript><audio_79>this this is known to be NP complete and in a Quantum in a Quantum world we could actually have grow algorithm and grow algorithm could actually solve this really really fast okay so then what has happened can we go to the next slide</transcript><transcript><audio_80>please so what happened is like one of the people who was actually involved in writing the original you know paper pin paper is Elan assd so and I kind of pointed you at a Blog that he has done as well so he came up with another uh</transcript><transcript><audio_81>you know non interactive zero knowledge proof which doesn't require security of elliptic curves to actually have the security for the scheme kns require you know elliptic dis relock problem as the security of the scheme whereas stock</transcript><transcript><audio_82>doesn't stock only requires uh you know security of as sh random function so the whole and it's an interesting paper scalable transparent postquantum computation with integrity that's how they titled it and the thing here is</transcript> it is like in Z cach the first iteration of it it was actually used in growth 16 um so uh jens's growth who happened to be for a period in time in UCL of all the people that might know UCL he was there and he published the paper while he was there and it was in 2016 and that that then uh the sche improved and there were a whole bunch of other ones that happen so SN actually have this uh how could I say exposure to a conic computer what I mean by that is like a world where we have cor computers we have the ability to do both the street lock problem which is what I was describing elliptical discret lock problem which is what I was describing and also RSA is integer factorization given a very very arbitrary large Rand uh you know composite number you could Factor it into uh you know primes in that sense so this this is known to be NP complete and in a Quantum in a Quantum world we could actually have grow algorithm and grow algorithm could actually solve this really really fast okay so then what has happened can we go to the next slide please so what happened is like one of the people who was actually involved in writing the original you know paper pin paper is Elan assd so and I kind of pointed you at a Blog that he has done as well so he came up with another uh you know non interactive zero knowledge proof which doesn't require security of elliptic curves to actually have the security for the scheme kns require you know elliptic dis relock problem as the security of the scheme whereas stock doesn't stock only requires uh you know security of as sh random function so the whole and it's an interesting paper scalable transparent postquantum computation with integrity that's how they titled it and the thing here is
{"source": "grass-yt-cc-by.1_MfAqJZYyM|shard_10001_6|create_multimodal_data.extract_yt_and_generate_transcripts.58|shard_10001|create_multimodal_data.generate_captions.58|shard_10001|create_multimodal_data.generate_captions.58", "params": {"id": "1_MfAqJZYyM", "channel_id": "UCJN6GSN2VR5BCJMeSwf2rPw", "duration": 1901, "view_count": 41, "age_limit": 0, "like_count": 1, "channel_follower_count": 391, "license": "Creative Commons Attribution license (reuse allowed)", "uploader_id": "@TheJBBA", "yt_tar_file": "/leonardo_work/EUHPC_E03_068/audio/fixed_download/grass-yt-cc-by//shard_10001/1_MfAqJZYyM.tar.gz"}}