The back door that may not be a back door... The suspicion about Dual_EC_DRBG - The Dual Elliptic Curve Deterministic Random Bit Generator - with Dr Mike Pound.
EXTRA BITS: https://youtu.be/XEmoD06_mZ0
Nothing up my sleeve Numbers: https://youtu.be/oJWwaQm-Exs
Elliptic Curves: https://youtu.be/NF1pwjL9-DE
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

Just what are elliptic curves and why use a graph shape in cryptography? Dr Mike Pound explains.
Mike's myriad Diffie-Hellman videos: https://www.youtube.com/playlist?list=PLzH6n4zXuckpoaxDKOOV26yhgoY2S-xYg
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

Diffie Hellman has a flaw. Dr Mike Pound explains how a man in the middle could be a big problem, unless we factor it in...
Public Key Cryptography: https://youtu.be/GSIDS_lvRv4
Elliptic Curve Cryptography: Coming Soon!
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

Just how bad is it if your site is vulnerable to an SQL Injection? Dr Mike Pound shows us how they work.
Cookie Stealing: https://youtu.be/T1QEs3mdJoc
Rob Miles on Game Playing AI: https://youtu.be/5oXyibEgJr0
Secure Web Browsing: https://www.youtube.com/watch?v=E_wX40fQwEA
Deep Learning: https://youtu.be/l42lr8AlrHk
Tom Scott on SQL Injection: https://youtu.be/_jKylhJtPmI
http://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: http://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

How do you prove something without giving away all your data? Zero Knowledge Proofs could hold the answer. Alberto Sonnino, Research Student at UCL explains.
EXTRA BITS: https://youtu.be/RK_pNQ3QCKA
Computing Limits: https://youtu.be/jv2H9fp9dT8
UCL Link: http://bit.ly/C_UCL-people
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

This video is a tutorial on the Vormetric Data Security Platform with a detailed look into the use cases for application-layer encryption and an overview of the Vormetric Application Encryption product.

How to salt your passwords? How to add "pepper" to salted passwords? What is the difference between salt and pepper?
This video would define the salt and pepper techniques and how they work.
Playlist: Basic Cryptography
https://www.youtube.com/watch?v=vk3py9M2IfE&list=PLSNNzog5eyduN6o4e6AKFHekbH5-37BdV
Advanced Cryptography:
https://www.youtube.com/watch?v=TmA2QWSLSPg&list=PLSNNzog5eydtwsdT__t5WtRgvpfMzpTc7
Please leave comments, questions and
please subscribe!
Sunny Classroom

How do we exchange a secret key in the clear? Spoiler: We don't - Dr Mike Pound shows us exactly what happens.
Mathematics bit: https://youtu.be/Yjrfm_oRO0w
Computing Limit: https://youtu.be/jv2H9fp9dT8
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

Understand the importance of a long term enterprise encryption and key management strategy over the short term fix of an ad hoc encryption to address any data security concerns.
This is a video adaptation from the whitepaper on Enterprise Encryption from Vormetric and ESG.
Register http://enterprise-encryption.vormetric.com/EMAILPTNRESGWhitepaper.html to download the whitepaper

Audible free book: http://www.audible.com/computerphile
JavaScript is dangerous! Why? How are websites vulnerable to it? Find out about bug-bounties from Tom Scott.
More from Tom Scott: http://www.youtube.com/user/enyay and https://twitter.com/tomscott
http://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computerphile is a sister project to Brady Haran's Numberphile. See the full list of Brady's video projects at: http://bit.ly/bradychannels

End to end encryption, government ministers are again talking about stopping it. What is it and why might that be a bad idea? Dr Mike Pound explains.
Hololens: https://youtu.be/gp8UiYOw8Fc
Blockchain: https://youtu.be/qcuc3rgwZAE
http://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: http://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

Deep learning is used for everything these days, but this face detection algorithm is so neat its still in use today. Dr Mike Pound on the Viola/Jones algorithm.
Viola/Jones Paper: http://bit.ly/C_RapidObjectDetectPaper
After detection you may want to ID the face: https://youtu.be/mwTaISbA87A
Hardware Hacking: https://youtu.be/eOPLQxGNmHA
EXTRA BITS: https://youtu.be/s2ciAt7KtZc
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

