Skip to main content
1 vote

Unbounded distinguishers and statistical indistinguishability

Statistical indistinguishability implies computational indistinguishability, and in fact this describes a tight upper bound on any distinguishers advantage, unbounded or not. So a distinguisher may ...
Lev's user avatar
  • 468

Only top scored, non community-wiki answers of a minimum length are eligible