Browsing posts tagged: Hard
Hard mathematical problems as basis for new cryptographic techniques

RUB researchers develop new cryptographic algorithms that are based on particularly hard mathematical problems. They would be virtually unbreakable. Cryptographic methods are typically created following the ad-hoc principle: somebody comes up with an algorithm; others attempt to break it – if they don’t succeed, it means that the algorithm is secure. The team headed by […]