Sql Injection By Example in Java,PHP,
SQL injection is a code injection technique, used to attack data driven applications, in which malicious SQL statements are inserted into an entry field for execution (e.g. to dump the database contents to the SQL injection must exploit a security vulnerability in an application's software, for example, when user input is either incorrectly filtered for string literal escape characters embedded in SQL statements or user input is not strongly typed and unexpectedly executed. SQL injection is mostly known as an attack vector for websites but can be used to attack any type of SQL database.
Hacking website using SQL Injection -step by step guide
sql injection attack example
Understanding SQL Injection,Grundlegendes zu SQL-Injection,了解SQL注入
SQL injections are most dangerous web attacks on web applications
Prevent SQL Injection Attacks | Stop Attacks on SQL Vulnerabilties
how to prevent sql injection attacks
preventing sql injection attacks,防止SQL注入攻击,Verhinderung von SQL-Injection-Angriffe
sql injection tutorial

With reports about doctored server motherboards, Dr Steve Bagley on what's to be gained by adding chips to a motherboard.
What Happens When I Press a Key: https://youtu.be/ewE8b7zzej0
Choosing a Password: https://youtu.be/3NjQ9b3pgIg
...and yes, there's a typo at 2mins 33secs - it's hACMEe not Hackmee :) - go and decode the binary in the backdrop instead of writing a comment!
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

How does instant messaging encryption protect against attack? Dr Mike Pound on the double ratchet.
Diffie Hellman Key Exchange Explained: https://youtu.be/NmM9HA2MQGI
Signal Protocol: https://youtu.be/DXv1boalsDI
Endianness Explained with an Egg: https://youtu.be/NcaiHcBvDR4
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

Generating random numbers on computers is not easy. And while the intended solution was really hard, the challenge had a problem with the random number generation, which allowed me to solve it.
Clarification from Andres Moreno (riscure) on the challenge:
"The "official" challenge solution involved reading the tiny Mersenne twister (tinyMT) paper, writing some equations, and using a solver. The tinyMT is tricky to initialize. Giving a proper seed is not enough. You need to provide initial state matrices with certain properties (there is a generator for this). The challenge used improper initialized matrices (zeros) that reduced the PRNG period. During tests, we found that ~12hr were needed to solve the challenge (solver time only), but we did not test the amount of entropy reduction by improper state initialization. Fortunately, the problem was not in the PRNG."
-=[ 🔴 Stuff I use ]=-
→ Microphone:* https://amzn.to/2LW6ldx
→ Graphics tablet:* https://amzn.to/2C8djYj
→ Camera#1 for streaming:* https://amzn.to/2SJ66VM
→ Lens for streaming:* https://amzn.to/2CdG31I
→ Connect Camera#1 to PC:* https://amzn.to/2VDRhWj
→ Camera#2 for electronics:* https://amzn.to/2LWxehv
→ Lens for macro shots:* https://amzn.to/2C5tXrw
→ Keyboard:* https://amzn.to/2LZgCFD
→ Headphones:* https://amzn.to/2M2KhxW
-=[ ❤️ Support ]=-
→ per Video: https://www.patreon.com/join/liveoverflow
→ per Month: https://www.youtube.com/channel/UClcE-kVhqyiHCcjYwcpfj9w/join
-=[ 🐕 Social ]=-
→ Twitter: https://twitter.com/LiveOverflow/
→ Website: https://liveoverflow.com/
→ Subreddit: https://www.reddit.com/r/LiveOverflow/
→ Facebook: https://www.facebook.com/LiveOverflow/
-=[ 📄 P.S. ]=-
All links with "*" are affiliate links.
LiveOverflow / Security Flag GmbH is part of the Amazon Affiliate Partner Programm.
#CTF #Cryptography

In this video I'm explaining what is that Galois Counter Mode that provides Authenticated Encryption with Associated Data (AEAD). You must have heard it combined with AES, and maybe used in TLS, ... This is just a small explanation, you can get more on the NIST specs.
Errata (thanks to Casper Kejlberg-Rasmussen in the comments)
error at 11:21, the last M_H that is applied before going into the TAG should not be there if you compare your drawing to the diagram on https://en.wikipedia.org/wiki/Galois/Counter_Mode.
Be sure to follow me on twitter :) https://twitter.com/lyon01_david
and to subscribe to my blog! http://www.cryptologie.net
Cheers!

