Home| Contact Us| New Journals| Browse Journals| Journal Prices| For Authors|

Print ISSN: 2230 – 8776
Online ISSN:


  About JISM
  DLINE Portal Home
Home
Aims & Scope
Editorial Board
Current Issue
Next Issue
Previous Issue
Sample Issue
Upcoming Conferences
Self-archiving policy
Alert Services
Be a Reviewer
Publisher
Paper Submission
Subscription
Contact us
 
  How To Order
  Order Online
Price Information
Request for Complimentary
Print Copy
 
  For Authors
  Guidelines for Contributors
Online Submission
Call for Papers
Author Rights
 
 
RELATED JOURNALS
Journal of Digital Information Management (JDIM)
Journal of Multimedia Processing and Technologies (JMPT)
International Journal of Web Application (IJWA)

 

 
Journal of Information & Systems Management (JISM)

Cryptographic Functions Using GPU with CUDA
Miloš Radmanovic, Radomir S Stankovic
Faculty of Electronic Engineering, Aleksandra Medvedeva 14 18000 Niš, Serbia
Abstract: Cryptographic Boolean functions are required for GPU. They represent a small part of the total cryptographic functions. While we search all functions and identify a few bent functions, we can use them effectively. The search of these variables take more time and processing time. We in this work proposed a parallel algorithm for listing of bent functions using GPU with CUDA. When the fast spectral transform calculation is used the few limitations can be satisfied by bent functions. We did testing and found that the proposed GPU-based algorithm can efficiently enumerate the bent functions of 6 to 10 variables.
Keywords: Cryptography, Boolean Function, Bent Function, Enumeration, GPU, CUDA
DOI:https://doi.org/10.6025/jism/2021/11/2/33-39
Full_Text   PDF 1.21 MB   Download:   206  times
References:

[1] Mesnager, S. (2016). Bent Functions: Fundamentals and Results, Springer International Publishing, 2016.
[2] Tokareva. N. (2016). Bent Functions, Results and Applications to Cryptography, Academic Press, 2015.
[3] Sasao, T., Butler, J., Thornton, M. (2010). Progress in Applications of Boolean Functions, Morgan and Claypool Publishers, 2010.
[4] Langevin, P., Leander, G. (2011). Counting All Bent Functions in Dimension Eight 99270589265934370305785861242880, Designs, Codes and Cryptography, vol. 59, p 193-201, 2011.
[5] Tokareva, N. (2011). On the Number of Bent Functions From Iterative Constructions: Lower Bounds and Hypotheses, Advances in Math. of Communications, vol. 5, no. 4, p 609-621, 2011.
[6] Meng, Q., Yang, M., Zhang, H., Cui, J. (2008). A Novel Algorithm Enumerating Bent Functions, Discrete Math., vol. 308, no. 23, p 5576-5584, 2008.
[7] Kolomeets, N. (2012). Enumeration of the Bent Functions of Least Deviation From a Quadratic Bent Function, Journal of Applied and Industrial Mathematics, vol. 6, no. 3, pp. 1990-4797, 2012.
[8] Shafer, J., Schneider, S., Butler, J., Stanica, P. (2010). Enumeration of Bent Boolean Functions by Reconfigurable Computer, 18th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, p 265-272, Charlotte, NC, USA, 2010.
[9] Schneider, S., Butler, J. (2016). Bent Function Enumeration by a Circular Pipeline Implemented on an FPGA, Proc. 12th Int. Workshop on Boolean Problems (IWSBP2016), p 159-166, Freiberg, Germany, 2016.
[10] Radmanovi, M., Stankovi, R. (2016). Random Generation of Bent Functions on Multicore CPU Platform, Int. Sci. Conf. on Inf. Communication and Energy Systems and Technologies (ICEST 2016), p 239-242, Ohrid, Macedonia, 2016.
[11] Radmanovi, M. (2016). Efficient Random Generation of Bent Functions using GPU Platform, 12th Int. Workshop on Boolean Problems (IWSBP2016), p 167-173, Freiberg, Germany, 2016.
[12] Thornton, M. A., Drechsler, R., Miller, D. M., Spectral Techniques in VLSI CAD, Springer, 2001.
[13] Yuen, D.A., Wang, L., Chi, X., Johnsson, L.,Ge, W., Yaolin, S. (2013). GPU Solutions to Multi-scale Problems in Science and Engineering, Springer Science & Business Media, 2013.


Home | Aim & Scope | Editorial Board | Author Guidelines | Publisher | Subscription | Previous Issue | Contact Us |Upcoming Conferences|Sample Issues|Library Recommendation Form|

 

Copyright © 2011 dline.info