Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Balanced rotation symmetric boolean functions with maximum algebraic immunity

Balanced rotation symmetric boolean functions with maximum algebraic immunity

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Information Security — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

  • Author(s): S. Fu 1 ; L. Qu 2, 3 ; C. Li 2 ; B. Sun 2
    • View affiliations
    • Affiliations: 1: School of Computer Science, National University of Defense Technology, Changsha, People's Republic of China
      2: Department of Mathematics and System Science, National University of Defense Technology, Changsha, People's Republic of China
      3: National Mobile Communications Research Laboratory, Southeast University, Nanjing, People's Republic of China
  • Source: Volume 5, Issue 2, June 2011, p. 93 – 99
    DOI:  10.1049/iet-ifs.2010.0048 , Print ISSN 1751-8709, Online ISSN 1751-8717
© The Institution of Engineering and Technology
Published

Rotation symmetric Boolean functions (RSBFs) that are invariant under circular translation of indices have been used as components of different cryptosystems. In this paper, even-variable-balanced RSBFs with maximum algebraic immunity (AI) are investigated. At first, we give an original construction of 2m-variable-balanced RSBFs with maximum AI. Then we improve the construction to obtain more 2m-variable-balanced RSBFs with maximum AI, and these new RSBFs have higher non-linearity than all previously obtained RSBFs. Further, we generalise our construction of 2m-variable RSBFs to a new construction that can generate any even-variable RSBFs.

Inspec keywords: cryptography; Boolean functions

Other keywords: even-variable-balanced RSBF; maximum algebraic immunity; cryptosystems; balanced rotation symmetric Boolean function; circular translation

Subjects: Cryptography theory; Algebra; Algebra; Cryptography

References

    1. 1)
      • Maximov, A., Hell, M., Maitra, S.: `Plateaued rotation symmetric boolean functions on odd number of variables', First Workshop on Boolean Functions: Cryptography and Applications (BFCA 05), 2005, p. 83–104.
    2. 2)
      • S. Sarkar , S. Maitra . Construction of rotation symmetric Boolean functions with optimal algebraic immunity. Comput. Syst. , 3 , 267 - 284
    3. 3)
      • Meier, W., Pasalic, E., Carlet, C.: `Algebraic attacks and decomposition of Boolean functions', Advances in Cryptology – EUROCRYPT 2004, 2004, p. 474–491, (LNCS, 3027).
    4. 4)
      • Carlet, C.: `A method of construction of balanced functions with optimum algebraic immunity', Workshop on Coding and Cryptography, The Wuyi Mountain, 11–15 June 2007, Fujiang, China, p. 25–43.
    5. 5)
    6. 6)
    7. 7)
      • Courtois, N., Meier, W.: `Algebraic attacks on stream ciphers with linear feedback', Advances in Cryptology – EUROCRYPT 2003, 2003, p. 345–359, (LNCS, 2656).
    8. 8)
    9. 9)
      • Dalai, D.K., Gupta, K.C., Maitra, S.: `Results on algebraic immunity for cryptographically significant boolean functions', INDOCRYPT 2004, 2004, p. 92–106, (LNCS, 3348).
    10. 10)
      • Courtois, N., Pieprzyk, J.: `Cryptanalysis of block ciphers with overdefined systems of equations', Advances in Cryptology – ASIACRYPT 2002, 2002, p. 267–287, (LNCS, 2501).
    11. 11)
    12. 12)
    13. 13)
      • Stanica, P., Maitra, S., Clark, J.: `Results on rotation symmetric bent and correlation immune Boolean functions', Fast Software Encryption Workshop (FSE 2004), 2004, p. 161–177, (LNCS, 3017).
    14. 14)
    15. 15)
    16. 16)
      • F.J. MacWilliams , N.J.A. Sloane . (1977) The theory of error correcting codes.
    17. 17)
      • Carlet, C., Feng, K.Q.: `An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity', Advances in Cryptology – ASIACRYPT 2008, 2008, p. 425–440, (LNCS, 5350).
    18. 18)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ifs.2010.0048
Loading

Related content

content/journals/10.1049/iet-ifs.2010.0048
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address