Hardness of hinted ISIS from the space-time hardness of lattice problems

Our (Russell W. F. Lai, Eamonn W. Postlethwaite and me) work titled Hardness of hinted ISIS from the space-time hardness of lattice problems has been accepted to CRYPTO 26. Here’s the abstract: We initiate the study of basing the hardness of hinted ISIS problems (i.e. with trapdoor information, or ‘hints’) on the previously conjectured space-time hardness Continue reading Hardness of hinted ISIS…