Cryptanalysis of ciphers has been successfully demonstrated through several techniques such as brute force attack, linear and differential cryptanalysis and heuristic optimisation methods. To demonstrate the power of heuristic optimisation techniques for attacks of modern-day ciphers, we present for the first time systematic experiments on heuristic-based attacks of modified versions of data encryption standard (DES) with 48 bits. A novel contribution of this work lies in combining the features of differential cryptanalysis and heuristic optimisation methods. This is possible by using differential cryptanalysis to obtain 42 bits of the key whereas the remaining missing 14 key bits are obtained through heuristic optimisation methods by a choice of suitable composite fitness function to capture this combined use of both these approaches. The studies reported in this paper will be useful for the attacks of other similar ciphers.
{"title":"Cryptanalysis of Block Ciphers via Improved Simulated Annealing Technique","authors":"N. Nalini, G. R. Rao","doi":"10.1109/ICIT.2006.40","DOIUrl":"https://doi.org/10.1109/ICIT.2006.40","url":null,"abstract":"Cryptanalysis of ciphers has been successfully demonstrated through several techniques such as brute force attack, linear and differential cryptanalysis and heuristic optimisation methods. To demonstrate the power of heuristic optimisation techniques for attacks of modern-day ciphers, we present for the first time systematic experiments on heuristic-based attacks of modified versions of data encryption standard (DES) with 48 bits. A novel contribution of this work lies in combining the features of differential cryptanalysis and heuristic optimisation methods. This is possible by using differential cryptanalysis to obtain 42 bits of the key whereas the remaining missing 14 key bits are obtained through heuristic optimisation methods by a choice of suitable composite fitness function to capture this combined use of both these approaches. The studies reported in this paper will be useful for the attacks of other similar ciphers.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115711401","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Radio Frequency Identification (RFID) is slated to become a standard for tagging various products. As more and more products become RFID enabled, fast tag identification mechanisms will become important. Various tag identifica tion (or anti-collision) algorithms have been proposed for RFID systems. This work focuses on methods to improve tag read efficiency in RFID Systems. In this paper, we propose an Intelligent Query Tree (IQT) Protocol for tag identification that exploits specific prefix patterns in the tags and make the identification process more efficient. IQT is a memoryless protocol that identifies RFID tags more efficiently in scenarios where tag IDs have some common prefix (e.g., common vendor ID or product ID). IQT is suitable for readers deployed in exclusive showrooms, shipment points of big malls, where the products may come from same manufacturer and may have same product IDs. We provide the worst case complexity analysis of IQT and show the performance improve ment of this protocol over traditional Query Tree protocol in different scenarios.
{"title":"Intelligent Query Tree (IQT) Protocol to Improve RFID Tag Read Efficiency","authors":"Naval Bhandari, A. Sahoo, S. Iyer","doi":"10.1109/ICIT.2006.61","DOIUrl":"https://doi.org/10.1109/ICIT.2006.61","url":null,"abstract":"Radio Frequency Identification (RFID) is slated to become a standard for tagging various products. As more and more products become RFID enabled, fast tag identification mechanisms will become important. Various tag identifica tion (or anti-collision) algorithms have been proposed for RFID systems. This work focuses on methods to improve tag read efficiency in RFID Systems. In this paper, we propose an Intelligent Query Tree (IQT) Protocol for tag identification that exploits specific prefix patterns in the tags and make the identification process more efficient. IQT is a memoryless protocol that identifies RFID tags more efficiently in scenarios where tag IDs have some common prefix (e.g., common vendor ID or product ID). IQT is suitable for readers deployed in exclusive showrooms, shipment points of big malls, where the products may come from same manufacturer and may have same product IDs. We provide the worst case complexity analysis of IQT and show the performance improve ment of this protocol over traditional Query Tree protocol in different scenarios.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114914194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Running real time applications over wireless LANs is becoming common place. These applications require QoS. But the most widely used wireless LAN, IEEE 802.11, does not have QoS support. Hence, providing QoS in 802.11 WLANs is an important issue due to its large installation base. In this paper, we propose a priority based service differentiation mechanism at the MAC layer. The MAC assigns different contention windows to two priority classes to provide service differentiation. The MAC protocol was designed such that minimal change is required in 802.11 firmware and yet the performance is comparable to 802.11e MAC. When collision occurs, contention window is increased in a linear fashion and the new contention windows for high and low priority traffic become non-contiguous. This unique method of contention window management provides better relative performance between the two classes. We also propose an enhancement to our base protocol that further increases throughput at light load condition. We present our simulation experiment results that show that our protocol has performance comparable to 802.11e.
{"title":"A Contention Window Based Differentiation Mechanism for providing QoS in Wireless LANs","authors":"Mayank Mishra, A. Sahoo","doi":"10.1109/ICIT.2006.6","DOIUrl":"https://doi.org/10.1109/ICIT.2006.6","url":null,"abstract":"Running real time applications over wireless LANs is becoming common place. These applications require QoS. But the most widely used wireless LAN, IEEE 802.11, does not have QoS support. Hence, providing QoS in 802.11 WLANs is an important issue due to its large installation base. In this paper, we propose a priority based service differentiation mechanism at the MAC layer. The MAC assigns different contention windows to two priority classes to provide service differentiation. The MAC protocol was designed such that minimal change is required in 802.11 firmware and yet the performance is comparable to 802.11e MAC. When collision occurs, contention window is increased in a linear fashion and the new contention windows for high and low priority traffic become non-contiguous. This unique method of contention window management provides better relative performance between the two classes. We also propose an enhancement to our base protocol that further increases throughput at light load condition. We present our simulation experiment results that show that our protocol has performance comparable to 802.11e.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117095125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Bramari is one part of the Pranayama, as traditionally conceived, involves much more than merely breathing for relaxation. Bramari is a term with a wide range of meanings. "The regulation of the incoming and outgoing flow of breath with retention". Bramari also denotes cosmic power, or the power of the entire universe which manifests itself as conscious living being in us through the phenomenon of breathing. Because of this connection between breath and consciousness. Pranayama has devised Bramari to stabilize energy and consciousness. A wavelet transformation is applied to electroencephalograph (EEG) records from persons under Bramari. Correlation dimension, Largest Lyapunov exponent, Approximate entropy and coherence values are analyzed. This model along with software is used to keep track on the improvement of the persons mind, aging, balance, flexibility, personnel values, mental values, social values, love, sex, knowledge, weight reduction and body fitness.
{"title":"Electroencephalograph Signal Analysis During Bramari","authors":"S. Patil, D. Bormane","doi":"10.1109/ICIT.2006.50","DOIUrl":"https://doi.org/10.1109/ICIT.2006.50","url":null,"abstract":"Bramari is one part of the Pranayama, as traditionally conceived, involves much more than merely breathing for relaxation. Bramari is a term with a wide range of meanings. \"The regulation of the incoming and outgoing flow of breath with retention\". Bramari also denotes cosmic power, or the power of the entire universe which manifests itself as conscious living being in us through the phenomenon of breathing. Because of this connection between breath and consciousness. Pranayama has devised Bramari to stabilize energy and consciousness. A wavelet transformation is applied to electroencephalograph (EEG) records from persons under Bramari. Correlation dimension, Largest Lyapunov exponent, Approximate entropy and coherence values are analyzed. This model along with software is used to keep track on the improvement of the persons mind, aging, balance, flexibility, personnel values, mental values, social values, love, sex, knowledge, weight reduction and body fitness.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132322526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web searching is perhaps the second most popular activity on Internet. Millions of users search the Web daily for their purpose. But as there are a number of search engines available, there must be some procedure to evaluate them. In this paper, we try to present an effort in this regard. For subjective measure, we are taking into account the "satisfaction " a user gets when presented with search results. The feedback of the user is inferred from watching the actions of the user on the search results presented before him in response to his query. For objective measures, we use Vector space model and Boolean similarity measures. All the three measures are aggregated using modified Shimura technique of rank aggregation. The aggregated ranking is then compared with the original ranking given by the search engine. The correlation coefficient thus obtained is averaged for a set of queries. We show our experimental results pertaining to seven public search engines and fifteen queries.
{"title":"Aggregating Subjective and Objective Measures of Web Search Quality using Modified Shimura Technique","authors":"R. Ali, M. Beg","doi":"10.1109/ICIT.2006.24","DOIUrl":"https://doi.org/10.1109/ICIT.2006.24","url":null,"abstract":"Web searching is perhaps the second most popular activity on Internet. Millions of users search the Web daily for their purpose. But as there are a number of search engines available, there must be some procedure to evaluate them. In this paper, we try to present an effort in this regard. For subjective measure, we are taking into account the \"satisfaction \" a user gets when presented with search results. The feedback of the user is inferred from watching the actions of the user on the search results presented before him in response to his query. For objective measures, we use Vector space model and Boolean similarity measures. All the three measures are aggregated using modified Shimura technique of rank aggregation. The aggregated ranking is then compared with the original ranking given by the search engine. The correlation coefficient thus obtained is averaged for a set of queries. We show our experimental results pertaining to seven public search engines and fifteen queries.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122631532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the increase in need for strong security systems, the biometric systems are becoming more and more popular. These systems are based on human traits which, unlike passwords or pins, cannot be lost, stolen or forgotten. One such trait is ear. With the initial doubts on uniqueness of ear, ear biometrics could not attract much attention. But after it has been said that it is almost impossible to find two ears with all the parts identical, ear biometrics has gained its pace. In this paper a simple scale and rotation invariant two-stage geometric approach which is based on the concept of max-line, the longest line that has both its end-points on the edges of the ear, is proposed.
{"title":"A Simple Geometric Approach for Ear Recognition","authors":"Dasari Shailaja, Phalguni Gupta","doi":"10.1109/ICIT.2006.20","DOIUrl":"https://doi.org/10.1109/ICIT.2006.20","url":null,"abstract":"With the increase in need for strong security systems, the biometric systems are becoming more and more popular. These systems are based on human traits which, unlike passwords or pins, cannot be lost, stolen or forgotten. One such trait is ear. With the initial doubts on uniqueness of ear, ear biometrics could not attract much attention. But after it has been said that it is almost impossible to find two ears with all the parts identical, ear biometrics has gained its pace. In this paper a simple scale and rotation invariant two-stage geometric approach which is based on the concept of max-line, the longest line that has both its end-points on the edges of the ear, is proposed.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128066254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kundan Kumar, Debdeep Mukhopadhyay, D. R. Chowdhury
In this paper we propose a new exponentiation architecture in GF(2m). The core of the architecture is a parallel structure for multiplication and squaring, which is based on the state transitions of programmable cellular automata (CA). The proposed architecture requires hardware of the order m2 and the time complexity is m. The performance of the design outperformed existing architectures based on systolic array and cellular automata. The design can thus be effectively applied in public key cryptosystems like ElGamal and Diffie-Hellman Key exchange. The regular, cascadable structure of the cellular automata leads to extremely scalable VLSI design.
{"title":"A Programmable Parallel Structure to perform Galois Field Exponentiation","authors":"Kundan Kumar, Debdeep Mukhopadhyay, D. R. Chowdhury","doi":"10.1109/ICIT.2006.18","DOIUrl":"https://doi.org/10.1109/ICIT.2006.18","url":null,"abstract":"In this paper we propose a new exponentiation architecture in GF(2m). The core of the architecture is a parallel structure for multiplication and squaring, which is based on the state transitions of programmable cellular automata (CA). The proposed architecture requires hardware of the order m2 and the time complexity is m. The performance of the design outperformed existing architectures based on systolic array and cellular automata. The design can thus be effectively applied in public key cryptosystems like ElGamal and Diffie-Hellman Key exchange. The regular, cascadable structure of the cellular automata leads to extremely scalable VLSI design.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114397457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Automatic form processing is an important application of document analysis subject. Such a system requires to be trained and tested on a standard database of forms collected from real-life. However, to the best of our knowledge, the only such available databases are NIST Special Databases. These databases consist of images of synthesized form documents. On the other hand, recently we developed a form database, samples of which had been taken from the real-life. ISIFormReader, a form processing system, also developed recently, has been tested using these real-life samples. An intensive study of the processing errors showed that writers' idiosyncracies are one of the major reasons of such errors as analyzed in U. Bhattacharya, et al., (2006). In the present paper, we investigated various other sources of errors which together cause a major concern. These include sample forms which are low in contrast, noisy, smudgy, skewed, scaled disturbing its aspect ratio and so on. An analysis of errors due to similar such sources is important towards development of an improved form processing system.
{"title":"Analysis of Error Sources Towards Improved Form Processing","authors":"U. Bhattacharya, Bikash Shaw, S. K. Parui","doi":"10.1109/ICIT.2006.30","DOIUrl":"https://doi.org/10.1109/ICIT.2006.30","url":null,"abstract":"Automatic form processing is an important application of document analysis subject. Such a system requires to be trained and tested on a standard database of forms collected from real-life. However, to the best of our knowledge, the only such available databases are NIST Special Databases. These databases consist of images of synthesized form documents. On the other hand, recently we developed a form database, samples of which had been taken from the real-life. ISIFormReader, a form processing system, also developed recently, has been tested using these real-life samples. An intensive study of the processing errors showed that writers' idiosyncracies are one of the major reasons of such errors as analyzed in U. Bhattacharya, et al., (2006). In the present paper, we investigated various other sources of errors which together cause a major concern. These include sample forms which are low in contrast, noisy, smudgy, skewed, scaled disturbing its aspect ratio and so on. An analysis of errors due to similar such sources is important towards development of an improved form processing system.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124822538","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As technology scales down to nanometer technology, coupling effects between neighboring wires have a significant impact on power consumption and signal integrity on on-chip interconnects. Especially, on-chip inductive effects need to be taken into account due to low-resistance metal interconnection and fast signal transition times in nowadays IC design. In this paper, we propose a low power bus encoding scheme which reduces the capacitive and inductive effects between bus wires simultaneously by the measurement of real RLC model. The experimental results showed that our approach can save power consumption of the bus up to 15%.
{"title":"DS2IS: Dictionary-based Segmented Signal Inversion Scheme for Low Power Dynamic Bus Design","authors":"Shang-Fang Tsai, S. Ruan","doi":"10.1109/ICIT.2006.47","DOIUrl":"https://doi.org/10.1109/ICIT.2006.47","url":null,"abstract":"As technology scales down to nanometer technology, coupling effects between neighboring wires have a significant impact on power consumption and signal integrity on on-chip interconnects. Especially, on-chip inductive effects need to be taken into account due to low-resistance metal interconnection and fast signal transition times in nowadays IC design. In this paper, we propose a low power bus encoding scheme which reduces the capacitive and inductive effects between bus wires simultaneously by the measurement of real RLC model. The experimental results showed that our approach can save power consumption of the bus up to 15%.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125411692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
An important approach for image segmentation is clustering the pixels based on their spectral properties. In this paper, a newly developed point symmetry distance is used to propose a new cluster validity index named S-index (Symmetry distance based index) which can provide a measure of goodness of clustering on different partitions of a data set. We have used one genetic clustering algorithm for partitioning the data set. Results demonstrating the superiority of the S-index in appropriately determining the number of clusters as compared to two other recently proposed measures, namely the PS index and PBM index, are provided for automatically classifying different landcover regions in remote sensing imagery.
图像分割的一个重要方法是根据像素的光谱特性对其进行聚类。本文利用新提出的点对称距离，提出了一种新的聚类有效性指标S-index (symmetry distance based index)，该指标可以衡量数据集在不同分区上聚类的优劣。我们使用了一种遗传聚类算法来划分数据集。与PS指数和PBM指数这两种最近提出的方法相比，s指数在适当确定聚类数量方面具有优势，可用于遥感影像中不同土地覆盖区域的自动分类。
{"title":"A New Symmetry Based Cluster Validity Index: Application to Satellite Image Segmentation","authors":"S. Saha, S. Bandyopadhyay, U. Maulik","doi":"10.1109/ICIT.2006.15","DOIUrl":"https://doi.org/10.1109/ICIT.2006.15","url":null,"abstract":"An important approach for image segmentation is clustering the pixels based on their spectral properties. In this paper, a newly developed point symmetry distance is used to propose a new cluster validity index named S-index (Symmetry distance based index) which can provide a measure of goodness of clustering on different partitions of a data set. We have used one genetic clustering algorithm for partitioning the data set. Results demonstrating the superiority of the S-index in appropriately determining the number of clusters as compared to two other recently proposed measures, namely the PS index and PBM index, are provided for automatically classifying different landcover regions in remote sensing imagery.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130137379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：