{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:04:12Z","timestamp":1729634652154,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/aiccsa.2005.1387083","type":"proceedings-article","created":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T15:16:50Z","timestamp":1112368610000},"page":"481-486","source":"Crossref","is-referenced-by-count":1,"title":["An encryption algorithm based on alphabetic trees"],"prefix":"10.1109","author":[{"given":"S.M.","family":"Arafat","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1117\/12.451256"},{"key":"17","first-page":"925","article-title":"On the security of an image encryption method","volume":"2","author":"li","year":"0","journal-title":"Proc 1st IEEE Int Conf Image Process"},{"key":"18","first-page":"267","article-title":"A cryptanlytic attack on RC4 stream cipher","volume":"3","author":"tomasevic","year":"2004","journal-title":"WSEAS Transaction on Computers"},{"journal-title":"Applied Cryptography","year":"1996","author":"schneier","key":"15"},{"journal-title":"Cryptography and Network Security","year":"2003","author":"stallings","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/113379.113386"},{"key":"14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1006\/jpdc.1996.0067","article-title":"A parallel algorithm for almost optimal alphabetic trees","author":"larmore","year":"1996","journal-title":"Journal on Parallel and Distributed Computing"},{"key":"11","article-title":"Merging optimal alphabetic trees in linear time","author":"belal","year":"2002","journal-title":"Proceedings of the First International Conference on Intelligent Computing & Information Systems ICICIS 2002"},{"key":"12","article-title":"Building optimal alphabetic trees recursively","author":"belal","year":"2002","journal-title":"Proceedings of the 3rd WSEAS International Multiconference on Mathematics Math 2002"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.1998.740527"},{"key":"20","first-page":"430","article-title":"A new image encryption algorithm and its VLSI architecture","author":"yen","year":"1999","journal-title":"Proceedings of IEEE Workshop Signal Processing Systems"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/S0923-5965(96)00025-2"},{"key":"23","article-title":"A Novel fast image encryption scheme based on 3d chaotic baker maps","author":"mao","year":"2003","journal-title":"International Journal of Bifurcation and Chaos"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1959.tb01583.x"},{"journal-title":"Information Theory and Reliable Communications","year":"1968","author":"gallager","key":"25"},{"journal-title":"On Optimal Searching in Multi-dimensional Data with Skewed Access Distribution","year":"1997","author":"ahmed","key":"26"},{"journal-title":"Operating on Optimal Binary Code Trees","year":"2001","author":"arafat","key":"27"},{"journal-title":"The Design of Rijndael The Wide Trail Strategy Explained","year":"2000","author":"daemen","key":"28"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00193-3"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/0206045"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/0121057"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61576-8_86"},{"key":"1","volume":"3","author":"knuth","year":"1973","journal-title":"The Art of Computer Programming Volume 3 Sorting and Searching"},{"journal-title":"Hu Tucker Algorithm for Building Optimal Alphabetic Binary Search Trees","year":"1998","author":"davis","key":"7"},{"key":"6","article-title":"Limiting the search for 2-dimensional optimal alphabetic trees","author":"belal","year":"1998","journal-title":"Proceedings of the 4th International Joint Conference on Information Sciences"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(96)00135-1"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211009"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58201-0_73"},{"key":"8","first-page":"185","article-title":"Upper and lower bounds on constructing alphabetic binary trees","author":"klawe","year":"1993","journal-title":"Proc the 4th annual ACM-SIAM Symposium on Discrete algorithms"}],"event":{"name":"The 3rd ACS\/IEEE International Conference onComputer Systems and Applications, 2005.","location":"Cairo, Egypt"},"container-title":["The 3rd ACS\/IEEE International Conference onComputer Systems and Applications, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9525\/30191\/01387083.pdf?arnumber=1387083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T13:53:12Z","timestamp":1497621192000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1387083\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/aiccsa.2005.1387083","relation":{},"subject":[]}}