Optimal insertion in two-dimensional arrays

Ahmed, Magdy A.; Belal, A.; Ahmed, Khalil

doi:10.1016/s0020-0255(96)00135-1

Cited by 3 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first LMCP is chosen from (7,4), (4,6), (6,2) and (2,5) and found to be (2,5) so they will be replaced by the internal node 7. Then the next one is (4,6) forming the second internal node 10.…”

Section: Examplementioning

confidence: 99%

See 1 more Smart Citation

An encryption algorithm based on alphabetic trees

Arafat

The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.

View full text Add to dashboard Cite

Optimal alphabetic trees (OATs) are known to be used in several application areas, such as coding, probabilistic retrieval systems and VLSI design. In this paper, we introduce a novel encryption algorithm, Alphabetic Tree Cipher (ATC), based on an interesting property of OATs. A theorem is presented to define a family of weight lists that all have the same OAT of a given weight list (and consequently the same level values). Considering the plain text to be the original weight list, a key is used to select one from the family of equivalent weight lists to be the cipher text. While finding the levels of the cipher text is easy, finding the corresponding plain text without knowledge of the key is not. The security of the algorithm is analyzed and discussed under dif f erent block encryption modes, and against different kinds of attacks.

show abstract

Section: Examplementioning

confidence: 99%

“…The use of the I-dimensional O(n log n) algorithm for 2-dimensional information retrieval was considered in [5,6]. Like Huffman trees, OATs can be used in compression and coding.…”

Section: Introductionmentioning

confidence: 99%