Pages that link to "Item:Q3645296"

The following pages link to Communication Theory of Secrecy Systems* (Q3645296):

Displaying 50 items.

• Latin squares over Abelian groups (Q950849) (← links)
• Image encryption with chaotically coupled chaotic maps (Q957610) (← links)
• Nonrelatively measurable functions for secure communications signal design (Q971082) (← links)
• Information protection based on nanosecond synchronization of time scales in meteor burst channel (Q1002998) (← links)
• Group theoretic properties of Rijndael-like ciphers (Q1003702) (← links)
• A synthetic indifferentiability analysis of some block-cipher-based hash functions (Q1009050) (← links)
• Quantum uncertainty and the spectra of symmetric operators (Q1027799) (← links)
• On the impossibility of highly-efficient blockcipher-based hash functions (Q1027986) (← links)
• Chaotic image encryption design using Tompkins-Paige algorithm (Q1036462) (← links)
• Prediction, retrodiction, and the amount of information stored in the present (Q1040715) (← links)
• On complexity of round transformations (Q1045033) (← 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)
• On key and message equivocation in secrecy systems (Q1276791) (← links)
• Some information-theoretic problems of discrete data protection (Q1280745) (← 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 simply realizable ideal cryptographic system (Q1582938) (← links)
• Ising game: nonequilibrium steady states of resource-allocation systems (Q1620485) (← links)
• Information-theoretic secret-key agreement: the asymptotically tight relation between the secret-key rate and the channel quality ratio (Q1629419) (← links)
• Confidentiality and differential privacy in the dissemination of frequency tables (Q1630396) (← links)
• Analysis of the time series generated by a new high-dimensional discrete chaotic system (Q1635056) (← links)
• Semi-quantum dialogue based on single photons (Q1640127) (← links)
• A method to calculate differential uniformity for permutations (Q1647569) (← links)
• Public-key quantum digital signature scheme with one-time pad private-key (Q1653902) (← links)
• Secure image encryption algorithm design using a novel chaos based S-Box (Q1674293) (← links)
• Integration of quantum key distribution and private classical communication through continuous variable (Q1698790) (← links)
• Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses (Q1706614) (← links)
• Entropy dimension reduction method for randomized machine learning problems (Q1717049) (← links)
• An efficient diffusion scheme for chaos-based digital image encryption (Q1718364) (← links)