Cryptography is the study of mathematical techniques related to aspects of information security such as confidentiality, data integrity, entity authentication, and data origin authentication. This paper introduces a new system that would help Crypto Designers in their work toward implementing unbreakable encryption algorithms in easy way. The system consists of a new language called "Cryptography language" or CL, CL compiler, and CL converters. Any Designer can use this kit easily, to record his algorithm and implement it in either software or hardware product. They don't need to learn anything about hardware description languages (VHDL, System-C etc) or their concepts (process, entities, and others), or learn any software languages (C, C++, JAVA etc) or their concepts (Classes, inheritance, and others). Using CL, Designers can write many algorithms and give their code to CL compiler that will compile the code and extract all the algorithm information. Using CL converters, the Algorithm can be generated in any software or hardware languages depending on the user needs (he can generate C, VHDL code, or whatever depending on the available converters).
{"title":"Crypto-Algorithms Maker kit","authors":"M. Abdelrahman, I.E. Talkhan, S. Shaheen","doi":"10.1109/ICM.2003.237774","DOIUrl":"https://doi.org/10.1109/ICM.2003.237774","url":null,"abstract":"Cryptography is the study of mathematical techniques related to aspects of information security such as confidentiality, data integrity, entity authentication, and data origin authentication. This paper introduces a new system that would help Crypto Designers in their work toward implementing unbreakable encryption algorithms in easy way. The system consists of a new language called \"Cryptography language\" or CL, CL compiler, and CL converters. Any Designer can use this kit easily, to record his algorithm and implement it in either software or hardware product. They don't need to learn anything about hardware description languages (VHDL, System-C etc) or their concepts (process, entities, and others), or learn any software languages (C, C++, JAVA etc) or their concepts (Classes, inheritance, and others). Using CL, Designers can write many algorithms and give their code to CL compiler that will compile the code and extract all the algorithm information. Using CL converters, the Algorithm can be generated in any software or hardware languages depending on the user needs (he can generate C, VHDL code, or whatever depending on the available converters).","PeriodicalId":180690,"journal":{"name":"Proceedings of the 12th IEEE International Conference on Fuzzy Systems (Cat. No.03CH37442)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132598118","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}
We present an extraction of the OTCP (Oxide-Trap based on Charge-Pumping method from high frequencies (HF) to low frequencies (LF). Thus using the LF-OTCP method, the interface-trap and border-trap are simultaneously involved in charge pumping (CP) current (I/sub cp/) measurements. We have found that radiation-induced oxide-trap (/spl Delta/N/sub ot/) is only dependent on /spl Delta/V/sub th/ (threshold voltage shift). /spl Delta/I/sub cpm,h/ (augmentation of maximum CP current at high frequencies), and /spl Delta/I/sub cpm,l/ (augmentation of maximum CP current at low frequencies). Where /spl delta/I/sub cpm,l/ and /spl Delta/I/sub cpm,h/ can be easily obtained from vertical shift of charge pumping curve at low and high frequencies respectively, and /spl Delta/V/sub th/ from lateral one.
{"title":"Extended Oxide-Trap extraction method to low frequencies for irradiated MOS transistors","authors":"B. Djezzar, A. Smatti, S. Oussalah","doi":"10.1109/ICM.2003.237972","DOIUrl":"https://doi.org/10.1109/ICM.2003.237972","url":null,"abstract":"We present an extraction of the OTCP (Oxide-Trap based on Charge-Pumping method from high frequencies (HF) to low frequencies (LF). Thus using the LF-OTCP method, the interface-trap and border-trap are simultaneously involved in charge pumping (CP) current (I/sub cp/) measurements. We have found that radiation-induced oxide-trap (/spl Delta/N/sub ot/) is only dependent on /spl Delta/V/sub th/ (threshold voltage shift). /spl Delta/I/sub cpm,h/ (augmentation of maximum CP current at high frequencies), and /spl Delta/I/sub cpm,l/ (augmentation of maximum CP current at low frequencies). Where /spl delta/I/sub cpm,l/ and /spl Delta/I/sub cpm,h/ can be easily obtained from vertical shift of charge pumping curve at low and high frequencies respectively, and /spl Delta/V/sub th/ from lateral one.","PeriodicalId":180690,"journal":{"name":"Proceedings of the 12th IEEE International Conference on Fuzzy Systems (Cat. No.03CH37442)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129954264","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}
In this paper, we introduce an iterative-based algorithm for synthesis of near-minimal cost 4-valued unary functions realized using current-mode CMOS circuits. The cost of a circuit is measured in terms of the chip area needed. The introduced algorithm is used to construct a universal table that contains all 256 4-valued unary functions, their realizations, and their realized costs. Starting with a cost-table consisting of 2400 functions with their known published costs (seed costs), the algorithm generates new functions at reduced costs by using the P-mirror, N-mirror, SUM, P-Switch or the N-Switch as output operators. Experimental results indicate that there has been cost improvement in 227 of the 256 functions.
{"title":"Iterative-based minimization of unary 4-valued functions for current-mode CMOS realization","authors":"M. Abd-El-Barr, L. Al-Awami","doi":"10.1109/ICM.2003.237773","DOIUrl":"https://doi.org/10.1109/ICM.2003.237773","url":null,"abstract":"In this paper, we introduce an iterative-based algorithm for synthesis of near-minimal cost 4-valued unary functions realized using current-mode CMOS circuits. The cost of a circuit is measured in terms of the chip area needed. The introduced algorithm is used to construct a universal table that contains all 256 4-valued unary functions, their realizations, and their realized costs. Starting with a cost-table consisting of 2400 functions with their known published costs (seed costs), the algorithm generates new functions at reduced costs by using the P-mirror, N-mirror, SUM, P-Switch or the N-Switch as output operators. Experimental results indicate that there has been cost improvement in 227 of the 256 functions.","PeriodicalId":180690,"journal":{"name":"Proceedings of the 12th IEEE International Conference on Fuzzy Systems (Cat. No.03CH37442)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127414196","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
扫码关注我们
求助内容：
应助结果提醒方式：