• Corpus ID: 15895393

Substitution-Permutation Network Cryptosystems Using Key-Dependent S-Boxes

@inproceedings{Keliher1997SubstitutionPermutationNC,
  title={Substitution-Permutation Network Cryptosystems Using Key-Dependent S-Boxes},
  author={Liam Keliher},
  year={1997}
}
Substitution-permutation networks (SPNs) are an important class of private key cryptosystems, having substitution boxes (s-boxes) as a critical internal component. Much of the research into s-boxes has focussed on determining those s-box properties which yield a cryptographically strong SPN. We investigate s-boxes which are generated in a pseudo-random fashion from a key. This approach has the advantage of decreasing the e ectiveness of certain attacks. In addition, combinatorial results give… 

Brownian Techniques for Constructing High-Strong Cryptographic S-boxes

Brownian motion is used to generate strong 8 × 8 S-box generated from Brownian motion using a secret key, which will increase the complexity for cryptanalysis attacks.

Avalanche and Bit Independence Properties for the Ensembles of Randomly Chosen n × n S-Boxes

Cryptographic test methods such as avalanche, strict avalanche and bit independence criteria, which measure the degree of security of the s-boxes of substitution-permutation networks, are applied to randomly generated ensembles of n× n s- boxes to find out to what extent those criteria measure different cryptographic aspects of s-boxing.

An enhanced Blowfish Algorithm based on cylindrical coordinate system and dynamic permutation box

The results showed that the RAF algorithm that integrates the CCS and dynamic P-Box serves as an effective approach that can consume less memory and strengthen security.

Using RC4 and AES Key Schedule to Generate Dynamic S-Box in AES

This article uses RC4 and AES Key Expansion algorithms to generate dynamic S-box for AES to generate more secure S-boxes and examines the security results to find out which one will have better results in security analysis.

Feistel-inspired scrambling improves the quality of linear congruential generators

The Feistel-inspired scrambling technique is modular, and can be applied to any 64-bit PRNG, and it is believed that it can serve as an inexpensive model for a scrambler that can be used with most PRNGs via post-processing.

Randamization Technique for Desiging of Substitution Box in Data Encryption Standard Algorithm

The results of experimentation prove that proposed randomized approach also generate promising results, which can be particularly useful for devices with less processing power.

Abacus : A Candidate for SHA-3

Abacus is a byte-oriented cryptographic sponge that digests a message in one-byte blocks and outputs a hash of any byte length, which makes it resistant to the attacks that plague the MD5/SHA family.

A New Approach on AES to Increase the Resistivity of the Cipher System

The proposed work aims to provide confidentiality through Advanced Encryption Standard (AES) through the addition in the existing AES algorithm by including a new operation called Math Trick and moderately increased security compared to the existing system.

New immobilizer concept based on Scania’s electrical platform

Immobilizers are security systems that are set up and installed in modern vehicles in order to prevent thieves from starting the vehicles. The idea is that if any wrong keys are used to start the v

References

SHOWING 1-10 OF 41 REFERENCES

Constructing Symmetric Ciphers Using the CAST Design Procedure

  • C. Adams
  • Computer Science, Mathematics
    Des. Codes Cryptogr.
  • 1997
This paper describes the CAST design procedure for constructing a family of DES-like Substitution-Permutation Network (SPN) cryptosystems which appear to have good resistance to differential

Differential cryptanalysis of DES-like cryptosystems

A new type of cryptanalytic attack is developed which can break the reduced variant of DES with eight rounds in a few minutes on a personal computer and can break any reduced variantof DES (with up to 15 rounds) using less than 256 operations and chosen plaintexts.

Avalanche Characteristics of Substitution-Permutation Encryption Networks

The results presented in this paper demonstrate that the avalanche behavior of encryption networks can be improved by using larger S- boxes and it is shown that increasing the diffusion properties of the S-boxes or replacing the permutations by diffusive linear transformations is effective in improving the network avalanche characteristics.

Probabilistic completeness of substitution-permutation encryption networks

  • F. Ayoub
  • Computer Science, Mathematics
  • 1982
A variant of the substitution-permutation encryption network, which incorporates random permutations, is presented and shown to retain, with a very high probability, the cryptographically important

On the Design of S-Boxes

The ideas of completeness and the avalanche effect were first introduced by Kam and Davida [1] and Feistel [2], respectively. If a cryptographic transformation is complete, then each ciphertext bit

On the Distribution of Characteristics in Bijective Mappings

It is proved that if π: Z2m→ Z2mis a bijective mapping, then the expected size of the largest entry in the XOR table for π is bounded by 2m, and it is demonstrated that there are easily constructed classes of iterated mappings for which the probability of a differential-like attack succeeding is very small.

Resistance of Balanced s-Boxes to Linear and Differential Cryptanalysis

Enumerating Nondegenerate Permutations

Every cryptosystem with an n-bit block length may be modeled as a system of n-bit boolean equations. The cipher is said to be nondegenerate if the equation fi that describes the output ci is

Linear Cryptanalysis Method for DES Cipher

  • M. Matsui
  • Computer Science, Mathematics
    EUROCRYPT
  • 1993
A new method is introduced for cryptanalysis of DES cipher, which is essentially a known-plaintext attack, that is applicable to an only-ciphertext attack in certain situations.