When a Bitcoin Miner Mines, what is happening? Dr Mike Pound exposes the process..
note: at 3:39 Mike mentions a Bitcoin is mined every ten minutes when it is actually a block that is mined every ten minutes, at time of recording a successful block generates 12.5 new Bitcoins.
Password Cracking: https://youtu.be/7U-RbOKanYs
Onion Routing (TOR): https://youtu.be/QRYzre4bf7I
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

Hello Everyone, today a large percentage of data store electronically, as result individuals and business need assurance that their data move and store securely. Cryptography plays an essential role in protecting the information. In this course, you will gain a basic understanding of various cryptography and hashing techniques that are used to secure data as I will introduce the concepts and principles of Cryptography. I will review some of the historical aspects of encryption and use of encryption, such as providing Confidentiality, Integrity, Authentication and Non-Repudiation. I will present an overview of the main classes of encryption such as Symmetric and Asymmetric Cryptography along with commonly used algorithms. I will review hashing message digests and even passwords. Thank You

Bit flipping a stream cipher could help you hit the Jackpot! But not with HMAC. Dr Mike Pound explains.
Correction : "pseudo" is spelled incorrectly on the graphic.
http://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: http://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

Would you type your password into a random box on the internet? Dr Mike Pound on ensuring your password hasn't already been hacked.
Have I Been Pwned: https://bit.ly/c_troys-site
Mike's code: https://github.com/mikepound/pwned-search
How to Choose a Password: https://youtu.be/3NjQ9b3pgIg
Password Cracking: https://www.youtube.com/watch?v=7U-RbOKanYs
Beast and the GPU Cluster: https://www.youtube.com/watch?v=RG2Z7Xgthb4
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

Video 3/10 on the 2017 OWASP Top Ten Security Risks.
John Wagnon discusses the details of the vulnerabilities listed in this year's OWASP Top 10 Security Risks. This video highlights the #3 security risk: Sensitive Data Exposure. Learn what this is and how to guard against it.
https://devcentral.f5.com/articles/lightboard-lessons-owasp-top-10-sensitive-data-exposure-29328

Type System Tips for the Real World by Sean Griffin
Have you ever looked at some of the more exotic capabilities of Rust's type system and wondered “why”? Why on earth would I ever want a zero sized type? How do I efficiently implement a deeply recursive type? Just what do monomorphization and type erasure actually mean?
In this talk we'll look at some real world examples from inside Diesel to answer these questions and more. You'll come away from this talk with a stronger understanding of how to use Rust's generics, traits, and exotically sized types.

