Results 1  10
of
15
Elliptic Curves And Primality Proving
 Math. Comp
, 1993
"... The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm. ..."
Abstract

Cited by 162 (22 self)
 Add to MetaCart
The aim of this paper is to describe the theory and implementation of the Elliptic Curve Primality Proving algorithm.
Numbertheoretic constructions of efficient pseudorandom functions
 In 38th Annual Symposium on Foundations of Computer Science
, 1997
"... ..."
On the Construction of PseudoRandom Permutations: LubyRackoff Revisited
 JOURNAL OF CRYPTOLOGY
, 1997
"... Luby and Rackoff [27] showed a method for constructing a pseudorandom permutation from a pseudorandom function. The method is based on composing four (or three for weakened security) so called Feistel permutations, each of which requires the evaluation of a pseudorandom function. We reduce somewh ..."
Abstract

Cited by 93 (8 self)
 Add to MetaCart
Luby and Rackoff [27] showed a method for constructing a pseudorandom permutation from a pseudorandom function. The method is based on composing four (or three for weakened security) so called Feistel permutations, each of which requires the evaluation of a pseudorandom function. We reduce somewhat the complexity of the construction and simplify its proof of security by showing that two Feistel permutations are sufficient together with initial and final pairwise independent permutations. The revised construction and proof provide a framework in which similar constructions may be brought up and their security can be easily proved. We demonstrate this by presenting some additional adjustments of the construction that achieve the following:  Reduce the success probability of the adversary.  Provide a construction of pseudorandom permutations with large input size using pseudorandom functions with small input size.
Synthesizers and Their Application to the Parallel Construction of PseudoRandom Functions
, 1995
"... A pseudorandom function is a fundamental cryptographic primitive that is essential for encryption, identification and authentication. We present a new cryptographic primitive called pseudorandom synthesizer and show how to use it in order to get a parallel construction of a pseudorandom function. ..."
Abstract

Cited by 42 (10 self)
 Add to MetaCart
A pseudorandom function is a fundamental cryptographic primitive that is essential for encryption, identification and authentication. We present a new cryptographic primitive called pseudorandom synthesizer and show how to use it in order to get a parallel construction of a pseudorandom function. We show several NC¹ implementations of synthesizers based on concrete intractability assumptions as factoring and the DiffieHellman assumption. This yields the first parallel pseudorandom functions (based on standard intractability assumptions) and the only alternative to the original construction of Goldreich, Goldwasser and Micali. In addition, we show parallel constructions of synthesizers based on other primitives such as weak pseudorandom functions or trapdoor oneway permutations. The security of all our constructions is similar to the security of the underlying assumptions. The connection with problems in Computational Learning Theory is discussed.
A Highspeed DES Implementation for Network Applications
, 1992
"... This paper describes a highspeed data encryption chip implementing the Data Encryption Standard (DES). The DES implementation supports Electronic Code Book mode and Cipher Block Chaining mode. The chip is based on a gallium arsenide (GaAs) gate array containing 50K transistors. At a clock frequency ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
This paper describes a highspeed data encryption chip implementing the Data Encryption Standard (DES). The DES implementation supports Electronic Code Book mode and Cipher Block Chaining mode. The chip is based on a gallium arsenide (GaAs) gate array containing 50K transistors. At a clock frequency of 250 MHz, data can be encrypted or decrypted at a rate of 1 GBit/second, making this the fastest singlechip implementation reported to date. High performance and high density have been achieved by using customdesigned circuits to implement the core of the DES algorithm. These circuits employ precharged logic, a methodology novel to the design of GaAs devices. A pipelined flowthrough architecture and an efficient key exchange mechanism make this chip suitable for lowlatency network controllers. iv Contents 1 Introduction 1 2 DES Algorithm 1 3 GaAs Gate Array 4 4 DES Chip Implementation 6 4.1 Organization : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :...
From unpredictability to indistinguishability: A simple construction of pseudorandom functions from MACs
 Advances in Cryptology  CRYPTO '98, LNCS
, 1998
"... Abstract. This paper studies the relationship between unpredictable functions (which formalize the concept of a MAC) and pseudorandom functions. We show an efficient transformation of the former to the latter using a unique application of the GoldreichLevin hardcore bit (taking the innerproduct ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
Abstract. This paper studies the relationship between unpredictable functions (which formalize the concept of a MAC) and pseudorandom functions. We show an efficient transformation of the former to the latter using a unique application of the GoldreichLevin hardcore bit (taking the innerproduct with a random vector r): While in most applications of the GLbit the random vector r may be public, in our setting this is not the case. The transformation is only secure when r is secret and treated as part of the key. In addition, we consider weaker notions of unpredictability and their relationship to the corresponding notions of pseudorandomness. Using these weaker notions we formulate the exact requirements of standard protocols for privatekey encryption, authentication and identification. In particular, this implies a simple construction of a privatekey encryption scheme from the standard challengeresponse identification scheme. 1
Computationally Secure Oblivious Transfer
, 1999
"... We describe a new construction for 1outofN oblivious transfer which is highly efficient  it requires only log N executions of a 1outof2 oblivious transfer protocol. ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
We describe a new construction for 1outofN oblivious transfer which is highly efficient  it requires only log N executions of a 1outof2 oblivious transfer protocol.
Using Quasigroups for OneOne Secure Encoding
 Proc. VIII Conf. Logic and Computer Science “LIRA ’97”, Novi Sad
, 1997
"... In this article we apply a method for encrypting messages based on the properties of the quasigroups. According to the analysis given in the article the method is extremely secure. Beside that, the plain text and its cipher text are of the same length, and the encoding is of stream nature guaran ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
In this article we apply a method for encrypting messages based on the properties of the quasigroups. According to the analysis given in the article the method is extremely secure. Beside that, the plain text and its cipher text are of the same length, and the encoding is of stream nature guarantying a very fast implementation.
Protein Folding, Spin Glass and Computational Complexity
 In Proceedings of the 3rd DIMACS Workshop on DNA Based Computers, held at the University of Pennsylvania, June 23 – 25
, 1997
"... . A reduction from "Ground State of Spin Glass" in statistical mechanics to a minimumenergy model of protein folding is made, which shows that the latter is NPcomplete (high complexity) . The reduction approximates true folding of a protein. The method also enables to show that even if the backbone ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
. A reduction from "Ground State of Spin Glass" in statistical mechanics to a minimumenergy model of protein folding is made, which shows that the latter is NPcomplete (high complexity) . The reduction approximates true folding of a protein. The method also enables to show that even if the backbone of the protein is fixed, the folding of the sidechains is NPcomplete. In a separate second part, the possibility of synthesizing proteins to solve arbitrary instances of the spin glass problem is speculated upon. 1. Introduction The motivation for this work is the speculation of exploiting nature's capability of protein folding to solve computationally intractable problems. One way of investigating this idea is to encode known NPcomplete problems in terms of protein folding. The main content of this paper is to do this for the spin glass problem. We construct a protein that achieves the encoding, i.e., the folded protein provides a solution to spin glass. More precisely, albeit incident...
Cryptography and Machine Learning
 IN ADVANCES IN CRYPTOLOGY – ASIACRYPT ’91
, 1993
"... This paper gives a survey of the relationship between the fields of cryptography and machine learning, with an emphasis on how each field has contributed ideas and techniques to the other. Some suggested directions for future crossfertilization are also proposed. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper gives a survey of the relationship between the fields of cryptography and machine learning, with an emphasis on how each field has contributed ideas and techniques to the other. Some suggested directions for future crossfertilization are also proposed.