scholarly journals A method for generation of substitution box based on random selection

Author(s):  
Fırat Artuğer ◽  
Fatih Özkaynak
1979 ◽  
Author(s):  
Gep Colletti
Keyword(s):  

2017 ◽  
Vol 13 (10) ◽  
pp. 6552-6557
Author(s):  
E.Wiselin Kiruba ◽  
Ramar K.

Amalgamation of compression and security is indispensable in the field of multimedia applications. A novel approach to enhance security with compression is discussed in this  research paper. In secure arithmetic coder (SAC), security is provided by input and output permutation methods and compression is done by interval splitting arithmetic coding. Permutation in SAC is susceptible to attacks. Encryption issues associated with SAC is dealt in this research method. The aim of this proposed method is to encrypt the data first by Table Substitution Box (T-box) and then to compress by Interval Splitting Arithmetic Coder (ISAC). This method incorporates dynamic T-box in order to provide better security. T-box is a method, constituting elements based on the random output of Pseudo Random Generator (PRNG), which gets the input from Secure Hash Algorithm-256 (SHA-256) message digest. The current scheme is created, based on the key, which is known to the encoder and decoder. Further, T-boxes are created by using the previous message digest as a key.  Existing interval splitting arithmetic coding of SAC is applied for compression of text data. Interval splitting finds a relative position to split the intervals and this in turn brings out compression. The result divulges that permutation replaced by T-box method provides enhanced security than SAC. Data is not revealed when permutation is replaced by T-box method. Security exploration reveals that the data remains secure to cipher text attacks, known plain text attacks and chosen plain text attacks. This approach results in increased security to Interval ISAC. Additionally the compression ratio  is compared by transferring the outcome of T-box  to traditional  arithmetic coding. The comparison proved that there is a minor reduction in compression ratio in ISAC than arithmetic coding. However the security provided by ISAC overcomes the issues of compression ratio in  arithmetic coding. 


2003 ◽  
Vol 17 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Peggy A. Hite ◽  
John Hasseldine

This study analyzes a random selection of Internal Revenue Service (IRS) office audits from October 1997 to July 1998, the type of audit that concerns most taxpayers. Taxpayers engage paid preparers in order to avoid this type of audit and to avoid any resulting tax adjustments. The study examines whether there are more audit adjustments and penalty assessments on tax returns with paid-preparer assistance than on tax returns without paid-preparer assistance. By comparing the frequency of adjustments on IRS office audits, the study finds that there are significantly fewer tax adjustments on paid-preparer returns than on self-prepared returns. Moreover, CPA-prepared returns resulted in fewer audit adjustments than non CPA-prepared returns.


2012 ◽  
Vol 22 (03) ◽  
pp. 1250007 ◽  
Author(s):  
PEDRO RODRÍGUEZ ◽  
MARÍA CECILIA RIVARA ◽  
ISAAC D. SCHERSON

A novel parallelization of the Lepp-bisection algorithm for triangulation refinement on multicore systems is presented. Randomization and wise use of the memory hierarchy are shown to highly improve algorithm performance. Given a list of selected triangles to be refined, random selection of candidates together with pre-fetching of Lepp-submeshes lead to a scalable and efficient multi-core parallel implementation. The quality of the refinement is shown to be preserved.


1996 ◽  
Vol 68 (3) ◽  
pp. 249-257 ◽  
Author(s):  
Jinliang Wang

SummaryFor a finite diploid population with no mutation, migration and selection, equations for the deviation of observed genotype frequencies from Hardy–Weinberg proportions are derived in this paper for monoecious species and for autosomal and sex-linked loci in dioecious species. It is shown that the genotype frequency deviation in finite random-mating populations results from the difference between the gene frequencies of male and female gametes, which is determined by two independent causes: the gene frequency difference between male and female parents and the sampling error due to the finite number of offspring. Previous studies have considered only one of the causes and the equations derived by previous authors are applicable only in the special case of random selection. The general equations derived here for both causes incorporate the variances and covariances of family size and thus they reduce to previous equations for random selection. Stochastic simulations are run to check the predictions from different formulae. Non-random mating and variation in census size are considered and the applications of the derived formulae are exemplified.


Sign in / Sign up

Export Citation Format

Share Document