Results 1 
7 of
7
Efficient Cryptographic Schemes Provably as Secure as Subset Sum
"... We show very efficient constructions for a pseudorandom generator and for a universal oneway hash function based on the intractability of the subset sum problem for certain dimensions. (Pseudorandom generators can be used for private key encryption and universal oneway hash functions for signatu ..."
Abstract

Cited by 91 (9 self)
 Add to MetaCart
We show very efficient constructions for a pseudorandom generator and for a universal oneway hash function based on the intractability of the subset sum problem for certain dimensions. (Pseudorandom generators can be used for private key encryption and universal oneway hash functions for signature schemes). The increase in efficiency in our construction is due to the fact that many bits can be generated/hashed with one application of the assumed oneway function. All our construction can be implemented in NC using an optimal number of processors.
Practical Approaches to Attaining Security Against Adaptively Chosen Ciphertext Attacks
 In Advances in Cryptology–Crypto ’92
, 1992
"... Abstract. This paper presents three methods for strengthening public key cryptosystems in such a way that they become secure against adaptively chosen ciphertext attacks. In an adaptively chosen ciphertext attack, an attacker can query the deciphering algorithm with any ciphertexts, except for the e ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents three methods for strengthening public key cryptosystems in such a way that they become secure against adaptively chosen ciphertext attacks. In an adaptively chosen ciphertext attack, an attacker can query the deciphering algorithm with any ciphertexts, except for the exact object ciphertext to be cryptanalyzed. The rst strengthening method is based on the use of oneway hash functions, the second on the use of universal hash functions and the third on the use of digital signature schemes. Each method is illustrated by an example ofapublickey cryptosystem based on the intractability ofcomputing discrete logarithms in nite elds. Two other issues, namely applications of the methods to public key cryptosystems based on other intractable problems and enhancement of information authentication capability to the cryptosystems, are also discussed. 1
The hidden number problem in extension fields and its applications
 Lect. Notes in Comp. Sci
, 2002
"... ..."
Survey of computational assumptions used in cryptography broken or not by Shor’s algorithm
, 2001
"... ..."
(Show Context)
Against Chosen Ciphertext Attacks
"... AbstractThis paper presents three methods for strengthening public key cryptosystems in such a way that they become secure against adaptively chosen ciphertext attacks. In an adaptively chosen ciphertext attack, an attacker can query the deciphering algorithm with any ciphertexts, except for the e ..."
Abstract
 Add to MetaCart
AbstractThis paper presents three methods for strengthening public key cryptosystems in such a way that they become secure against adaptively chosen ciphertext attacks. In an adaptively chosen ciphertext attack, an attacker can query the deciphering algorithm with any ciphertexts, except for the exact object ciphertext to be cryptanalyzed. The first strengthening method is based on the use of oneway hash functions, the second on the use of universal hash functions, and the third on the use of digital signature schemes. Each method is illustrated by an example of a public key cryptosystem based on the intractability of computing discrete logarithms in finite fields. Seeurity of the three example cryptosystems is formally proved. Two other issues, namely, applications of the methods to public key cryptosystems based on other intractable problems and enhancement of information authentication capability to the cryptosystems, are also discussed. Yuliang Zheng and Jennifer Seberry I.
A Modified Method for Generating Secure Accessibility Pseudorandom Bit Sequences
"... This paper presents a modified algorithm for ANSIx9.17 version [1], which is used for generating pseudorandom number sequences. This algorithm depends on fixed execution steps and fixed variable choosing. Also it uses a fixed cryptographic algorithm, DES. The modified algorithm introduced more modi ..."
Abstract
 Add to MetaCart
(Show Context)
This paper presents a modified algorithm for ANSIx9.17 version [1], which is used for generating pseudorandom number sequences. This algorithm depends on fixed execution steps and fixed variable choosing. Also it uses a fixed cryptographic algorithm, DES. The modified algorithm introduced more modifications include using variable parameters instead of fixed parameters and different cryptographic algorithms in a random selection done by the user to get more secure random generation., that enhances a secure accessibility.