Recovering the Tight Security Proof of SPHINCS$$^+$$
Andreas Hülsing, Mikhail Kudinov
Topics & Concepts
Computer scienceHash functionTheoretical computer scienceCryptographySet (abstract data type)Provable securityConcrete securityUpper and lower boundsAdversaryCryptographic hash functionKey (lock)MathematicsComputer securityMathematical analysisProgramming languageCryptography and Data SecurityQuantum Computing Algorithms and ArchitectureComplexity and Algorithms in Graphs