#ASP #ASP.NETCore #csharp #Deccansoft #BestDotNetTraining
In this video "Azure Service Bus | what is Relayed Messaging & How to Setup"
we will be learning and exploring in-depth the various aspects of .NET Core.
Topics covered
• .NET Core is a general-purpose development platform maintained by Microsoft and the .NET community on GitHub.
• It is free and open source cross-platform, supporting Windows, macOS and Linux. It was contributed to .NET Foundation by Microsoft in 2014 and is now most activate .NET Foundation project.
• On Linux, Microsoft primarily supports .NET Core running on Red Hat Package Manger (RPM) and Debian distribution families (Ubuntu / Linux Mint).
• Consistent across architectures: Runs your code with the same behavior on multiple architectures, including x64, x86, and ARM.
As of today, .NET Core supports following app models:
• It includes easy-to-use command-line tools that can be used for local development and in continuous-integration scenarios.
• It provides flexible deployment and can be included in your app or installed side-by-side user- or machine-wide. Can be used with Docker containers.
• .NET Core provides compatibility with .NET Framework and Mono APIs by implementing the .NET Standard specification.
What is Core CLR
Its platform specific runtime implementation of .NET Core.
Portable Executable)
• CIL Code on Ubuntu = CoreCLR of Ubuntu
• CIL Code on Windows = CoreCLR or Windows
• CIL Code on MacOS = CoreCLR on Mac
What is CoreFX NET Core Libraries
• CoreFX is a platform neutral code that is shared across all platforms.
.NET Core and CoreFX
• While .NET Core shares a subset of .NET Framework APIs, it comes with its own API that is not part
• CoreFX is a mix of platform-specific and platform-neutral libraries in .NET Core. You can see the pattern in a few examples:
o CoreCLR is platform-specific. It's built in C/C++, so is platform-specific by construction. It builds on top of OS subsystems, like the memory manager and thread scheduler.
o System.IO and System.Security.Cryptography.Algorithms are platform-specific, given that the storage and cryptography APIs differ significantly on each OS.
o System.Collections and System.Linq are platform-neutral, given that they create and operate over data structures.
Windows and Unix implementations are similar in size. Windows has a larger implementation since CoreFX implements some Windows-only features, such as Microsoft.Win32.Registry but does not yet implement any Unix-only concepts.
Use .NET Core when:
1. There are Cross platform needs.
2. Microservices are being used.
3. Docker containers are being used.
4. Applications needs high performance and scalability.
5. If you want CLI control.
Not to use .NET Core when:
1. For Windows Forms or WPF applications.
2. ASP.NET WebForms.
3. WCF Services.
4. You need access to Windows specific API's like Windows Registry, WMI etc
Platform Support: .NET Core 2.1 is supported on the following operating systems:
• Windows Client: 7, 8.1, 10
• Windows Server: 2008 R2 SP1+
• macOS: 10.12+
• RHEL: 6+
• Fedora: 26+
• Ubuntu: 14.04+
Chip support:
• x64 on Windows, macOS, and Linux
• x86 on Windows
• ARM32 on Linux (Ubuntu 18.04+, Debian 9+)
• Open Source: .NET Core is open source, while a read-only subset of the .NET Framework is open source.
The major differences between .NET Core and Mono:
• Platforms -- Mono supports many platforms and CPUs.
• Open Source -- Mono and .NET Core both use the MIT license and are .NET Foundation projects.
• Focus -- The primary focus of Mono in recent years is mobile platforms, while .NET Core is focused on cloud and desktop workloads.
URL to download: Download Link: https://dotnet.microsoft.com/download
Steps to Build Hello World Application
1. Create a Folder "HelloWorldDemo" in any location
2. Type the following command
dotnet new console
Get Full video tutorial in ASP.NET CORE:
https://www.bestdotnettraining.com/asp-dot-net-Core-online-training
------------------------------------------------------------------------------------------------------------------------------------------
For any course related queries reach us @ +91 8008327000, Mrs. Kashmira Shah
Follow links:
For Azure Online Training Please Visit: https://www.bestdotnettraining.com/
http://www.bestazuretraining.com/
Follow us @ Facebook: https://www.facebook.com/DeccansoftHome

by Timothy Morgan & Jason Morgan
Timing side-channel attacks are a well-known class of flaw in cryptographic systems and applications in general. While these issues have been researched for decades, the complexities involved in obtaining accurate timing measurements and performing accurate statistical analysis has prevented the average pentester from identifying and exploiting these issues on a day-to-day basis.
In this paper, we build on past research to make remote timing attacks practical against modern web applications. We scrutinize both methods of data collection and statistical analysis used by previous researchers, significantly improving results in both areas. We implement an adaptive Kalman filter, which provides greater accuracy in classifying timing differences, making timing attacks more practical in congested networks and speeding up attacks in ideal conditions. As part of this research, a new open source timing attack tool suite is being released to the community.

Just what's going on when your email provider wants to send you a text message? Dr Mike Pound talks about multi-factor authentication.
Password Cracking: https://youtu.be/7U-RbOKanYs
The End of Time (Unix Time) - Numberphile: https://youtu.be/QJQ691PTKsA
http://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: http://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

