Shamir, Adi
Overview
Works:  76 works in 180 publications in 1 language and 523 library holdings 

Genres:  Academic theses 
Roles:  Author 
Publication Timeline
.
Most widely held works about
Adi Shamir
 Classifying the complexity of the RSA algorithm : the state of the art by Leonor Charmaine Bosman( )
 A description of selected cryptosystems and the Shamir attack on the MerkleHellman knapsack cipher by James M Harper( )
Most widely held works by
Adi Shamir
Differential cryptanalysis of the data encryption standard by
Eli BIHAM(
Book
)
15 editions published between 1993 and 2011 in English and Undetermined and held by 284 WorldCat member libraries worldwide
DES, the Data Encryption Standard, is the best known and most widely used civilian cryptosystem. It was developed by IBM and adopted as a US national standard in the mid 1970̀s, and had resisted all attacks in the last 15 years. This book presents the first successful attack which can break the full 16 round DES faster than via exhaustive search. It describes in full detail, the novel technique of Differential Cryptanalysis, and demonstrates its applicability to a wide variety of cryptosystems and hash functions, including FEAL, Khafre, REDOCII, LOKI, Lucifer, Snefru, NHash, and many modified versions of DES. The methodology used offers valuable insights to anyone interested in data security and cryptography, and points out the intricacies of developing, evaluating, testing, and implementing such schemes. This book was written by two of the field̀s leading researchers, and describes stateoftheart research in a clear and completely contained manner
15 editions published between 1993 and 2011 in English and Undetermined and held by 284 WorldCat member libraries worldwide
DES, the Data Encryption Standard, is the best known and most widely used civilian cryptosystem. It was developed by IBM and adopted as a US national standard in the mid 1970̀s, and had resisted all attacks in the last 15 years. This book presents the first successful attack which can break the full 16 round DES faster than via exhaustive search. It describes in full detail, the novel technique of Differential Cryptanalysis, and demonstrates its applicability to a wide variety of cryptosystems and hash functions, including FEAL, Khafre, REDOCII, LOKI, Lucifer, Snefru, NHash, and many modified versions of DES. The methodology used offers valuable insights to anyone interested in data security and cryptography, and points out the intricacies of developing, evaluating, testing, and implementing such schemes. This book was written by two of the field̀s leading researchers, and describes stateoftheart research in a clear and completely contained manner
A new approach to recursive programs : by Zohar Manna and Adi Shamir by
Zohar Manna(
Book
)
7 editions published in 1975 in English and held by 13 WorldCat member libraries worldwide
In this paper, the authors critically evaluate the classical leastfixedpoint approach towards recursive programs. They suggest a new approach which extracts the maximal amount of valuable information embedded in the programs. The presentation is informal, with emphasis on examples
7 editions published in 1975 in English and held by 13 WorldCat member libraries worldwide
In this paper, the authors critically evaluate the classical leastfixedpoint approach towards recursive programs. They suggest a new approach which extracts the maximal amount of valuable information embedded in the programs. The presentation is informal, with emphasis on examples
On the cryptocomplexity of knapsack systems by
Adi Shamir(
Book
)
5 editions published in 1979 in English and held by 11 WorldCat member libraries worldwide
A recent trend in cryptographic systems is to base their encryption/decryption functions on NPcomplete problems, and in particular on the knapsack problem. To analyze the security of these systems, we need a complexity theory which is less worstcase oriented and which takes into account the extra conditions imposed on the problems to make them cryptographically useful. In this paper we consider the two classes of onetoone and onto knapsack systems, analyze the complexity of recognizing them and of solving their instances, introduce a new complexity measure (median complexity), and show that this complexity is inversely proportional to the density of the knapsack system. The tradeoff result is based on a fast probabilistic knapsack solving algorithm which is applicable only to onetoone systems, and it indicates that knapsackbased cryptographic systems in which one can both encrypt and sign messages are relatively insecure
5 editions published in 1979 in English and held by 11 WorldCat member libraries worldwide
A recent trend in cryptographic systems is to base their encryption/decryption functions on NPcomplete problems, and in particular on the knapsack problem. To analyze the security of these systems, we need a complexity theory which is less worstcase oriented and which takes into account the extra conditions imposed on the problems to make them cryptographically useful. In this paper we consider the two classes of onetoone and onto knapsack systems, analyze the complexity of recognizing them and of solving their instances, introduce a new complexity measure (median complexity), and show that this complexity is inversely proportional to the density of the knapsack system. The tradeoff result is based on a fast probabilistic knapsack solving algorithm which is applicable only to onetoone systems, and it indicates that knapsackbased cryptographic systems in which one can both encrypt and sign messages are relatively insecure
How to share a secret by
Adi Shamir(
Book
)
5 editions published between 1979 and 1980 in English and held by 10 WorldCat member libraries worldwide
In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k  1 pieces reveals absolutely no information about D. This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces. (Author)
5 editions published between 1979 and 1980 in English and held by 10 WorldCat member libraries worldwide
In this paper we show how to divide data D into n pieces in such a way that D is easily reconstructable from any k pieces, but even complete knowledge of k  1 pieces reveals absolutely no information about D. This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces. (Author)
The cryptographic security of compact knapsacks : (preliminary report) by
A Shamir(
Book
)
3 editions published in 1980 in English and held by 10 WorldCat member libraries worldwide
3 editions published in 1980 in English and held by 10 WorldCat member libraries worldwide
A method for obtaining digital signatures and publickey cryptosystems by
Ronald Rivest(
Book
)
4 editions published in 1977 in English and held by 8 WorldCat member libraries worldwide
4 editions published in 1977 in English and held by 8 WorldCat member libraries worldwide
Mental poker by
A Shamir(
Book
)
5 editions published in 1979 in English and Undetermined and held by 8 WorldCat member libraries worldwide
Is it possible to play a fair game of 'Mental Poker'. We will give a complete (but paradoxical) answer to this question. We will first prove that the problem is intrinsically insoluble, and then describe a fair method of playing 'Mental Poker'. (Author)
5 editions published in 1979 in English and Undetermined and held by 8 WorldCat member libraries worldwide
Is it possible to play a fair game of 'Mental Poker'. We will give a complete (but paradoxical) answer to this question. We will first prove that the problem is intrinsically insoluble, and then describe a fair method of playing 'Mental Poker'. (Author)
The fixedpoints of recursive definitions by
Adi Shamir(
Book
)
6 editions published in 1976 in English and held by 8 WorldCat member libraries worldwide
6 editions published in 1976 in English and held by 8 WorldCat member libraries worldwide
Embedding cryptographic trapdoors in arbitrary knapsack systems by
A Shamir(
Book
)
2 editions published in 1982 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 1982 in English and held by 7 WorldCat member libraries worldwide
On the security of the MerkleHellman cryptographic scheme by
Adi SHAMIR(
Book
)
7 editions published in 1978 in English and held by 7 WorldCat member libraries worldwide
In this paper we show that a simplified version of the MerkleHellman publickey cryptographic system is breakable. While their fullfledged system seems to be resistant to the cryptanalytic attack we propose, this result suggests some ways in which the security of their system can be further enhanced. (Author)
7 editions published in 1978 in English and held by 7 WorldCat member libraries worldwide
In this paper we show that a simplified version of the MerkleHellman publickey cryptographic system is breakable. While their fullfledged system seems to be resistant to the cryptanalytic attack we propose, this result suggests some ways in which the security of their system can be further enhanced. (Author)
On digital signatures and publickey cryptosystems by
Ronald L Rivest(
Book
)
3 editions published in 1977 in English and held by 7 WorldCat member libraries worldwide
3 editions published in 1977 in English and held by 7 WorldCat member libraries worldwide
A T = 0(2[superscript n/2]), S = 0(2[superscript n/4]) algorithm for certain npcomplete problems by
Richard Schroeppel(
Book
)
6 editions published in 1980 in English and held by 7 WorldCat member libraries worldwide
In this paper we develop a general purpose algorithm that can solve a number of NPcomplete problems in time T=0(2 to the m/2 power) and space S=0(2 to the m/4 power). The algorithm can be generalized to a family of algorithms whose time and space complexities are related by TS2=0(2 to the ninth power). The problems it can handle are characterized by a few decomposition axioms, and they include knapsack problems, exact satisfiability problems, set covering problems, etc. The new algorithm has a considerable cryptanalytic significance, since it can break knapsackbased cryptosystems with up to n = 100 generators. (Author)
6 editions published in 1980 in English and held by 7 WorldCat member libraries worldwide
In this paper we develop a general purpose algorithm that can solve a number of NPcomplete problems in time T=0(2 to the m/2 power) and space S=0(2 to the m/4 power). The algorithm can be generalized to a family of algorithms whose time and space complexities are related by TS2=0(2 to the ninth power). The problems it can handle are characterized by a few decomposition axioms, and they include knapsack problems, exact satisfiability problems, set covering problems, etc. The new algorithm has a considerable cryptanalytic significance, since it can break knapsackbased cryptosystems with up to n = 100 generators. (Author)
Bauhaus style : the architecture of Hebrew labor in British mandate Tel Aviv, Palestine by
Adi Shamir(
)
3 editions published in 2008 in English and held by 7 WorldCat member libraries worldwide
This study examines the construct of 'Hebrew labor' as the ideological, philosophical and strategic underpinning of the Nationalist, Zionist, Socialist settlement in Palestine. The thesis proposes that 'Hebrew labor' was manifest in the institutional structures and buildings of the Histadrut and Labor Movement and asserts that what is typically referred to as 'Bauhaus Style' a term referencing the transference of European architectural modernism must be understood as an architecture that is unique to the context of the Zionist project in Palestine and that it is manifest as the architecture of 'Hebrew labor'
3 editions published in 2008 in English and held by 7 WorldCat member libraries worldwide
This study examines the construct of 'Hebrew labor' as the ideological, philosophical and strategic underpinning of the Nationalist, Zionist, Socialist settlement in Palestine. The thesis proposes that 'Hebrew labor' was manifest in the institutional structures and buildings of the Histadrut and Labor Movement and asserts that what is typically referred to as 'Bauhaus Style' a term referencing the transference of European architectural modernism must be understood as an architecture that is unique to the context of the Zionist project in Palestine and that it is manifest as the architecture of 'Hebrew labor'
The noisy oracle problem by
U Feige(
Book
)
3 editions published in 1988 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We describe a model in which a computationally bounded verifier consults with a computationally unbounded oracle, in the presence of malicious faults on the communication lines. We require a fairness condition which in essence says that some of the oracle's messages arrive uncorrupted. We show that a deterministic polynomial time verifier can test membership in any language in Pspace, but cannot test membership in languages not in Pspace, even if he is allowed to toss random coins in private. We discuss the zero knowledge aspects of our model, and demonstrate zero knowledge tests of membership for any language in Pspace."
3 editions published in 1988 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We describe a model in which a computationally bounded verifier consults with a computationally unbounded oracle, in the presence of malicious faults on the communication lines. We require a fairness condition which in essence says that some of the oracle's messages arrive uncorrupted. We show that a deterministic polynomial time verifier can test membership in any language in Pspace, but cannot test membership in languages not in Pspace, even if he is allowed to toss random coins in private. We discuss the zero knowledge aspects of our model, and demonstrate zero knowledge tests of membership for any language in Pspace."
A fast signature scheme by
A Shamir(
Book
)
4 editions published in 1978 in English and Undetermined and held by 6 WorldCat member libraries worldwide
This paper proposes a new scheme for generating and verifying 'electronic signatures' in publickey communications. The scheme is based on the difficulty of solving the knapsack problem, and its two main advantages over previous schemes are speed and simplicity
4 editions published in 1978 in English and Undetermined and held by 6 WorldCat member libraries worldwide
This paper proposes a new scheme for generating and verifying 'electronic signatures' in publickey communications. The scheme is based on the difficulty of solving the knapsack problem, and its two main advantages over previous schemes are speed and simplicity
Finding minimum cutsets in reducible graphs by
Adi Shamir(
Book
)
3 editions published in 1977 in English and Undetermined and held by 6 WorldCat member libraries worldwide
3 editions published in 1977 in English and Undetermined and held by 6 WorldCat member libraries worldwide
Factoring numbers in 0 (log n) arithmetic steps by
A Shamir(
Book
)
3 editions published in 1977 in English and held by 6 WorldCat member libraries worldwide
A nontrivial factor of a composite number n can be found by performing arithmetic steps in a number proportional to the number of bits in n, and thus there are extremely short straightline factoring programs. However, this theoretical result does not imply that natural numbers can be factored in polynomial time in the TuringMachine model of complexity, since the numbers operated on can be as big as 2 to the power c nsquared, thus requiring exponentially many bit operations
3 editions published in 1977 in English and held by 6 WorldCat member libraries worldwide
A nontrivial factor of a composite number n can be found by performing arithmetic steps in a number proportional to the number of bits in n, and thus there are extremely short straightline factoring programs. However, this theoretical result does not imply that natural numbers can be factored in polynomial time in the TuringMachine model of complexity, since the numbers operated on can be as big as 2 to the power c nsquared, thus requiring exponentially many bit operations
Differential cryptanalysis of Feal and NHash by
E Biham(
Book
)
3 editions published in 1991 in English and held by 5 WorldCat member libraries worldwide
Abstract: "In [1,2] we introduced the notion of differential cryptanalysis and described its application to DES[11] and several of its variants. In this paper we show the applicability of differential cryptanalysis to the Feal family of encryption algorithms and to the NHash hash function. In addition, we show how to transform differential cryptanalytic chosen plaintext attacks into known plaintext attacks."
3 editions published in 1991 in English and held by 5 WorldCat member libraries worldwide
Abstract: "In [1,2] we introduced the notion of differential cryptanalysis and described its application to DES[11] and several of its variants. In this paper we show the applicability of differential cryptanalysis to the Feal family of encryption algorithms and to the NHash hash function. In addition, we show how to transform differential cryptanalytic chosen plaintext attacks into known plaintext attacks."
IP = Pspace by
Adi Shamir(
Book
)
3 editions published in 1990 in English and held by 5 WorldCat member libraries worldwide
Abstract: "In this paper we prove that when both randomization and interaction are allowed, the proofs which can be verified in polynomial time are exactly those proofs which can be generated with polynomial space."
3 editions published in 1990 in English and held by 5 WorldCat member libraries worldwide
Abstract: "In this paper we prove that when both randomization and interaction are allowed, the proofs which can be verified in polynomial time are exactly those proofs which can be generated with polynomial space."
The convergence of functions to fixedpoints of recursive definitions by
Zohar Manna(
Book
)
5 editions published in 1977 in English and Undetermined and held by 5 WorldCat member libraries worldwide
The classical method for constructing the least fixedpoint of a recursive definition is to generate a sequence of functions whose initial element is the totally undefined function and which converges to the desired least fixedpoint. This method, due to Kleen, cannot be generalized to allow the construction of other fixedpoints. This paper presents an alternate definition of convergence and a new fixedpoint access method of generating sequences of functions for a given recursive definition. The initial function of the sequence can be an arbitrary function, and the sequence will always converge to a fixedpoint that is 'close' to the initial function. This defines a monotonic mapping from the set of partial functions onto the set of all fixedpoints of the given recursive definition
5 editions published in 1977 in English and Undetermined and held by 5 WorldCat member libraries worldwide
The classical method for constructing the least fixedpoint of a recursive definition is to generate a sequence of functions whose initial element is the totally undefined function and which converges to the desired least fixedpoint. This method, due to Kleen, cannot be generalized to allow the construction of other fixedpoints. This paper presents an alternate definition of convergence and a new fixedpoint access method of generating sequences of functions for a given recursive definition. The initial function of the sequence can be an arbitrary function, and the sequence will always converge to a fixedpoint that is 'close' to the initial function. This defines a monotonic mapping from the set of partial functions onto the set of all fixedpoints of the given recursive definition
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Biham, Eli Author
 Rivest, Ronald L. Author
 Adleman, Leonard M.
 Manna, Zohar Author
 MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE
 Feige, U. Author
 Schnorr, C. P. Author
 Lapidot, Dror Author
 Schroeppel, Richard Author
 Sachs, Tamar Author
