Results 1  10
of
23
The Dark Side of "BlackBox" Cryptography or: Should We Trust Capstone?
 in Advances in Cryptology  Crypto '96
, 1996
"... . The use of cryptographic devices as "black boxes", namely trusting their internal designs, has been suggested and in fact Capstone technology is offered as a next generation hardwareprotected escrow encryption technology. Software cryptographic servers and programs are being offered as ..."
Abstract

Cited by 35 (4 self)
 Add to MetaCart
. The use of cryptographic devices as "black boxes", namely trusting their internal designs, has been suggested and in fact Capstone technology is offered as a next generation hardwareprotected escrow encryption technology. Software cryptographic servers and programs are being offered as well, for use as library functions, as cryptography gets more and more prevalent in computing environments. The question we address in this paper is how the usage of cryptography as a black box exposes users to various threats and attacks that are undetectable in a blackbox environment. We present the SETUP (Secretly Embedded Trapdoor with Universal Protection) mechanism, which can be embedded in a cryptographic blackbox device. It enables an attacker (the manufacturer) to get the user's secret (from some stage of the output process of the device) in an unnoticeable fashion, yet protects against attacks by others and against reverse engineering (thus, maintaining the relative advantage of the actual...
A new class of qFibonacci polynomials
 Electron. J. Combin. 10 (2003), Research Paper
, 2003
"... We introduce a new qanalogue of the Fibonacci polynomials and derive some of its properties. Extra attention is paid to a special case which has some interesting connections with Euler's pentagonal number theorem. 1 ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
(Show Context)
We introduce a new qanalogue of the Fibonacci polynomials and derive some of its properties. Extra attention is paid to a special case which has some interesting connections with Euler's pentagonal number theorem. 1
Fermionic expressions for the characters of c(p,1) logarithmic conformal field theories
 Nucl. Phys. B
"... We present fermionic quasiparticle sum representations consisting of a single fundamental fermionic form for all characters of the logarithmic conformal field theory models with central charge cp,1, p ≥ 2, and suggest a physical interpretation. We also show that it is possible to correctly extract ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
We present fermionic quasiparticle sum representations consisting of a single fundamental fermionic form for all characters of the logarithmic conformal field theory models with central charge cp,1, p ≥ 2, and suggest a physical interpretation. We also show that it is possible to correctly extract dilogarithm identities.
Multiple finite Riemann zeta functions
, 2008
"... Observing a multiple version of the divisor function we introduce a new zeta function which we call a multiple finite Riemann zeta function. We utilize some qseries identity for proving the zeta function has an Euler product and then, describe the location of zeros. We study further multivariable ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Observing a multiple version of the divisor function we introduce a new zeta function which we call a multiple finite Riemann zeta function. We utilize some qseries identity for proving the zeta function has an Euler product and then, describe the location of zeros. We study further multivariable and multiparameter versions of the multiple finite Riemann zeta functions and their infinite counterparts in connection with symmetric polynomials and some arithmetic quantities called powerful numbers.
The Crystallographic Restriction, Permutations, and Goldbach’s Conjecture
"... Goldbach’s conjecture, the crystallographic restriction, and the orders of the elements of the symmetric group. First recall that for an element g of a group G the order Ord(g) of g is defined to be the smallest natural number such that g Ord(g) = id if such a number exists, and Ord(g) =∞otherwise. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Goldbach’s conjecture, the crystallographic restriction, and the orders of the elements of the symmetric group. First recall that for an element g of a group G the order Ord(g) of g is defined to be the smallest natural number such that g Ord(g) = id if such a number exists, and Ord(g) =∞otherwise. In dimension n, thecrystallographic
OPEN PROBLEMS AND CONJECTURES ON THE FACTOR IRECIPROCAL PARTITION THEORY: (Amarnath Murthy,S.E. (E & T), Well Logging Services,Oil And Natural
"... (1.1) To derive a formula for SFPs of given length m of paqs for any value of a. (1.2) To derive a formula for SFPs of ..."
Abstract
 Add to MetaCart
(1.1) To derive a formula for SFPs of given length m of paqs for any value of a. (1.2) To derive a formula for SFPs of
Overcomplete Free Energy Functional for D=1 Particle Systems with Next Neighbor Interactions
, 2002
"... We deduce an overcomplete free energy functional for D=1 particle systems with next neighbor interactions, where the set of redundant variables are the local block densities + i of i interacting particles. The idea is to analyze the decomposition of a given pure system into blocks of i interacting p ..."
Abstract
 Add to MetaCart
We deduce an overcomplete free energy functional for D=1 particle systems with next neighbor interactions, where the set of redundant variables are the local block densities + i of i interacting particles. The idea is to analyze the decomposition of a given pure system into blocks of i interacting particles by means of a mapping onto a hard rod mixture. This mapping uses the local activity of component i of the mixture to control the local association of i particles of the pure system. Thus it identifies the local particle density of component i of the mixture with the local block density + i of the given system. Consequently, our overcomplete free energy functional takes on the hard rod mixture form with the set of block densities + i representing the sequence of partition functions of the local aggregates of particle numbers i. The system of equations for the local particle density + of the original system is closed via a subsidiary condition for the block densities in terms of +. Analoguous to the uniform isothermalisobaric technique, all our results are expressible in terms of effective pressures. We illustrate the theory with two standard examples, the adhesive interaction and the squarewell potential. For the uniform case, our proof of such an overcomplete format is based on the exponential boundedness of the number of partitions of a positive integer (HardyRamanujan formula) and on Varadhan’s theorem on the asymptotics of a class of integrals. KEY WORDS: Onedimensional; interacting particle system; next neighbor; density functional; overcomplete description; solvable model.
SEQUENCE
, 1986
"... Recurring sequences such as the Fibonacci sequence defined by ^0 = 0 ' F l = U F n = *"„! + F n2> and the Lucas sequence given by n S 2 ..."
Abstract
 Add to MetaCart
Recurring sequences such as the Fibonacci sequence defined by ^0 = 0 ' F l = U F n = *"„! + F n2> and the Lucas sequence given by n S 2