Pages that link to "Item:Q3645296"
From MaRDI portal
The following pages link to Communication Theory of Secrecy Systems* (Q3645296):
Displayed 50 items.
- An information-theoretic model for steganography (Q598242) (← links)
- Authenticated key agreement in dynamic peer groups (Q703558) (← links)
- Prospects of quantum-classical optimization for digital design (Q849768) (← links)
- Error correcting codes, block designs, perfect secrecy and finite fields (Q850774) (← links)
- Nonlinearities of S-boxes (Q865386) (← links)
- Exploiting randomness on continuous sets (Q867608) (← links)
- Image security system using recursive cellular automata substitution (Q869061) (← links)
- Permutation and sampling with maximum length CA or pseudorandom number generation (Q870167) (← links)
- New field of cryptography: DNA cryptography (Q871844) (← links)
- A formal analysis of information disclosure in data exchange (Q878760) (← links)
- Exploring confusion in product ciphers through regression analysis (Q881850) (← links)
- A construction for authentication/secrecy codes from 3-homogeneous permutation groups (Q909643) (← links)
- The combinatorics of authentication and secrecy codes (Q914645) (← links)
- A fast software one-way hash function (Q918189) (← links)
- Enumerating Boolean functions of cryptographic significance (Q918500) (← links)
- The structured design of cryptographically good s-boxes (Q923056) (← links)
- Probabilistic encryption (Q1057832) (← links)
- Shannon's random-cipher result and the R-norm information (Q1106808) (← links)
- Is the data encryption standard a group? (Results of cycling experiments on DES) (Q1112006) (← links)
- A construction for authentication/secrecy codes from certain combinatorial designs (Q1112007) (← links)
- A generalization of Hellman's extension of Shannon's approach to cryptography (Q1112784) (← links)
- The simulation of random processes on digital computers with Chebyshev mixing transformations (Q1144352) (← links)
- A cryptographic system based on finite field transforms (Q1144545) (← links)
- Multiple-user communication (Q1147675) (← links)
- A time-luck tradeoff in relativized cryptography (Q1171879) (← links)
- New bounds and constructions for authentication/secrecy codes with splitting (Q1176594) (← links)
- Conditionally-perfect secrecy and a provably-secure randomized cipher (Q1184508) (← links)
- An RSA based public-key cryptosystem for secure communication (Q1200033) (← links)
- A uniform-complexity treatment of encryption and zero-knowledge (Q1207696) (← links)
- Cascade ciphers: The importance of being first (Q1207697) (← links)
- Aspects of the Clausius-Shannon identity: Emphasis on the components of transitive information in linear, branched and composite physical systems (Q1218395) (← links)
- Cryptology: The mathematics of secure communication (Q1259538) (← links)
- Secret sharing over infinite domains (Q1261017) (← links)
- Invertible shift-invariant transformations on binary arrays (Q1332378) (← links)
- An analysis of a class of algorithms for \(S\)-box construction (Q1335025) (← links)
- Algebraic nonlinearity and its applications to cryptography (Q1340195) (← links)
- The unicity distance: An upper bound on the probability of an eavesdropper successfully estimating the secret key (Q1350004) (← links)
- A construction of a cipher from a single pseudorandom permutation. (Q1364898) (← links)
- Cartesian authentication codes from functions with optimal nonlinearity. (Q1401188) (← links)
- Chaos-based cryptograph incorporated with \(S\)-box algebraic operation (Q1411845) (← links)
- A novel method for designing S-boxes based on chaotic maps (Q1771612) (← links)
- A method for designing dynamical S-boxes based on discretized chaotic map (Q1771769) (← links)
- Symmetry of information and one-way functions (Q1802066) (← links)
- On the confusion and diffusion properties of Maiorana-McFarland's and extended Maiorana-McFarland's functions (Q1827565) (← links)
- Connections among nonlinearity, avalanche and correlation immunity (Q1870563) (← links)
- A symmetric image encryption scheme based on 3D chaotic cat maps (Q1878247) (← links)
- Authentication codes in plaintext and chosen-content attacks (Q1910424) (← links)
- Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes (Q1910425) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- Substitution-permutation networks resistant to differential and linear cryptanalysis (Q1912767) (← links)