Journey into cryptography | Computer Science | Khan Academy

🎬2014140h 57mUnited KingdomProgramming

Watch Video

Description

The TV series Journey into cryptography | Computer Science | Khan Academy, created by an unlisted creator and produced by an unlisted studio, first premiered on August 17, 2014 in the United Kingdom. The series spans 1 season with 31 episodes, featuring the voices of an unlisted voice cast. It follows the story of characters and events not yet described in the available detail data. This is a Programming series and has received a rating of 0/10 from 0 viewers.

Where to Watch

ugc-edu.comuser6182085343594

Availability may vary by country, language, and release window. Some titles are included with platform subscriptions, while others may require rental, purchase, or app-based access. Streaming catalogs and licensing agreements are updated regularly, so playback options can change over time. For the most accurate viewing experience, check the latest listing on your selected service and confirm regional support, subtitle options, and device compatibility before starting.

Filming Location

127A Smithfield Road, Frederiksted, Virgin Islands

Production

Castle Rock Entertainment

Award

21 wins & 43 nominations total

Get MovieBox / FM / TV APK

Download the latest MovieBox packages for mobile, FM builds, and TV-compatible APK versions. Choose the package that matches your device and region, then follow the official install guide for best compatibility and security.

User Review

Akram Hosny25/06/25 13:54

Fermat Primality test, rough outline of how & why it works. Note, this doesn't assume strong background in modular arithmetic, for those details please see full lesson here: https://www.khanacademy.org/math/appl... Link to program from video: https://www.khanacademy.org/cs/level-...

Bruna Jairosse25/06/25 13:54

Courses on Khan Academy are always 100% free. Start practicing—and saving your progress—now: https://www.khanacademy.org/computing... Can you tell the difference between actions based upon flipping a coin and those based upon blind guessing or simulating randomness? This short video examines the frequency stability property. Watch the next lesson: https://www.khanacademy.org/computing... Missed the previous lesson? https://www.khanacademy.org/computing... Computer Science on Khan Academy: Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information). About Khan Academy: Khan Academy is a nonprofit with a mission to provide a free, world-class education for anyone, anywhere. We believe learners of all ages should have unlimited access to free educational content they can master

I’M AMINE25/06/25 13:54

Claude Shannon's idea of perfect secrecy: no amount of computational power can help improve your ability to break the one-time pad Watch the next lesson: https://www.khanacademy.org/computing... Missed the previous lesson? https://www.khanacademy.org/computing... Computer Science on Khan Academy: Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information). About Khan Academy: Khan Academy is a nonprofit with a mission to provide a free, world-class education for anyone, anywhere. We believe learners of all ages should have unlimited access to free educational content they can master at their own pace. We use intelligent software, deep data analytics and intuitive user interfaces to help students and teachers around the world. Our resources cover preschool through early college edu

ZompdeZomp25/06/25 13:54

Courses on Khan Academy are always 100% free. Start practicing—and saving your progress—now: https://www.khanacademy.org/computing... Brit explains the Caesar cipher, the first popular substitution cipher, and shows how it was broken with "frequency analysis" Watch the next lesson: https://www.khanacademy.org/computing... Missed the previous lesson? https://www.khanacademy.org/computing... Computer Science on Khan Academy: Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information). About Khan Academy: Khan Academy is a nonprofit with a mission to provide a free, world-class education for anyone, anywhere. We believe learners of all ages should have unlimited access to free educational content they can master at their own pace. We use intelligent software, deep data analytic

Sup...25/06/25 13:54

Measuring the divisibility of a number Watch the next lesson: https://www.khanacademy.org/computing... Missed the previous lesson? https://www.khanacademy.org/computing... Computer Science on Khan Academy: Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information). About Khan Academy: Khan Academy is a nonprofit with a mission to provide a free, world-class education for anyone, anywhere. We believe learners of all ages should have unlimited access to free educational content they can master at their own pace. We use intelligent software, deep data analytics and intuitive user interfaces to help students and teachers around the world. Our resources cover preschool through early college education, including math, biology, chemistry, physics, economics, finance, history, grammar an

Abdo.wnees25/06/25 13:54