What is RANDOM ORACLE? What does RANDOM ORACLE mean? RANDOM ORACLE meaning - RANDOM ORACLE definition - RANDOM ORACLE explanation.
Source: Wikipedia.org article, adapted under https://creativecommons.org/licenses/by-sa/3.0/ license.
SUBSCRIBE to our Google Earth flights channel - https://www.youtube.com/channel/UC6UuCPh7GrXznZi0Hz2YQnQ
In cryptography, a random oracle is an oracle (a theoretical black box) that responds to every unique query with a (truly) random response chosen uniformly from its output domain. If a query is repeated it responds the same way every time that query is submitted.
Stated differently, a random oracle is a mathematical function chosen uniformly at random, that is, a function mapping each possible query to a (fixed) random response from its output domain.
Random oracles as a mathematical abstraction were firstly used in rigorous cryptographic proofs in the 1993 publication by Mihir Bellare and Phillip Rogaway (1993). They are typically used when the cryptographic hash functions in the method cannot be proven to possess the mathematical properties required by the proof. A system that is proven secure when every hash function is replaced by a random oracle is described as being secure in the random oracle model, as opposed to secure in the standard model of cryptography.
Random oracles are typically used as an ideal replacement for cryptographic hash functions in schemes where strong randomness assumptions are needed of the hash function's output. Such a proof generally shows that a system or a protocol is secure by showing that an attacker must require impossible behavior from the oracle, or solve some mathematical problem believed hard in order to break it.
Not all uses of cryptographic hash functions require random oracles: schemes that require only one or more properties having a definition in the standard model (such as collision resistance, preimage resistance, second preimage resistance, etc.) can often be proven secure in the standard model (e.g., the Cramer–Shoup cryptosystem).
Random oracles have long been considered in computational complexity theory, and many schemes have been proven secure in the random oracle model, for example Optimal Asymmetric Encryption Padding, RSA-FDH and Probabilistic Signature Scheme. In 1986, Amos Fiat and Adi Shamir showed a major application of random oracles – the removal of interaction from protocols for the creation of signatures.
In 1989, Russell Impagliazzo and Steven Rudich showed the limitation of random oracles – namely that their existence alone is not sufficient for secret-key exchange.
In 1993, Mihir Bellare and Phillip Rogaway were the first to advocate their use in cryptographic constructions. In their definition, the random oracle produces a bit-string of infinite length which can be truncated to the length desired.
According to the Church–Turing thesis, no function computable by a finite algorithm can implement a true random oracle (which by definition requires an infinite description).
In fact, certain artificial signature and encryption schemes are known which are proven secure in the random oracle model, but which are trivially insecure when any real function is substituted for the random oracle. Nonetheless, for any more natural protocol a proof of security in the random oracle model gives very strong evidence of the practical security of the protocol.
In general, if a protocol is proven secure, attacks to that protocol must either be outside what was proven, or break one of the assumptions in the proof; for instance if the proof relies on the hardness of integer factorization, to break this assumption one must discover a fast integer factorization algorithm. Instead, to break the random oracle assumption, one must discover some unknown and undesirable property of the actual hash function; for good hash functions where such properties are believed unlikely, the considered protocol can be considered secure.

A course on how bitcoin works and how to program bitcoin stuff with the javascript bitcoin library Yours Bitcoin. Taught by Ryan X. Charles, Cofounder & CEO of Yours, and former cryptocurrency engineer of reddit. The first lecture gives a general overview of the course and introduces big numbers.
https://github.com/yoursnetwork/yours-bitcoin-examples
https://github.com/yoursnetwork/yours-bitcoin
https://www.yours.network
https://www.ryanxcharles.com/
https://twitter.com/ryanxcharles

JavaScript Object Signing and Encryption (JOSE) has been standardized as a lightweight alternative to XML Signature and Encryption. It has early been integrated in authentication and authorization protocols like OpenID Connect and OAuth. In addition, it has been adopted in Web services.
In our research, we provide the first study regarding the JSON security adapting and extending known attack techniques. We provide an evaluation of four different libraries revealing critical cryptographic attacks, ranging from attacks bypassing JSON Signature (Signature exclusion, Key Confusion, and Timing Attack on HMAC), to JSON Encryption (Bleichenbacher Million Message Attack).
To facilitate the analysis we developed JOSEPH - the first open-source automated tool for evaluating JSON security. The extensible design of JOSEPH allows one to implement further cryptographic attacks, for example, padding oracle or invalid curve attacks.
-
Managed by the official OWASP Media Project https://www.owasp.org/index.php/OWASP_Media_Project

Just what can you do with a quantum computer? Robert Smith of Rigetti Computing takes us through his quantum instruction set.
EXTRA BITS: https://youtu.be/Xtye-b5HphEc
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com

One line of code can get root access on many Linux systems. Dr Steve Bagley demos the exploit.
More info from The Register (updated link): https://bit.ly/2AAQnRT
On the subject of the 'censored' part, we fully appreciate that anyone can find out what that code is, but we're demoing & explaining it, not giving a resource for those who want to do it. If anyone wants to know the code simply look in the comments! hth -Sean
SHA: Secure Hashing Algorithm https://www.youtube.com/watch?v=DMtFhACPnTY
Hardware Hacking: https://www.youtube.com/watch?v=eOPLQxGNmHA
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com