Results 1  10
of
607,951
On Linear Redundancy in the AES SBox
, 2002
"... We show the existence of a previously unknown linear redundancy property of the only nonlinear component of the AES block cipher. It is demonstrated that the outputs of the 8*8 Rijndael sbox (based on inversion in a finite field) are all equivalent under affine transformation. ..."
Abstract
 Add to MetaCart
We show the existence of a previously unknown linear redundancy property of the only nonlinear component of the AES block cipher. It is demonstrated that the outputs of the 8*8 Rijndael sbox (based on inversion in a finite field) are all equivalent under affine transformation.
A Very Compact SBox for AES
 in Proceedings of CHES 2005, ser. LNCS
, 2005
"... Abstract. A key step in the Advanced Encryption Standard (AES) algorithm is the “Sbox. ” Many implementations of AES have been proposed, for various goals, that effect the Sbox in various ways. In particular, the most compact implementations to date of Satoh et al.[1] and Mentens et al.[2] perform ..."
Abstract

Cited by 71 (3 self)
 Add to MetaCart
Abstract. A key step in the Advanced Encryption Standard (AES) algorithm is the “Sbox. ” Many implementations of AES have been proposed, for various goals, that effect the Sbox in various ways. In particular, the most compact implementations to date of Satoh et al.[1] and Mentens et al.[2
An Architecture for SBox Computation in the AES
"... This paper describes an efficient Sbox computation developed for the Rijndael ciphering system. The mathematical manipulation lies on composite field computation where the element inversion is performed in the ground field. This development is, on one hand, suitable for applications where table loo ..."
Abstract
 Add to MetaCart
This paper describes an efficient Sbox computation developed for the Rijndael ciphering system. The mathematical manipulation lies on composite field computation where the element inversion is performed in the ground field. This development is, on one hand, suitable for applications where table
From oblivious AES to efficient and secure database join in the multiparty setting
"... Abstract. AES block cipher is an important cryptographic primitive with many applications. In this work, we describe how to efficiently implement the AES128 block cipher in the multiparty setting where the key and the plaintext are both in a secretshared form. In particular, we study several appro ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
approaches for AES Sbox substitution based on oblivious table lookup and circuit evaluation. Given this secure AES implementation, we build a universally composable database join operation for secret shared tables. The resulting protocol scales almost linearly with the database size and can join medium
MEGA5: Molecular evolutionary genetics analysis using maximum . . .
, 2011
"... Comparative analysis of molecular sequence data is essential for reconstructing the evolutionary histories of species and inferring the nature and extent of selective forces shaping the evolution of genes and species. Here, we announce the release of Molecular Evolutionary Genetics Analysis version ..."
Abstract

Cited by 6858 (19 self)
 Add to MetaCart
) analyses for inferring evolutionary trees, selecting bestfit substitution models (nucleotide or amino acid), inferring ancestral states and sequences (along with probabilities), and estimating evolutionary rates sitebysite. In computer simulation analyses, ML tree inference algorithms in MEGA5 compared
The theory and practice of corporate finance: Evidence from the field
 Journal of Financial Economics
, 2001
"... We survey 392 CFOs about the cost of capital, capital budgeting, and capital structure. Large firms rely heavily on present value techniques and the capital asset pricing model, while small firms are relatively likely to use the payback criterion. We find that a surprising number of firms use their ..."
Abstract

Cited by 680 (20 self)
 Add to MetaCart
order and tradeoff capital structure hypotheses but little evidence that executives are concerned about asset substitution, asymmetric information, transactions costs, free cash flows, or personal taxes. Key words: capital structure, cost of capital, cost of equity, capital budgeting, discount rates, project
A Structural Approach to Operational Semantics
, 1981
"... Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be ..."
Abstract

Cited by 1541 (3 self)
 Add to MetaCart
Syntax of a very simple programming language called L. What is abstract about it will be discussed a little here and later at greater length. For us syntax is a collection of syntactic sets of phrases; each set corresponds to a different type of phrase. Some of these sets are very simple and can be taken as given: Truthvalues This is the set T = ftt; ffg and is ranged over by (the metavariable) t (and we also happily employ for this (and any other) metavariable sub and superscripts to generate other metavariables: t ; t 0 ; t 1k ).
How Much Training is Needed in MultipleAntenna Wireless Links?
 IEEE Trans. Inform. Theory
, 2000
"... .... ..."
A Fast Algorithm for Particle Simulations
, 1987
"... this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions a ..."
Abstract

Cited by 1145 (19 self)
 Add to MetaCart
this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions are Coulombic or gravitational in nature. For a the form system of N particles, an amount of work of the order O(N 2 ) has traditionally been required to evaluate all pairwise interactions, un F5F far 1 (F near 1F external ), less some approximation or truncation method is used. The algorithm of the present paper requires an amount of work proportional to N to evaluate all interactions to within roundoff error, making it where F near (when present) is a rapidly decaying potential con
Estimating the Support of a HighDimensional Distribution
, 1999
"... Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propo ..."
Abstract

Cited by 766 (29 self)
 Add to MetaCart
Suppose you are given some dataset drawn from an underlying probability distribution P and you want to estimate a "simple" subset S of input space such that the probability that a test point drawn from P lies outside of S is bounded by some a priori specified between 0 and 1. We propose a method to approach this problem by trying to estimate a function f which is positive on S and negative on the complement. The functional form of f is given by a kernel expansion in terms of a potentially small subset of the training data; it is regularized by controlling the length of the weight vector in an associated feature space. The expansion coefficients are found by solving a quadratic programming problem, which we do by carrying out sequential optimization over pairs of input patterns. We also provide a preliminary theoretical analysis of the statistical performance of our algorithm. The algorithm is a natural extension of the support vector algorithm to the case of unlabelled d...
Results 1  10
of
607,951