How can we improve the speed of a (deterministic) primality test? Watch the next lesson: https://www.khanacademy.org/computing... Missed the previous lesson? https://www.khanacademy.org/computing... Computer Science on Khan Academy: Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information). About Khan Academy: Khan Academy is a nonprofit with a mission to provide a free, world-class education for anyone, anywhere. We believe learners of all ages should have unlimited access to free educational content they can master at their own pace. We use intelligent software, deep data analytics and intuitive user interfaces to help students and teachers around the world. Our resources cover preschool through early college education, including math, biology, chemistry, physics, economics, f

L❤️25/06/25 13:54

Sieve of Eratosthenes allows us to generate a list of primes. Watch the next lesson: https://www.khanacademy.org/computing... Missed the previous lesson? https://www.khanacademy.org/computing... Computer Science on Khan Academy: Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information). About Khan Academy: Khan Academy is a nonprofit with a mission to provide a free, world-class education for anyone, anywhere. We believe learners of all ages should have unlimited access to free educational content they can master at their own pace. We use intelligent software, deep data analytics and intuitive user interfaces to help students and teachers around the world. Our resources cover preschool through early college education, including math, biology, chemistry, physics, economics, finan

Nancy Mbani25/06/25 13:54

Why is factorization hard, yet generating primes easy? Where do we go from here? Watch the next lesson: https://www.khanacademy.org/computing... Missed the previous lesson? https://www.khanacademy.org/computing... Computer Science on Khan Academy: Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information). About Khan Academy: Khan Academy is a nonprofit with a mission to provide a free, world-class education for anyone, anywhere. We believe learners of all ages should have unlimited access to free educational content they can master at their own pace. We use intelligent software, deep data analytics and intuitive user interfaces to help students and teachers around the world. Our resources cover preschool through early college education, including math, biology, chemistry, physic

bereket25/06/25 13:54

What is the limit of computer memory? Watch the next lesson: https://www.khanacademy.org/computing... Missed the previous lesson? https://www.khanacademy.org/computing... Computer Science on Khan Academy: Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information). About Khan Academy: Khan Academy is a nonprofit with a mission to provide a free, world-class education for anyone, anywhere. We believe learners of all ages should have unlimited access to free educational content they can master at their own pace. We use intelligent software, deep data analytics and intuitive user interfaces to help students and teachers around the world. Our resources cover preschool through early college education, including math, biology, chemistry, physics, economics, finance, history, grammar and

اسامه رمضان25/06/25 13:54

RSA Encryption (step 3) Watch the next lesson: https://www.khanacademy.org/computing... Missed the previous lesson? https://www.khanacademy.org/computing... Computer Science on Khan Academy: Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information). About Khan Academy: Khan Academy is a nonprofit with a mission to provide a free, world-class education for anyone, anywhere. We believe learners of all ages should have unlimited access to free educational content they can master at their own pace. We use intelligent software, deep data analytics and intuitive user interfaces to help students and teachers around the world. Our resources cover preschool through early college education, including math, biology, chemistry, physics, economics, finance, history, grammar and more. We offe

Similar Movie Recommendations

Blog

Common Types

Comedy

Comedy stories are designed to entertain through humor. Popular formats include situational comedy, sketch-style humor, workplace comedy, and romantic comedy.

Action and Adventure

Action titles emphasize excitement, physical conflict, heroic characters, and fast-paced storytelling. Adventure titles often feature exploration, survival, or epic journeys.

Crime and Mystery

Crime dramas follow investigators, detectives, lawyers, or journalists as they solve criminal cases. Mystery stories encourage audiences to uncover clues alongside the characters.

Science Fiction

Science fiction explores futuristic technology, space travel, artificial intelligence, alternate realities, and scientific speculation.

Horror

Horror storytelling creates suspense through psychological tension, supernatural events, monsters, or survival scenarios.

Romance

Romantic stories focus primarily on relationships, love arcs, and emotional development between characters.

Animation

Animation includes works for children, families, and adults, ranging from educational content to complex dramatic storytelling.

Romance

Romantic stories focus primarily on relationships, love arcs, and emotional development between characters.