Communication Theory of Secrecy Systems*
From MaRDI portal
Publication:3645296
Recommendations
Cited in
(only showing first 100 items - show all)- Tight bounds for the eavesdropping collective attacks on general CV-QKD protocols that involve non-maximally entanglement
- Data driven computing with noisy material data sets
- Construction of lightweight S-boxes using Feistel and MISTY structures
- Experimental realization of a highly secure chaos communication under strong channel noise
- Authentication codes and bipartite graphs
- Cellular automata based S-boxes
- Confidentiality and differential privacy in the dissemination of frequency tables
- A chaos-based approach to the design of cryptographically secure substitutions
- Substitution-permutation networks resistant to differential and linear cryptanalysis
- Chaotic image encryption design using Tompkins-Paige algorithm
- scientific article; zbMATH DE number 7310171 (Why is no real title available?)
- 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
- The combinatorics of authentication and secrecy codes
- OAEP Is Secure under Key-Dependent Messages
- Not all (possibly) “random” sequences are created equal
- Quantum uncertainty and the spectra of symmetric operators
- On the fractional-order extended Kalman filter and its application to chaotic cryptography in noisy environment
- Lightweight MDS generalized circulant matrices
- 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
- 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
- Polynomially complete quasigroups of prime order
- On the optimality of quantum encryption schemes
- A fast software one-way hash function
- On integrating confidentiality and functionality in a formal method
- Ping-pong protocols as prefix grammars: modelling and verification via program transformation
- On the impossibility of highly-efficient blockcipher-based hash functions
- Wavelet packet transform-based robust video watermarking technique
- Security risk during the transient in a key exchange protocol using random signals and feedback
- On entropy, information inequalities, and groups
- A chaos-based image encryption algorithm with variable control parameters
- Error correcting codes, block designs, perfect secrecy and finite fields
- An analysis of the blockcipher-based hash functions from PGV
- Exposed-key weakness of \(\alpha \eta \)
- Exploiting randomness on continuous sets
- Randomized half-ideal cipher on groups with applications to UC (a)PAKE
- An image encryption scheme using nonlinear inter-pixel computing and swapping based permutation approach
- GLS coding based security solution to JPEG with the structure of aggregated compression and encryption
- Modified Baptista type chaotic cryptosystem via matrix secret key
- Prospects of quantum-classical optimization for digital design
- Permutation polynomials modulo \(2^w\)
- Some results onq-ary bent functions
- Public-key quantum digital signature scheme with one-time pad private-key
- Authenticated key agreement in dynamic peer groups
- CS-Cipher
- A compressive sensing based privacy preserving outsourcing of image storage and identity authentication service in cloud
- Entropy dimension reduction method for randomized machine learning problems
- A novel 1D hybrid chaotic map-based image compression and encryption using compressed sensing and Fibonacci-Lucas transform
- On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
- Building blockcipher from small-block tweakable blockcipher
- Entanglement and Entropic Uncertainty of Two Two‐Level Atoms
- Cryptology: The mathematics of secure communication
- Permutation and sampling with maximum length CA or pseudorandom number generation
- A novel algorithm for image encryption based on couple chaotic systems
- Characterization for entropy of shifts of finite type on Cayley trees
- Indifferentiability for public key cryptosystems
- Image encryption using finite-precision error
- An improved QKD protocol without public announcement basis using periodically derived basis
- A new fractional one dimensional chaotic map and its application in high-speed image encryption
- Statistical test criteria for sensitivity indexes of image cryptosystems
- A controller-independent quantum dialogue protocol with four-particle states
- Construction of authentication codes based on orthogonal array and Latin square
- Is it possible to reduce the sizes of stegomessages in associative steganography?
- Algebraic attacks against random local functions and their countermeasures
- The Oribatida v1.3 family of lightweight authenticated encryption schemes
- The fast image encryption algorithm based on lifting scheme and chaos
- On the diffusion of the improved generalized Feistel
- Resilient output regulation in heterogeneous networked systems under Byzantine agents
- A novel method to identify initial values of chaotic maps in cybersecurity
- Feistel-inspired scrambling improves the quality of linear congruential generators
- Semi-quantum dialogue with Bell entangled states
- Mediated semi-quantum secure direct communication
- On cryptographic properties of \((n+1)\)-bit S-boxes constructed by known \(n\)-bit S-boxes
- Adaptive chaotic maps and their application to pseudo-random numbers generation
- Construction of lightweight involutory MDS matrices
- Placing conditional disclosure of secrets in the communication complexity universe
- Cryptanalysis of a DNA-based image encryption scheme
- Cryptanalysis and improvement of a reversible data-hiding scheme in encrypted images by redundant space transfer
- On the relationship between resilient Boolean functions and linear branch number of S-boxes
- Bagua: a NFSR-based stream cipher constructed following confusion and diffusion principles
- Shannon impossibility, revisited
- Fast and secure updatable encryption
- Algorithms for checking some properties of \(n\)-quasigroups
- Counting active S-boxes is not enough
- On the construction of involutory MDS matrices over \(\mathbb{F}_{2^m}\)
- Randomized component based secure secret reconstruction in insecure networks
- A privacy scheme for digital images based on quantum particles
- Some group-theoretical results on Feistel networks in a long-key scenario
- On the power of cascade ciphers
- Identity-based quantum designated verifier signature
- A semi-quantum private comparison with high-level security third party
- Controlled SWAP attack and improved quantum encryption of arbitrated quantum signature schemes
- Quantum Key‐Distribution Protocols Based on a Quantum Version of the Monty Hall Game
- Cryptanalysis of hybrid secure image encryption based on Julia set fractals and three-dimensional Lorenz chaotic map
- Demonstration of the no-hiding theorem on the 5-qubit IBM quantum computer in a category-theoretic framework
- A new matrix form to generate all \(3\times 3\) involutory MDS matrices over \(\mathbb{F}_{2^m}\)
- On Hiding a Plaintext Length by Preencryption
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)
