Commitment Schemes and Diophantine Equations

06/07/2020

∙

Motivated by questions in cryptography, we look for diophantine equations that are hard to solve but for which determining the number of solutions is easy.

READ FULL TEXT

Commitment Schemes and Diophantine Equations

Problems in group theory motivated by cryptography

A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty

Some application of difference equations in Cryptography and Coding Theory

Steepest Ascent Hill Climbing For A Mathematical Problem

Hurdles for Developers in Cryptography

The secret life of matrix factorizations: how matrix decompositions reveal and keep secrets of linear equations and what we can do about it

Datasets for Studying Generalization from Easy to Hard Examples

Commitment Schemes and Diophantine Equations

Related Research

Problems in group theory motivated by cryptography

A New Look at the Easy-Hard-Easy Pattern of Combinatorial Search Difficulty

Some application of difference equations in Cryptography and Coding Theory

Steepest Ascent Hill Climbing For A Mathematical Problem

Hurdles for Developers in Cryptography

The secret life of matrix factorizations: how matrix decompositions reveal and keep secrets of linear equations and what we can do about it

Datasets for Studying Generalization from Easy to Hard Examples