{"author_name":"Paper Radio","author_url":"https://m.montaan.com/","height":720,"html":"<iframe src=\"https://m.montaan.com/embed/video/49a3b892-f8ee-4a2d-b2a1-b5742f40b125\" width=\"1280\" height=\"720\" title=\"Regev&#39;s reduction as a candidate quantum algorithm for the discrete logarithm problem in finite abelian groups — Paper Radio\" frameborder=\"0\" allow=\"autoplay; fullscreen; picture-in-picture\" allowfullscreen loading=\"lazy\" style=\"border:0;display:block;max-width:100%;\"></iframe>","provider_name":"Paper Radio","provider_url":"https://m.montaan.com/","thumbnail_url":"https://m.montaan.com/media/episodes/49a3b892-f8ee-4a2d-b2a1-b5742f40b125/episode.poster.webp","title":"Regev's reduction as a candidate quantum algorithm for the discrete logarithm problem in finite abelian groups","type":"video","version":"1.0","width":1280}