Results 1  10
of
69,440
Substitutionpermutation networks, pseudorandom functions, and Natural Proofs
, 2012
"... This paper takes a new step towards closing the troubling gap between pseudorandom functions (PRF) and their popular, boundedinputlength counterparts. This gap is both quantitative, because these counterparts are more efficient than PRF in various ways, and methodological, because these counterpar ..."
Abstract
 Add to MetaCart
these counterparts usually fit in the substitutionpermutation network paradigm (SPN) which has not been used to construct PRF. We give several candidate PRF Fi that are inspired by the SPN paradigm. This paradigm involves a “substitution function ” (Sbox). Our main candidates are: F1: {0,1} n → {0,1} n is an SPN
E.: Substitutionpermutation networks, pseudorandom functions, and natural proofs
 CRYPTO. Volume 7417 of Lecture Notes in Computer Science
, 2012
"... This paper takes a new step towards closing the troubling gap between pseudorandom functions (PRF) and their popular, boundedinputlength counterparts. This gap is both quantitative, because these counterparts are more efficient than PRF in various ways, and methodological, because these counterpar ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
these counterparts usually fit in the substitutionpermutation network paradigm (SPN) which has not been used to construct PRF. We give several candidate PRF Fi that are inspired by the SPN paradigm. This paradigm involves a “substitution function ” (Sbox). Our main candidates are: F1: {0,1} n → {0,1} n is an SPN
Linear cryptanalysis of substitutionpermutation networks
, 2003
"... The subject of this thesis is linear cryptanalysis of substitutionpermutation networks (SPNs). We focus on the rigorous form of linear cryptanalysis, which requires the concept of linear hulls. First, we consider SPNs in which the sboxes are selected independently and uniformly from the set of al ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
The subject of this thesis is linear cryptanalysis of substitutionpermutation networks (SPNs). We focus on the rigorous form of linear cryptanalysis, which requires the concept of linear hulls. First, we consider SPNs in which the sboxes are selected independently and uniformly from the set
PseudoRandom Generation from OneWay Functions
 PROC. 20TH STOC
, 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract

Cited by 887 (22 self)
 Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom
SubstitutionPermutation Networks Resistant to Differential and Linear Cryptanalysis
 JOURNAL OF CRYPTOLOGY
, 1996
"... In this paper we examine a class of product ciphers referred to as substitutionpermutation networks. We investigate the resistance of these cryptographic networks to two important attacks: differential cryptanalysis and linear cryptanalysis. In particular, we develop upper bounds on the differenti ..."
Abstract

Cited by 32 (11 self)
 Add to MetaCart
In this paper we examine a class of product ciphers referred to as substitutionpermutation networks. We investigate the resistance of these cryptographic networks to two important attacks: differential cryptanalysis and linear cryptanalysis. In particular, we develop upper bounds
SubstitutionPermutation Network Cryptosystems Using KeyDependent SBoxes
 Carleton University
, 1997
"... Substitutionpermutation networks (SPNs) are an important class of private key cryptosystems, having substitution boxes (sboxes) as a critical internal component. Much of the research into sboxes has focussed on determining those sbox properties which yield a cryptographically strong SPN. We inve ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Substitutionpermutation networks (SPNs) are an important class of private key cryptosystems, having substitution boxes (sboxes) as a critical internal component. Much of the research into sboxes has focussed on determining those sbox properties which yield a cryptographically strong SPN. We
A Framework for Defining Logics
 JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY
, 1993
"... The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system of ariti ..."
Abstract

Cited by 807 (45 self)
 Add to MetaCart
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed calculus with dependent types. Syntax is treated in a style similar to, but more general than, MartinLof's system
Logic Programming with Focusing Proofs in Linear Logic
 Journal of Logic and Computation
, 1992
"... The deep symmetry of Linear Logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and non symmetrical. I propose here one such model, in the area of Logic Programming, where the basic computational principle is C ..."
Abstract

Cited by 416 (8 self)
 Add to MetaCart
The deep symmetry of Linear Logic [18] makes it suitable for providing abstract models of computation, free from implementation details which are, by nature, oriented and non symmetrical. I propose here one such model, in the area of Logic Programming, where the basic computational principle
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
, 1995
"... We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract

Cited by 1643 (75 self)
 Add to MetaCart
for the random oracle model, and then replacing oracle accesses by the computation of an "appropriately chosen" function h. This paradigm yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. We illustrate these gains for problems including
Results 1  10
of
69,440