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}
Amir Kaivani, A. Zakerolhosseini, S. Gorgin, M. Fazlali
The binary coded decimal (BCD) encoding has always dominated the decimal arithmetic algorithms and their hardware implementation. Due to importance of decimal arithmetic, the decimal format defined in IEEE 754 floating point standard has been revisited. It uses densely packed decimal (DPD) encoding to store significant part of a decimal floating point number. Furthermore in recent years reversible logic has attracted the attention of engineers for designing low power CMOS circuits, as it is not possible to realize quantum computing without reversible logic implementation. This paper derives the reversible implementation of DPD converter to and from conventional BCD format using in IEEE754R.
{"title":"Reversible Implementation of Densely-Packed-Decimal Converter to and from Binary-Coded-Decimal Format Using in IEEE-754R","authors":"Amir Kaivani, A. Zakerolhosseini, S. Gorgin, M. Fazlali","doi":"10.1109/ICIT.2006.78","DOIUrl":"https://doi.org/10.1109/ICIT.2006.78","url":null,"abstract":"The binary coded decimal (BCD) encoding has always dominated the decimal arithmetic algorithms and their hardware implementation. Due to importance of decimal arithmetic, the decimal format defined in IEEE 754 floating point standard has been revisited. It uses densely packed decimal (DPD) encoding to store significant part of a decimal floating point number. Furthermore in recent years reversible logic has attracted the attention of engineers for designing low power CMOS circuits, as it is not possible to realize quantum computing without reversible logic implementation. This paper derives the reversible implementation of DPD converter to and from conventional BCD format using in IEEE754R.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"212 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":"134513744","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}
Mutual authentication between a service provider and its users is essential to prevent unauthorized adversaries from misutilizing system resources. The traditional method of password table lookups is not scalable and is susceptible to overloading. Therefore this paper proposes a cellular automata based remote-mutual authentication (CARMA) Scheme to reduce the complexity of encryption and hash-based cryptosystems, as well as avoid table lookups. CARMA also uses cache-based nonces to avoid synchronization problems and thwart replay attacks. The inherent parallelism of cellular automata provides for its fast implementation.
{"title":"CARMA: Cellular Automata Based Remote Mutual Authentication Scheme","authors":"S. Tripathy, Sukumar Nandi, A. Chowdhury","doi":"10.1109/ICIT.2006.35","DOIUrl":"https://doi.org/10.1109/ICIT.2006.35","url":null,"abstract":"Mutual authentication between a service provider and its users is essential to prevent unauthorized adversaries from misutilizing system resources. The traditional method of password table lookups is not scalable and is susceptible to overloading. Therefore this paper proposes a cellular automata based remote-mutual authentication (CARMA) Scheme to reduce the complexity of encryption and hash-based cryptosystems, as well as avoid table lookups. CARMA also uses cache-based nonces to avoid synchronization problems and thwart replay attacks. The inherent parallelism of cellular automata provides for its fast implementation.","PeriodicalId":161120,"journal":{"name":"9th International Conference on Information Technology (ICIT'06)","volume":"29 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":"132096905","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}
Promoter recognition is based upon two complementary methods, a motif based method and a global signal based method. The literature is abound with motif search methods. But as the motifs of a promoter are consensus patterns of very short length and the chance of finding putative promoters is high, global feature methods gain importance. In this paper a simple global feature extraction method is proposed for the recognition of sigma-70 promoters in E.coli. It is shown that a simple feed forward neural network classifier achieves a precision of nearly 80% in contrast to the high end classifiers and heavy features proposed in the literature achieving a similar performance. Additionally, a scheme is proposed for locating promoter regions in a given DNA segment.
{"title":"Promoter recognition using dinucleotide features : a case study for E.Coli","authors":"T. Rani, S. Bhavani, R. Bapi","doi":"10.1109/ICIT.2006.75","DOIUrl":"https://doi.org/10.1109/ICIT.2006.75","url":null,"abstract":"Promoter recognition is based upon two complementary methods, a motif based method and a global signal based method. The literature is abound with motif search methods. But as the motifs of a promoter are consensus patterns of very short length and the chance of finding putative promoters is high, global feature methods gain importance. In this paper a simple global feature extraction method is proposed for the recognition of sigma-70 promoters in E.coli. It is shown that a simple feed forward neural network classifier achieves a precision of nearly 80% in contrast to the high end classifiers and heavy features proposed in the literature achieving a similar performance. Additionally, a scheme is proposed for locating promoter regions in a given DNA segment.","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":"121438168","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
扫码关注我们
求助内容：
应助结果提醒方式：