The following pages link to Redefining the transparency order (Q510458):
Displaying 15 items.
- On the confusion coefficient of Boolean functions (Q1983663) (← links)
- Decomposed S-boxes and DPA attacks: a quantitative case study using PRINCE (Q1989626) (← links)
- A note on the signal-to-noise ratio of \((n, m)\)-functions (Q2085718) (← links)
- On characterization of transparency order for \((n, m)\)-functions (Q2151315) (← links)
- Transparency order of \((n, m)\)-functions -- its further characterization and applications (Q2154041) (← links)
- Results on symmetric S-boxes constructed by concatenation of RSSBs (Q2311423) (← links)
- Transparency order for Boolean functions: analysis and construction (Q2324785) (← links)
- Correlation Power Analysis of Lightweight Block Ciphers: From Theory to Practice (Q2822694) (← links)
- (Q4373693) (← links)
- (Q4421765) (← links)
- On Transparency in Organizations (Q4610726) (← links)
- Fast Software Encryption (Q5473605) (← links)
- Results on the Gowers U2 Norm of Generalized Boolean Functions (Q6132392) (← links)
- Further research results on confusion coefficient of Boolean functions (Q6189024) (← links)
- Characterizing the upper bound on the transparency order of \((n, m)\)-functions (Q6606844) (← links)
