An improved secure code encryption approach based on indexed table

Sasirekha, N.; Hemalatha, M.

doi:10.1145/2345396.2345578

Cited by 3 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…53,54 It aims at preventing reverse engineering and executable tampering. 53,54 It aims at preventing reverse engineering and executable tampering.…”

Section: Other Applicationsmentioning

confidence: 99%

“…Software protection is another practical application of quasigroup cryptography. 53,54 It aims at preventing reverse engineering and executable tampering. The algorithm uses a quasigroup-based cipher in combination with chained Hadamard transforms and number theoretic transforms to encrypt program index table.…”

Section: Other Applicationsmentioning

confidence: 99%

“…Software protection is another practical application of quasigroup cryptography . It aims at preventing reverse engineering and executable tampering.…”

Section: Quasigroups In Computer Security and Cryptographymentioning

confidence: 99%

See 2 more Smart Citations

An acceleration of quasigroup operations by residue arithmetic

Krömer

Platoš

Nowaková

et al. 2017

Concurrency and Computation

View full text Add to dashboard Cite

Quasigroup operations are essential for a wide range of cryptographic procedures that includes cryptographic hash functions, electronic signatures, pseudorandom number generators, and stream and block ciphers. Quasigroup cryptography achieves high levels of security at low memory and computational costs by an iterative application of quasigroup operations to streams and blocks of data. The use of large quasigroups can further improve the strength of cryptographic operations. However, the order of used quasigroups is the main factor affecting the memory requirements of quasigroup cryptographic schemes. Alternative quasigroup representations that do not store their multiplication tables in computer memory yield increased computational costs.In any case, an efficient implementation of quasigroup operations is critical for practical applications of quasigroup cryptography. Residue number systems allow a fast, concurrent realization of addition and multiplication. In this work, residue arithmetic is used to accelerate quasigroup operations, and an efficient computational approach to their implementation, designed with respect to the extended instruction sets of modern processors, is proposed. KEYWORDSacceleration, quasigroup operations, residue arithmetic, residue number systems, security INTRODUCTIONQuasigroups are algebraic structures with a large number of applications in cryptography and computer security. 1-5 A quasigroup consists of a set of elements (carrier) and a binary operation (multiplication) that maps every 2 of its elements onto a third element. Mathematically, they are grupoids closely related to the combinatorial concept of latin squares 2,3,6,7 and the geometric notion of k−nets (3−nets). 2,8 Multiplication (Cayley) tables of finite quasigroups can be expressed as latin squares, and k−nets can be coordinatized by systems of orthogonal quasigroups.In general, quasigroups are noncommutative, nonassociative, nonidempotent, and noninvolutory and do not have neutral elements. 9 These properties make them suitable for applications in cryptography, and they have been used as fundamental elements of a wide range of cryptographic algorithms with success. Their applications in this area include novel high-performance stream 4-6,10-13 and block 4,5,14-22 ciphers, cryptographic hash 4,5,23-27 and trapdoor 4,14,23 functions, fast and secure electronic signatures (eg, message authentication codes), 4,14,23,28 pseudorandom number generators, 5,29-31 error-detecting 2 and error-correcting 2,9,32 codes, and simultaneous encryption and error-correction coding (cryptcoding). 4Quasigroups can be also used to model cryptosystems based on other cryptographic primitives. A quasigroup representation has been devised for block ciphers based on Feistel networks (ie, Feistel and generalized Feistel ciphers). 33The attractiveness of quasigroups for practical cryptographic applications consists in the combination of provably strong security and inexpensive realization of quasigroup-based cryptographic operations. They support la...

show abstract

“…53,54 It aims at preventing reverse engineering and executable tampering. 53,54 It aims at preventing reverse engineering and executable tampering.…”

Section: Other Applicationsmentioning

confidence: 99%

Section: Other Applicationsmentioning

confidence: 99%

See 1 more Smart Citation

An acceleration of quasigroup operations by residue arithmetic

Krömer

Platoš

Nowaková

et al. 2017

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…Key management is the essential segment of the code encryption approach. Thus, (Sungkyu Cho et al 2011) [19,33,34].proposed an approach which analyzed the previous code encryption approaches and then presented a code encryption scheme based on an indexed table.…”

Section: Literature Surveymentioning

confidence: 99%

“…Moreover, time cost and space cost should also be taken into consideration. Thus, a novel cryptographic technique is proposed in this approach which is the extension of the (Sungkyu Cho et al 2011) approach [19,33,34].…”

Section: Literature Surveymentioning

confidence: 99%

An Enhanced Code Encryption Approach with HNT Transformations for Software Security

Sasirekha¹,

Hemalatha²

2012

IJCA

View full text Add to dashboard Cite

Security threats such as viruses, worms, trojans and spyware affects the security and authentication of software codes, forcing software developers to build security schemes for better software protection. These software threats exploit the authenticated data of the software and confidentiality, integrity and accessibility is greatly affected by these software threats. A number of code security techniques like tamper resistant packaging, code obfuscation, register encoding etc have been developed which mainly concentrates on providing solutions for a particular type of threats and are vulnerable to code tampering and code injection by complicated attackers. Hence, code encryption technique has become an active area of research. This paper proposes a novel software protection code encryption scheme based on the index table. This approach uses a novel and efficient encryption technique called quasigroup encryption for encryption the indexed table. It provides least resemblance of the original data when encrypted. But, quasi group encryption is not efficient in diffusing the statistics of the plain text. This drawback can be overcome by using transforms. Hence, this approach uses chained Hadamard transforms and Number Theoretic Transforms to introduce diffusion along with the quasigroup transformation. The proposed approach is compared with the other encryption approaches and is observed to provide better results.

show abstract

An efficient secure code approach based on indexed table quasi group encryption with Hadamard and Number Theoretic Transformation for software protection

Sasirekha

Hemalatha

2012

Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology

View full text Add to dashboard Cite

An improved secure code encryption approach based on indexed table

Cited by 3 publications

References 5 publications

An acceleration of quasigroup operations by residue arithmetic

An acceleration of quasigroup operations by residue arithmetic

An Enhanced Code Encryption Approach with HNT Transformations for Software Security

An efficient secure code approach based on indexed table quasi group encryption with Hadamard and Number Theoretic Transformation for software protection

Contact Info

Product

Resources

About