<?xml version="1.0" encoding="UTF-8"?><oembed><type>video</type><version>1.0</version><html>&lt;iframe src=&quot;https://www.loom.com/embed/73477dc7e3f04dd1878a0962ea895bc6&quot; frameborder=&quot;0&quot; width=&quot;1920&quot; height=&quot;1440&quot; webkitallowfullscreen mozallowfullscreen allowfullscreen&gt;&lt;/iframe&gt;</html><height>1440</height><width>1920</width><provider_name>Loom</provider_name><provider_url>https://www.loom.com</provider_url><thumbnail_height>1440</thumbnail_height><thumbnail_width>1920</thumbnail_width><thumbnail_url>https://cdn.loom.com/sessions/thumbnails/73477dc7e3f04dd1878a0962ea895bc6-205986fcf441bb2f.gif</thumbnail_url><duration>351.167</duration><title>Exploring Public Key Encryption: A Custom Algorithm Implementation</title><description>In this video, I walk you through an assignment I completed at NYIT for my master&apos;s program in cybersecurity, focusing on a public key encryption algorithm I developed. I detail how I set parameters for both Alice and Bob, ensuring they agree on a large prime number and perform necessary calculations to generate shared secrets. I also demonstrate the program&apos;s execution, highlighting the importance of mathematical operations and efficiency in establishing secure connections. I encourage you to watch how the program runs and see the results for yourself. Thank you for your attention!</description></oembed>