"Upper bounds of differential branch number of n-bit permutations."

Ying Gao, Lin Qi (2025)

> Home

Details and statistics

DOI: 10.1186/S42400-025-00357-6

access: closed

type: Journal Article

metadata version: 2025-05-31

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cybersec/GaoQ25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cybersec/GaoQ25
Ying Gao, Lin Qi:
Upper bounds of differential branch number of n-bit permutations. Cybersecur. 8(1): 58 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.