Communication Theory of Secrecy Systems*
From MaRDI portal
Publication:3645296
DOI10.1002/J.1538-7305.1949.TB00928.XzbMATH Open1200.94005OpenAlexW2109394932WikidataQ1053345 ScholiaQ1053345MaRDI QIDQ3645296FDOQ3645296
Authors: Claude Shannon 
Publication date: 17 November 2009
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1949.tb00928.x
Recommendations
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Communication theory (94A05) Cryptography (94A60)
Cited In (only showing first 100 items - show all)
- On the fractional-order extended Kalman filter and its application to chaotic cryptography in noisy environment
- Stream/block ciphers, difference equations and algebraic attacks
- Involutory-multiple-lightweight MDS matrices based on Cauchy-type matrices
- A framework to optimize implementations of matrices
- A compressive sensing based privacy preserving outsourcing of image storage and identity authentication service in cloud
- Elements of randomized forecasting and its application to daily electrical load prediction in a regional power system
- Generative adversarial networks-based pseudo-random number generator for embedded processors
- On the optimality of quantum encryption schemes
- Data driven computing with noisy material data sets
- OAEP Is Secure under Key-Dependent Messages
- Public-key quantum digital signature scheme with one-time pad private-key
- Prospects of quantum-classical optimization for digital design
- Authenticated key agreement in dynamic peer groups
- Tight bounds for the eavesdropping collective attacks on general CV-QKD protocols that involve non-maximally entanglement
- Building blockcipher from small-block tweakable blockcipher
- Construction of lightweight S-boxes using Feistel and MISTY structures
- Confidentiality and differential privacy in the dissemination of frequency tables
- Lightweight MDS generalized circulant matrices
- Error correcting codes, block designs, perfect secrecy and finite fields
- Entropy dimension reduction method for randomized machine learning problems
- Cellular automata based S-boxes
- Exploiting randomness on continuous sets
- A chaos-based approach to the design of cryptographically secure substitutions
- An image encryption scheme using nonlinear inter-pixel computing and swapping based permutation approach
- On integrating confidentiality and functionality in a formal method
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation
- A chaos-based image encryption algorithm with variable control parameters
- An analysis of the blockcipher-based hash functions from PGV
- The combinatorics of authentication and secrecy codes
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- Wavelet packet transform-based robust video watermarking technique
- Permutation polynomials modulo \(2^w\)
- On the impossibility of highly-efficient blockcipher-based hash functions
- CS-Cipher
- Some results onq-ary bent functions
- Quantum uncertainty and the spectra of symmetric operators
- Title not available (Why is that?)
- Chaotic image encryption design using Tompkins-Paige algorithm
- Substitution-permutation networks resistant to differential and linear cryptanalysis
- GLS coding based security solution to JPEG with the structure of aggregated compression and encryption
- Modified Baptista type chaotic cryptosystem via matrix secret key
- Entanglement and Entropic Uncertainty of Two Two‐Level Atoms
- Authentication codes and bipartite graphs
- A chaotic secure communication scheme based on synchronization of double-layered and multiple complex networks
- Implementing a chaotic cryptosystem in a 64-bit embedded system by using multiple-precision arithmetic
- On entropy, information inequalities, and groups
- Exposed-key weakness of \(\alpha \eta \)
- On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
- Chaotic hash function based on circular shifts with variable parameters
- Experimental realization of a highly secure chaos communication under strong channel noise
- A fast software one-way hash function
- Security risk during the transient in a key exchange protocol using random signals and feedback
- Cryptology: The mathematics of secure communication
- Polynomially complete quasigroups of prime order
- A novel 1D hybrid chaotic map-based image compression and encryption using compressed sensing and Fibonacci-Lucas transform
- A novel algorithm for image encryption based on couple chaotic systems
- Permutation and sampling with maximum length CA or pseudorandom number generation
- Not all (possibly) “random” sequences are created equal
- Randomized machine learning of nonlinear models with application to forecasting the development of an epidemic process
- Doubly perfect nonlinear Boolean permutations
- Synchronization of different dimensions fractional-order chaotic systems with uncertain parameters and secure communication
- Wave-shaped round functions and primitive groups
- Construction and search of balanced Boolean functions on even number of variables towards excellent autocorrelation profile
- Title not available (Why is that?)
- FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR
- Connections among nonlinearity, avalanche and correlation immunity
- Digital image scrambling based on a new one-dimensional coupled sine map
- From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
- Fault tolerant authenticated quantum dialogue based on logical qubits and controlled-not operations
- Properties of two Shannon's ciphers
- A new synchronisation method of fractional-order chaotic systems with distinct orders and dimensions and its application in secure communication
- Secure image encryption algorithm design using a novel chaos based S-Box
- Survey on hardware implementation of random number generators on FPGA: theory and experimental analyses
- The Vernam cipher is robust to small deviations from randomness
- Cryptanalysis of a classical chaos-based cryptosystem with some quantum cryptography features
- Semi-quantum dialogue based on single photons
- Absolutely secure message transmission using a key sharing graph
- Authentication codes in plaintext and chosen-content attacks
- Mathematical problems in cryptology
- A method to calculate differential uniformity for permutations
- A novel stream encryption scheme with avalanche effect
- Analysis of bitsum attack on block ciphers
- On APN exponents, characterizations of differentially uniform functions by the Walsh transform, and related cyclic-difference-set-like structures
- Analyzing permutations for AES-like ciphers: understanding shiftrows
- Two intercept-and-resend attacks on a bidirectional quantum secure direct communication and its improvement
- Quantum encryption and generalized Shannon impossibility
- A new password authentication mechanism based on two phases encryption
- Randomness and Representation of Span n Sequences
- New public-key quantum signature scheme with quantum one-way function
- A method for constructing bijective S-box with high nonlinearity based on chaos and optimization
- Composable security against collective attacks of a modified BB84 QKD protocol with information only in one basis
- Illusory decoherence
- Chasing diagrams in cryptography
- Attainable unconditional security for shared-key cryptosystems
- Gate elimination for linear functions and new feebly secure constructions
- Secrecy via Sources and Channels
- A cryptosystem based on cellular automata
- Biunitary constructions in quantum information
- The many entropies in one-way functions
- Circuit complexity of linear functions: gate elimination and feeble security
This page was built for publication: Communication Theory of Secrecy Systems*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3645296)