Useful Links
Associated Subjects
Adleman, Leonard M Algorithms Automatic theorem proving Computational complexity Computer networksSecurity measures Computer programming Computer programs ComputersAccess control ComputersAccess controlPasswords Computer science Computer security Cryptography CryptographyData processing Data encryption (Computer science) Electronic funds transfers Factors (Algebra) Flow charts Graphic methods Merkle, Ralph C.(Ralph Charles) Poker Polynomials Privacy, Right of Probabilities Recursive programming Rivest, Ronald L Shamir, Adi University of California, Berkeley.Department of Architecture
Covers
Alternative Names
Adi Šamir
Adi Šamir izraelský kryptolog
Adi Şamir Kriptoqrafiyaçı
Adi Shamir
Adi Shamir criptógrafo israelí
Adi Shamir crittografo, informatico e matematico israeliano
Adi Shamir cryptographer
Adi Shamir cryptologue israélien
Adi Shamir israelischer Kryptologieexperte
Adi Shamir izraelski informatyk i kryptograf
Adi Shamir wiskundige uit Israël
Šāmîr, ʿAdî 1962
Shamir, Adi
Ади Шамир
Аді Шамір
ادی شامیر
عدي شامير
आदी शामिर
আদি শামির
அதி சமீர்
아디 샤미르
アディ・シャミア
阿迪·萨莫尔 Cryptographer
Languages