E-resources
Peer reviewed
-
A.U., Zeenath; K.V., Lakshmy; Cusick, Thomas W.; Sethumadhavan, M.
Discrete Applied Mathematics, 11/2024, Volume: 357Journal Article
Construction and enumeration of the class of balanced rotation symmetric Boolean functions are important research areas in cryptography. The counting results of this class of functions are available only for n=p, n=2p, and n=pq (where p and q are distinct primes). An explicit formula for counting balanced rotation symmetric Boolean functions for general n has been an open problem for the last few decades. This paper solves the above open problem using the concept of k-partition of multisets with equal sums. We extend this approach to construct and enumerate the balanced rotation symmetric functions over Fp.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.