Abstract
The large-scale proliferation of wireless communications both inside and outside the home-office environment has led to an increased demand for effective and cheap encryption schemes. Now a new chaos based signals as arbitrary source and digital signals as main source make digits for Elliptic curve algorithm by 2 parallel-in (with pipelining), 1parallel-out and 1 serial-out to produce encrypted signals. For computing this scheme in application on MC-DS-CDMA transmitter and receiver, new algorithm of division with the least time consumption, is presented.
This algorithm is implemented in modular division over GF (2m) without any considerable increase in hardware gate count. By considering appropriate circuit configuration, the simulation results are also presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Murali, K., Yu, H., Varadan, V., Leung, H.: Secure Communication Using a Chaos Based Signal Encryption Scheme. IEEE Transaction on Consumer Electronics 47, 709–714 (2001)
Guo, J.-H., Wang, C.-L.: Hardware-efficient systolic architecture for inversion and division in GF(2m ). In: IEE Proc.-Comput. Digit. Tech., vol. 145, pp. 272–278 (July 1998)
Jain, S.K., Song, L., Parhi, K.K.: Efficient Semi-Systolic Architecture for Finit Field Arithmetic. IEEE Transaction on VLSI System 6, 101–113 (1998)
Wang, C.L., Lin, J.L.: A Systolic Archtecture for Computing Inverses and Divisions in Finit Field GF(2m ). IEEE Transaction on Computer 42, 1141–1146 (1993)
Hasan, M.A., Bhargava, V.K.: Bit-Serial Systolic Divider and Multiplier for Finit Fields GF(2m ). IEEE Transaction on Computer 41, 972–980 (1992)
Brunner, H., Curiger, A., Hofstetter, M.: On Computing Multiplicative Inverses in GF(2m ). IEEE Trans. Comput. 42, 1010–1015 (1993)
Wu, C.-H., Wu, C.-M., Shieh, M.-D., Hwang, Y.-T.: High-Spesd, Low-Complexity Systolic Designs of Novel Iteration Division Algorithms in GF(2m ). IEEE Transaction on Computer 53, 375–380 (2004)
Fong, K., Hankerson, D., Lopez, J., Menzes, A.: Field Inversion and Point Halving Revisited. IEEE Transaction on Computers 53, 1047–1059 (2004)
Deng-Hong, Z.: Encryption design for the database under the VFP environment based on Chaos algorithm. In: IEEE, ICACTE (2010)
Chen, J.-D., Ueng, F.-B., Chang, J.-C., Hsien, S.: Performance Analyses of OFDM-CDMA Receivers in Multipath Fading Channels. IEEE Transactions on Vehicular Technology 58, 4805–4818 (2009)
Kim, C.H., Kwon, S., Kim, J.J., Hong, C.P.: A Compact and Fast Division Architecture for a Finite Field GF(2m ). In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol. 2667, pp. 855–864. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Hosseini, A., Falahati, A. (2012). Optimum Hardware-Architecture for Modular Divider in GF(2m) with Chaos as Arbitrary Source Based on ECC. In: Georgiadis, C.K., Jahankhani, H., Pimenidis, E., Bashroush, R., Al-Nemrat, A. (eds) Global Security, Safety and Sustainability & e-Democracy. e-Democracy ICGS3 2011 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 99. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33448-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-33448-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33447-4
Online ISBN: 978-3-642-33448-1
eBook Packages: Computer ScienceComputer Science (R0)