Hard problems in cryptography

Hardness assumptions on mathematical problems lie at the heart of modern cryptography; they are often what ensure one cannot break an encryption scheme. This week we will see what hard problems are and how they can offer this underlying security. We have two of examples of…

Multi-Party Computation — the millionaire’s problem

This week we will look at an area of cryptography called Multi Party Computation (MPC).

From Entrepreneur to Startup Advisor — Allister Frost on Being Your Own Boss and the Currency of the Future

What does it mean to pursue a career in STEM?

From Applied Machine Learning to PROWLER.io — Simon Fothergill on his Data Science career

“STEM is about problem solving: If you don’t know what that is, find out. If you don’t know how to do that, find out.” — Simon Fothergill

Group Theory

The goal of the next few weeks will be to see a famous encryption scheme called ElGamal; to see and understand this we will need to do a little preliminary work. Next week, we will look at what we call ‘hard problems’ in cryptography. This week, we will introduce group theory.

The Importance of Mathematics

An article by Ethan McColgan, one of three winners of Oxbridge Inspire’s STEM writing competition 2018.

My Experience of Women in STEM

An article by Isabella Odogu, one of three winners of Oxbridge Inspire’s STEM writing competition 2018.

Work Experience at Oxbridge Inspire: Innovative Video Technology

On Thursday 6th June, work experience students at Oxbridge Inspire attended an interactive workshop for tech businesses focusing on video marketing strategies. Considering the role of innovative technology in…

What Slime Taught Me

An article by Grace Wang, one of three winners of Oxbridge Inspire’s STEM writing competition 2018.