Internet protocol security (IPSec) is proposed to provide security services at the IP layer in both the IPv4 and the IPv6 environment. It is composed of a set of protocols that utilizes cryptographic algorithms to encrypt and authenticate packets. This security mechanism has been widely deployed to implement virtual private networks (VPNs). To protect data during transmission and ensure data integration after transmission, both of the forward and the inverse cryptographic operations suffer from a very high cost of computation load. To lower down this cost, various hardware accelerators have been developed to offload these operations from the core CPU. Among them, Intel had integrated three security accelerators in its XScale core. On top of them, we had developed software modules to upgrade the performance of IPSec applications. Results show that acceleration has been achieved. In terms of network throughput, hardware-aided solutions have an average of 2.7 times faster than the software solutions.
{"title":"XScale hardware acceleration on cryptographic algorithms for IPSec applications","authors":"Hung-Ching Chang, Chun-Chin Chen, Chih-Feng Lin","doi":"10.1109/ITCC.2005.304","DOIUrl":"https://doi.org/10.1109/ITCC.2005.304","url":null,"abstract":"Internet protocol security (IPSec) is proposed to provide security services at the IP layer in both the IPv4 and the IPv6 environment. It is composed of a set of protocols that utilizes cryptographic algorithms to encrypt and authenticate packets. This security mechanism has been widely deployed to implement virtual private networks (VPNs). To protect data during transmission and ensure data integration after transmission, both of the forward and the inverse cryptographic operations suffer from a very high cost of computation load. To lower down this cost, various hardware accelerators have been developed to offload these operations from the core CPU. Among them, Intel had integrated three security accelerators in its XScale core. On top of them, we had developed software modules to upgrade the performance of IPSec applications. Results show that acceleration has been achieved. In terms of network throughput, hardware-aided solutions have an average of 2.7 times faster than the software solutions.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121896117","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}
The quantification of evaluating semantic relatedness among texts has been a challenging issue that pervades much of machine learning and natural language processing. This paper presents a hybrid approach of a text-mining technique for measuring semantic relatedness among texts. In this work we develop several text classifiers using support vector machines (SVM) method to supporting acquisition of relatedness among texts. First, we utilized our developed text mining algorithms, including text mining techniques based on classification of texts in several text collections. After that, we employ various SVM classifiers to deal with evaluation of relatedness of the target documents. The results indicate that this approach can also be fitted to other research work, such as information filtering, and recategorizing resulting documents of search engine queries.
{"title":"A classifier-based text mining approach for evaluating semantic relatedness using support vector machines","authors":"Chung-Hong Lee, Hsin-Chang Yang","doi":"10.1109/ITCC.2005.2","DOIUrl":"https://doi.org/10.1109/ITCC.2005.2","url":null,"abstract":"The quantification of evaluating semantic relatedness among texts has been a challenging issue that pervades much of machine learning and natural language processing. This paper presents a hybrid approach of a text-mining technique for measuring semantic relatedness among texts. In this work we develop several text classifiers using support vector machines (SVM) method to supporting acquisition of relatedness among texts. First, we utilized our developed text mining algorithms, including text mining techniques based on classification of texts in several text collections. After that, we employ various SVM classifiers to deal with evaluation of relatedness of the target documents. The results indicate that this approach can also be fitted to other research work, such as information filtering, and recategorizing resulting documents of search engine queries.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122206055","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}
This paper aims to estimate the project cost contingency regardless the individual utility function and risk aversion. Considering a project alike a short selling, the option pricing theory is used to value the contingency as a risk premium that would be required by the market if the project was a traded security.
{"title":"Estimating software cost contingency using options theory","authors":"Said Boukendour","doi":"10.1109/ITCC.2005.147","DOIUrl":"https://doi.org/10.1109/ITCC.2005.147","url":null,"abstract":"This paper aims to estimate the project cost contingency regardless the individual utility function and risk aversion. Considering a project alike a short selling, the option pricing theory is used to value the contingency as a risk premium that would be required by the market if the project was a traded security.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129258962","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 rapid spread of image and video processing applications and the further development of multimedia technologies, compression standards become more and more important every day. This study was conducted to investigate the role of compression standards in image processing. Digital watermarking algorithm for securing multimedia application is considered one of the most important applications heavily rely on compression standards. It was selected to perform our experimental study by employing wavelet and JPEG compression standards. An analysis of the experiment results indicated that the wavelet outperform JPEG compression standard and applications implemented wavelet have better performance than those implemented JPEG.
{"title":"Compression standards roles in image processing: case study","authors":"Mohammad Eyadat, I. M. El-Ddin","doi":"10.1109/ITCC.2005.109","DOIUrl":"https://doi.org/10.1109/ITCC.2005.109","url":null,"abstract":"With the rapid spread of image and video processing applications and the further development of multimedia technologies, compression standards become more and more important every day. This study was conducted to investigate the role of compression standards in image processing. Digital watermarking algorithm for securing multimedia application is considered one of the most important applications heavily rely on compression standards. It was selected to perform our experimental study by employing wavelet and JPEG compression standards. An analysis of the experiment results indicated that the wavelet outperform JPEG compression standard and applications implemented wavelet have better performance than those implemented JPEG.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129754258","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}
This paper describes the use of programming projects for handheld devices within software engineering project classes. There are several benefits associated with using an unfamiliar platform and development tools in upper-level software engineering courses. The student's lack of familiarity with the development environment forces more time to be spent early on in the requirements and design of the project. In addition, the increasing popularity of mobile computing devices has made handheld programming experience valuable to graduating students in their job searches. This paper addresses the motivation for using handheld device programming projects, the technical issues associated with such projects, and the results of several semesters worth of teaching experience and student feedback.
{"title":"Using unfamiliar platforms in software engineering projects","authors":"Gregory A. Hall","doi":"10.1109/ITCC.2005.289","DOIUrl":"https://doi.org/10.1109/ITCC.2005.289","url":null,"abstract":"This paper describes the use of programming projects for handheld devices within software engineering project classes. There are several benefits associated with using an unfamiliar platform and development tools in upper-level software engineering courses. The student's lack of familiarity with the development environment forces more time to be spent early on in the requirements and design of the project. In addition, the increasing popularity of mobile computing devices has made handheld programming experience valuable to graduating students in their job searches. This paper addresses the motivation for using handheld device programming projects, the technical issues associated with such projects, and the results of several semesters worth of teaching experience and student feedback.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123962114","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}
R. Baber, D. Parnas, S. Vilkomir, P. Harrison, Tony O'Connor
We describe our experience applying tabular mathematical approaches to software specifications. Our purpose is to show alternative approaches to writing tabular specifications and to help practitioners who want to apply such methods by allowing them to pick the best one for their problem. The object for the case study is software used by Dell Products for testing the functionality of the keyboards on notebook computers. Starting from informal documents, we developed a variety of tabular representations of finite state machine specifications and tabular trace specifications. We found that the discipline required by these methods raised issues that had never been considered and resulted in documents that were both more complete and much clearer. The various tabular representations are compared from a user's point of view, i.e., clarity, consistency, unambiguity, completeness, suitability, etc.
{"title":"Disciplined methods of software specification: a case study","authors":"R. Baber, D. Parnas, S. Vilkomir, P. Harrison, Tony O'Connor","doi":"10.1109/ITCC.2005.132","DOIUrl":"https://doi.org/10.1109/ITCC.2005.132","url":null,"abstract":"We describe our experience applying tabular mathematical approaches to software specifications. Our purpose is to show alternative approaches to writing tabular specifications and to help practitioners who want to apply such methods by allowing them to pick the best one for their problem. The object for the case study is software used by Dell Products for testing the functionality of the keyboards on notebook computers. Starting from informal documents, we developed a variety of tabular representations of finite state machine specifications and tabular trace specifications. We found that the discipline required by these methods raised issues that had never been considered and resulted in documents that were both more complete and much clearer. The various tabular representations are compared from a user's point of view, i.e., clarity, consistency, unambiguity, completeness, suitability, etc.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123376789","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}
Mobile ad-hoc networks (MANET's) have recently attracted a lot of attention in the research community as well as the industry. This technology has become increasingly important in communication and networking. Routing is one of the most important and difficult aspects in ad hoc network since ad hoc network topology frequently changes. Conventional routing algorithms are difficult to be applied to a dynamic network topology, therefore modeling and design an efficient routing protocol in such dynamic networks is an important issue. One of the meta-heuristic algorithms which is inspired by the behavior of real ants is called ant colony optimization (ACO) algorithm, it can definitely be used as a tool to tackle the mercurial scenarios present in this dynamic environment. In this paper, the author has designed a model, which combines ant colony behavior and queuing network analysis to evaluate end-to-end packet delay in MANET.
{"title":"Simulation of mobility and routing in ad hoc networks using ant colony algorithms","authors":"T. Ahmed","doi":"10.1109/ITCC.2005.257","DOIUrl":"https://doi.org/10.1109/ITCC.2005.257","url":null,"abstract":"Mobile ad-hoc networks (MANET's) have recently attracted a lot of attention in the research community as well as the industry. This technology has become increasingly important in communication and networking. Routing is one of the most important and difficult aspects in ad hoc network since ad hoc network topology frequently changes. Conventional routing algorithms are difficult to be applied to a dynamic network topology, therefore modeling and design an efficient routing protocol in such dynamic networks is an important issue. One of the meta-heuristic algorithms which is inspired by the behavior of real ants is called ant colony optimization (ACO) algorithm, it can definitely be used as a tool to tackle the mercurial scenarios present in this dynamic environment. In this paper, the author has designed a model, which combines ant colony behavior and queuing network analysis to evaluate end-to-end packet delay in MANET.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127693805","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}
Hash algorithms are a class of cryptographic primitives used for fulfilling the requirements of integrity and authentication in cryptography. In this paper, we propose and present the ASIC implementation of 'HashChip', a hardware architecture aimed at providing a unified solution for three different commercial MDC (manipulation detection codes) hash primitives, namely MD5, SHA1 and RIPEMD160. The novelty of the work lies in the exploitation of the similarities in the structure of the three algorithms to obtain an optimized architecture. The performance analysis of a 0.18/spl mu/m ASIC implementation of the architecture has also been done.
哈希算法是一类用于满足密码学中完整性和身份验证要求的密码学原语。在本文中，我们提出并展示了“HashChip”的ASIC实现，这是一种硬件架构，旨在为三种不同的商业MDC(操作检测码)哈希原语，即MD5, SHA1和RIPEMD160提供统一的解决方案。这项工作的新颖之处在于利用了三种算法在结构上的相似性来获得优化的结构。并对该架构的0.18/spl μ m ASIC实现进行了性能分析。
{"title":"ASIC implementation of a unified hardware architecture for non-key based cryptographic hash primitives","authors":"T. Ganesh, T. Sudarshan","doi":"10.1109/ITCC.2005.91","DOIUrl":"https://doi.org/10.1109/ITCC.2005.91","url":null,"abstract":"Hash algorithms are a class of cryptographic primitives used for fulfilling the requirements of integrity and authentication in cryptography. In this paper, we propose and present the ASIC implementation of 'HashChip', a hardware architecture aimed at providing a unified solution for three different commercial MDC (manipulation detection codes) hash primitives, namely MD5, SHA1 and RIPEMD160. The novelty of the work lies in the exploitation of the similarities in the structure of the three algorithms to obtain an optimized architecture. The performance analysis of a 0.18/spl mu/m ASIC implementation of the architecture has also been done.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126470019","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}
The scattering of pattern logic (the attributes and methods of pattern role) is the most typical problem on design pattern instantiation, that is, pattern logic scatters across multiple business classes, which causes problems, such as, debasing the reusability of pattern logic, losing the instantiation information of pattern (traceability and overlapping problem) etc. To resolve these problems in design level, an approach to design pattern instantiation based on RoleOf relationship is proposed. It treats role as the independent modeling element and introduces RoleOf relationship between business class and role, which makes the business logic and the pattern logic completely separated, thus improves its reusability. Through the extension of UML, the meta-model and semantics of RoleOf relationship, and stereotypes and tagged values used for identify pattern information are provided, it resolves the traceability and overlapping problem. Finally, the implementation method of RoleOf relationship is discussed through an example.
{"title":"Using RoleOf relationship in design pattern instantiation","authors":"Chengwan He, K. He, Fei He, Feng Yao, Jin Liu","doi":"10.1109/ITCC.2005.288","DOIUrl":"https://doi.org/10.1109/ITCC.2005.288","url":null,"abstract":"The scattering of pattern logic (the attributes and methods of pattern role) is the most typical problem on design pattern instantiation, that is, pattern logic scatters across multiple business classes, which causes problems, such as, debasing the reusability of pattern logic, losing the instantiation information of pattern (traceability and overlapping problem) etc. To resolve these problems in design level, an approach to design pattern instantiation based on RoleOf relationship is proposed. It treats role as the independent modeling element and introduces RoleOf relationship between business class and role, which makes the business logic and the pattern logic completely separated, thus improves its reusability. Through the extension of UML, the meta-model and semantics of RoleOf relationship, and stereotypes and tagged values used for identify pattern information are provided, it resolves the traceability and overlapping problem. Finally, the implementation method of RoleOf relationship is discussed through an example.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126455972","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}
Raju Gangishetti, M. C. Gorantla, M. Das, A. Saxena, V. Gulati
This paper presents an efficient and secure protocol for key issuing in ID-based cryptosystems using bilinear pairings. We use a simple blinding technique to eliminate the need of secure channel and multiple authorities approach to avoid the key escrow problem. We show that our protocol overcomes the disadvantages of other pairing based schemes and is efficient compared to the existing key issuing protocol.
{"title":"An efficient secure key issuing protocol in ID-based cryptosystems","authors":"Raju Gangishetti, M. C. Gorantla, M. Das, A. Saxena, V. Gulati","doi":"10.1109/ITCC.2005.75","DOIUrl":"https://doi.org/10.1109/ITCC.2005.75","url":null,"abstract":"This paper presents an efficient and secure protocol for key issuing in ID-based cryptosystems using bilinear pairings. We use a simple blinding technique to eliminate the need of secure channel and multiple authorities approach to avoid the key escrow problem. We show that our protocol overcomes the disadvantages of other pairing based schemes and is efficient compared to the existing key issuing protocol.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126532060","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
扫码关注我们
求助内容：
应助结果提醒方式：