• Publications
  • Influence
Cryptographic Boolean Functions and Applications
TLDR
Boolean functions are the building blocks of symmetric cryptographic systems. Expand
  • 316
  • 15
  • PDF
Bent and generalized bent Boolean functions
TLDR
In this paper, we investigate the properties of generalized bent functions defined on $${\mathbb{Z}_2^n}$$ where q ≥ 2 is any positive integer. Expand
  • 48
  • 4
  • PDF
The spectrum of generalized Petersen graphs
TLDR
In this paper, we completely describe the spectrum of the generalized Petersen graph P(n, k), thus adding to the classes of graphs whose spectrum is completely known. Expand
  • 25
  • 4
  • PDF
Rotation Symmetric Boolean Functions -; Count and Cryptographic Properties
TLDR
Using Burnside's lemma, we prove that the number of n-variable rotation symmetric Boolean functions is 2gn, where gn and φ is the Euler phi-function. Expand
  • 50
  • 3
  • PDF
GOOD LOWER AND UPPER BOUNDS ON BINOMIAL COEFFICIENTS
We provide good bounds on binomial coefficients, generalizing known ones, using some results of H. Robbins and of Sasvari.
  • 78
  • 3
  • PDF
Third-order family of methods in Banach spaces
TLDR
We use an idea of Kou and Li [Appl. Math. Comp. 187 (2007), 1027-1032] and modify the approach of Parida and Gupta, obtaining yet another third-order method to approximate a solution of a nonlinear equation in a Banach space. Expand
  • 41
  • 3
  • PDF
Balanced Symmetric Functions over $GF(p)$
Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinearExpand
  • 21
  • 3
Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform
TLDR
We develop a technique to construct bent-negabent Boolean functions by using complete mapping polynomials. Expand
  • 50
  • 2
  • PDF
Almost Boolean functions: the design of Boolean functions by spectral inversion
TLDR
In this paper, we adopt an unorthodox approach to the design of Boolean functions with properties of cryptographic significance. Expand
  • 30
  • 2
On a conjecture for balanced symmetric Boolean functions
TLDR
We give some results towards the conjecture that are the only nonlinear balanced elementary symmetric polynomials over GF(2), where t and are any positive integers and X(d, n) = Σ1≤i 1<i 2<⋯<id ≤n x i 1 x i 2 ⋯ x id . Expand
  • 22
  • 2
  • PDF
...
1
2
3
4
5
...