2021/03/29 by Andrei Tănăsescu, Omar Choudary, Tănăsescu, Andrei +5
Computer Science · Engineering · #Chaos-based Image/Signal Encryption #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #Physical Unclonable Functions (PUFs) and Hardware Security #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.2103.15620
openalex publication_date 2021/03/29 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28
A Massey-like inequality is any useful lower bound on guessing entropy in\nterms of the computationally scalable Shannon entropy. The asymptotically\noptimal Massey-like inequality is determined and further refined for\nfinite-support distributions. The impact of these results are highlighted for\nside-channel attack evaluation where guessing entropy is a key metric. In this\ncontext, the obtained bounds are compared to the state of the art.\n