Adi Shamir

According to our database1, Adi Shamir authored at least 210 papers between 1975 and 2019.

Collaborative distances:

Awards

Turing Prize recipient

Turing Prize 2002, "For RSA (algorithm)|their ingenious contribution for making public-key cryptography useful in practice." awarded to Ronald L. Rivest and Adi Shamir and Leonard M. Adleman.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Xerox Day Vulnerability.
IEEE Trans. Information Forensics and Security, 2019

New Slide Attacks on Almost Self-Similar Ciphers.
IACR Cryptology ePrint Archive, 2019

2018
The 9 Lives of Bleichenbacher's CAT: New Cache ATtacks on TLS Implementations.
IACR Cryptology ePrint Archive, 2018

Tight Bounds on Online Checkpointing Algorithms.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Pseudo Constant Time Implementations of TLS Are Only Pseudo Secure.
Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018

2017
Acoustic Cryptanalysis.
J. Cryptology, 2017

How to Eat Your Entropy and Have it Too: Optimal Recovery Strategies for Compromised RNGs.
Algorithmica, 2017

IoT Goes Nuclear: Creating a ZigBee Chain Reaction.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

2016
Key Recovery Attacks on Iterated Even-Mansour Encryption Schemes.
J. Cryptology, 2016

New Second-Preimage Attacks on Hash Functions.
J. Cryptology, 2016

IoT Goes Nuclear: Creating a ZigBee Chain Reaction.
IACR Cryptology ePrint Archive, 2016

Physical key extraction attacks on PCs.
Commun. ACM, 2016

Extended Functionality Attacks on IoT Devices: The Case of Smart Lights.
Proceedings of the IEEE European Symposium on Security and Privacy, 2016

Memory-Efficient Algorithms for Finding Needles in Haystacks.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
Slidex Attacks on the Even-Mansour Encryption Scheme.
J. Cryptology, 2015

New Attacks on IDEA with at Least 6 Rounds.
J. Cryptology, 2015

Almost universal forgery attacks on AES-based MAC's.
Des. Codes Cryptogr., 2015

Reflections on slide with a twist attacks.
Des. Codes Cryptogr., 2015

Improved Top-Down Techniques in Differential Cryptanalysis.
Proceedings of the Progress in Cryptology - LATINCRYPT 2015, 2015

New Attacks on Feistel Structures with Improved Memory Complexities.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Improved Practical Attacks on Round-Reduced Keccak.
J. Cryptology, 2014

Reflections on Slide with a Twist Attacks.
IACR Cryptology ePrint Archive, 2014

Dissection: a new paradigm for solving bicomposite search problems.
Commun. ACM, 2014

Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions.
Proceedings of the Progress in Cryptology - INDOCRYPT 2014, 2014

Improved Linear Sieving Techniques with Applications to Step-Reduced LED-64.
Proceedings of the Fast Software Encryption - 21st International Workshop, 2014

How Did Dread Pirate Roberts Acquire and Protect his Bitcoin Wealth?
Proceedings of the Financial Cryptography and Data Security, 2014

RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

How to Eat Your Entropy and Have It Too - Optimal Recovery Strategies for Compromised RNGs.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2.
IACR Cryptology ePrint Archive, 2013

Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys.
IACR Cryptology ePrint Archive, 2013

Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials.
Proceedings of the Fast Software Encryption - 20th International Workshop, 2013

Quantitative Analysis of the Full Bitcoin Transaction Graph.
Proceedings of the Financial Cryptography and Data Security, 2013

Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
A Practical Polynomial-Time Known-Plaintext Attack on a Cryptosystem Proposed by John Nash.
IACR Cryptology ePrint Archive, 2012

Self-Differential Cryptanalysis of Up to 5 Rounds of SHA-3.
IACR Cryptology ePrint Archive, 2012

Applying cube attacks to stream ciphers in realistic scenarios.
Cryptography and Communications, 2012

New Attacks on Keccak-224 and Keccak-256.
Proceedings of the Fast Software Encryption - 19th International Workshop, 2012

Improved Attacks on Full GOST.
Proceedings of the Fast Software Encryption - 19th International Workshop, 2012

Minimalism in Cryptography: The Even-Mansour Scheme Revisited.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Information, Data, Security in a Networked Future.
Proceedings of the ACM Turing Centenary Celebration, 2012

2011
TWIRL.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

RFID Authentication Efficient Proactive Information Security within Computational Security.
Theory Comput. Syst., 2011

ALRED Blues: New Attacks on AES-Based MAC's.
IACR Cryptology ePrint Archive, 2011

New Data-Efficient Attacks on Reduced-Round IDEA.
IACR Cryptology ePrint Archive, 2011

Breaking Grain-128 with Dynamic Cube Attacks.
Proceedings of the Fast Software Encryption - 18th International Workshop, 2011

An Improved Algebraic Attack on Hamsi-256.
Proceedings of the Fast Software Encryption - 18th International Workshop, 2011

An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable Hardware.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

2010
Comparative Power Analysis of Modular Exponentiation Algorithms.
IEEE Trans. Computers, 2010

Efficient Cache Attacks on AES, and Countermeasures.
J. Cryptology, 2010

Improved Single-Key Attacks on 8-round AES.
IACR Cryptology ePrint Archive, 2010

A Practical-Time Attack on the A5/3 Cryptosystem Used in Third Generation GSM Telephony.
IACR Cryptology ePrint Archive, 2010

Fast Exhaustive Search for Polynomial Systems in F2.
IACR Cryptology ePrint Archive, 2010

Generic Analysis of Small Cryptographic Leaks.
Proceedings of the 2010 Workshop on Fault Diagnosis and Tolerance in Cryptography, 2010

Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony.
Proceedings of the Advances in Cryptology, 2010

Fast Exhaustive Search for Polynomial Systems in F2.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2010

Improved Single-Key Attacks on 8-Round AES-192 and AES-256.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Un-Trusted-HB: Security Vulnerabilities of Trusted-HB.
IACR Cryptology ePrint Archive, 2009

Side Channel Cube Attacks on Block Ciphers.
IACR Cryptology ePrint Archive, 2009

Key Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds.
IACR Cryptology ePrint Archive, 2009

Efficient FPGA Implementations of High-Dimensional Cube Testers on the Stream Cipher Grain-128.
IACR Cryptology ePrint Archive, 2009

Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium.
Proceedings of the Fast Software Encryption, 16th International Workshop, 2009

Cube Attacks on Tweakable Black Box Polynomials.
Proceedings of the Advances in Cryptology, 2009

Cube Testers and Key Recovery Attacks On Reduced-Round MD6 and Trivium.
Proceedings of the Symmetric Cryptography, 11.01. - 16.01.2009, 2009

2008
Improved Related-key Attacks on Desx and Desx+.
Cryptologia, 2008

On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

SQUASH - A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags.
Proceedings of the Fast Software Encryption, 15th International Workshop, 2008

Second Preimage Attacks on Dithered Hash Functions.
Proceedings of the Advances in Cryptology, 2008

Bug Attacks.
Proceedings of the Advances in Cryptology, 2008

RSA-Past, Present, Future.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2008

Collision-Based Power Analysis of Modular Exponentiation Using Chosen-Message Pairs.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2008

2007
Remote Password Extraction from RFID Tags.
IEEE Trans. Computers, 2007

Length-based cryptanalysis: the case of Thompson's group.
J. Mathematical Cryptology, 2007

Second Preimage Attacks on Dithered Hash Functions.
IACR Cryptology ePrint Archive, 2007

Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions.
Proceedings of the Public Key Cryptography, 2007

Practical Cryptanalysis of SFLASH.
Proceedings of the Advances in Cryptology, 2007

Cryptanalysis of the SFLASH Signature Scheme.
Proceedings of the Information Security and Cryptology, Third SKLOIS Conference, 2007

2006
Length-based cryptanalysis: The case of Thompson's Group.
IACR Cryptology ePrint Archive, 2006

Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions.
Proceedings of the Fast Software Encryption, 13th International Workshop, 2006

Cache Attacks and Countermeasures: The Case of AES.
Proceedings of the Topics in Cryptology, 2006

Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs.
Proceedings of the Advances in Cryptology, 2006

How to Leak a Secret: Theory and Applications of Ring Signatures.
Proceedings of the Theoretical Computer Science, 2006

2005
TWIRL.
Proceedings of the Encyclopedia of Cryptography and Security, 2005

New Applications of T-Functions in Block Ciphers and Hash Functions.
Proceedings of the Fast Software Encryption: 12th International Workshop, 2005

Analysis of the Non-linear Part of Mugi.
Proceedings of the Fast Software Encryption: 12th International Workshop, 2005

Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization.
Proceedings of the Cryptographic Hardware and Embedded Systems - CHES 2005, 7th International Workshop, Edinburgh, UK, August 29, 2005

2004
New Cryptographic Primitives Based on Multiword T-Functions.
Proceedings of the Fast Software Encryption, 11th International Workshop, 2004

Fault Analysis of Stream Ciphers.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2004

Stream Ciphers: Dead or Alive?
Proceedings of the Advances in Cryptology, 2004

2003
Guaranteeing the diversity of number generators.
IACR Cryptology ePrint Archive, 2003

Cryptographic Applications of T-Functions.
Proceedings of the Selected Areas in Cryptography, 10th Annual International Workshop, 2003

RSA Shortcuts.
Proceedings of the Topics in Cryptology, 2003

Factoring Large Number with the TWIRL Device.
Proceedings of the Advances in Cryptology, 2003

Factoring Estimates for a 1024-Bit RSA Modulus.
Proceedings of the Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30, 2003

2002
The LSD Broadcast Encryption Scheme.
Proceedings of the Advances in Cryptology, 2002

A New Class of Invertible Mappings.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2002

Analysis of Bernstein's Factorization Circuit.
Proceedings of the Advances in Cryptology, 2002

Analysis of Neural Cryptography.
Proceedings of the Advances in Cryptology, 2002

2001
Guaranteeing the Diversity of Number Generators.
Inf. Comput., 2001

Weaknesses in the Key Scheduling Algorithm of RC4.
Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

A Practical Attack on Broadcast RC4.
Proceedings of the Fast Software Encryption, 8th International Workshop, 2001

SecureClick: A Web Payment System with Disposable Credit Card Numbers.
Proceedings of the Financial Cryptography, 2001

Structural Cryptanalysis of SASAS.
Proceedings of the Advances in Cryptology, 2001

Improved Online/Offline Signature Schemes.
Proceedings of the Advances in Cryptology, 2001

New Directions in Croptography.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2001

How to Leak a Secret.
Proceedings of the Advances in Cryptology, 2001

2000
Real Time Cryptanalysis of A5/1 on a PC.
Proceedings of the Fast Software Encryption, 7th International Workshop, 2000

Analysis and Optimization of the TWINKLE Factoring Device.
Proceedings of the Advances in Cryptology, 2000

Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations.
Proceedings of the Advances in Cryptology, 2000

Protecting Smart Cards from Passive Power Analysis with Detached Power Supplies.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2000

Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers.
Proceedings of the Advances in Cryptology, 2000

1999
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions.
SIAM J. Comput., 1999

How to Copyright a Function?
Proceedings of the Public Key Cryptography, 1999

Miss in the Middle Attacks on IDEA and Khufu.
Proceedings of the Fast Software Encryption, 6th International Workshop, 1999

Playing "Hide and Seek" with Stored Keys.
Proceedings of the Financial Cryptography, 1999

Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials.
Proceedings of the Advances in Cryptology, 1999

Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization.
Proceedings of the Advances in Cryptology, 1999

Factoring Large Numbers with the Twinkle Device (Extended Abstract).
Proceedings of the Cryptographic Hardware and Embedded Systems, 1999

1998
Initial Observations on Skipjack: Cryptanalysis of Skipjack-3XOR.
Proceedings of the Selected Areas in Cryptography '98, 1998

The Steganographic File System.
Proceedings of the Information Hiding, 1998

Visual Cryptanalysis.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

Cryptanalysis of the Oil & Vinegar Signature Scheme.
Proceedings of the Advances in Cryptology, 1998

1997
Fully Parallelized Multi-Prover Protocols for NEXP-Time.
J. Comput. Syst. Sci., 1997

Lattice Attacks on NTRU.
Proceedings of the Advances in Cryptology, 1997

Differential Fault Analysis of Secret Key Cryptosystems.
Proceedings of the Advances in Cryptology, 1997

1996
PayWord and MicroMint: Two Simple Micropayment Schemes.
Proceedings of the Security Protocols, 1996

Visual Cryptography II: Improving the Contrast Via the Cover Base.
Proceedings of the Security Protocols, 1996

1994
Memory Efficient Variants of Public-Key Schemes for Smart Card Applications.
Proceedings of the Advances in Cryptology, 1994

Visual Cryptography.
Proceedings of the Advances in Cryptology, 1994

1993
On Dice and Coins: Models of Computation for Random Generation
Inf. Comput., June, 1993

Universal Tests for Nonuniform Distributions.
J. Cryptology, 1993

The Discrete Logarithm Modulo a Composite Hides O(n) Bits.
J. Comput. Syst. Sci., 1993

On the generation of multivariate polynomials which are hard to factor.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Practical Cryptography - Recent Trends and Results.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

Efficient Signature Schemes Based on Birational Permutations.
Proceedings of the Advances in Cryptology, 1993

Differential Cryptanalysis of the Data Encryption Standard.
Springer, ISBN: 978-1-4613-9316-0, 1993

1992
Multi-Oracle Interactive Protocols with Constant Space Verifiers.
J. Comput. Syst. Sci., 1992

IP = PSPACE.
J. ACM, 1992

Differential Cryptanalysis of the Full 16-Round DES.
Proceedings of the Advances in Cryptology, 1992

1991
Fully Parallelized Multi Prover Protocols for NEXP-Time (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Differential Cryptanalysis of Feal and N-Hash.
Proceedings of the Advances in Cryptology, 1991

A One-Round, Two-Prover, Zero-Knowledge Protocol for NP.
Proceedings of the Advances in Cryptology, 1991

Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer.
Proceedings of the Advances in Cryptology, 1991

1990
The Discrete Log is Very Discreet
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Witness Indistinguishable and Witness Hiding Protocols
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

IP=PSPACE
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

On the Universality of the Next Bit Test.
Proceedings of the Advances in Cryptology, 1990

Publicly Verifiable Non-Interactive Zero-Knowledge Proofs.
Proceedings of the Advances in Cryptology, 1990

Differential Cryptanalysis of DES-like Cryptosystems.
Proceedings of the Advances in Cryptology, 1990

1989
How to find a battleship.
Networks, 1989

On Dice and Coins: Models of Computation for Random Generation.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

Planning and Learning in Permutation Groups
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

On Expected Polynomial Time Simulation of Zero Knowledge Protocols.
Proceedings of the Distributed Computing And Cryptography, 1989

An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract).
Proceedings of the Advances in Cryptology, 1989

Zero Knowledge Proofs of Knowledge in Two Rounds.
Proceedings of the Advances in Cryptology, 1989

Multi-Oracle Interactive Protocols with Space Bounded Verifiers.
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988
Reconstructing Truncated Integer Variables Satisfying Linear Congruences.
SIAM J. Comput., 1988

Zero-Knowledge Proofs of Identity.
J. Cryptology, 1988

An Improvement of the Fiat-Shamir Identification and Signature Scheme.
Proceedings of the Advances in Cryptology, 1988

The Noisy Oracle Problem.
Proceedings of the Advances in Cryptology, 1988

1987
Zero Knowledge Proofs of Identity
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

A Video Scrambling Technique Based On Space Filling Curves.
Proceedings of the Advances in Cryptology, 1987

1986
Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers.
J. Comput. Syst. Sci., 1986

An Optimal Sorting Algorithm for Mesh Connected Computers
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks.
Proceedings of the International Conference on Parallel Processing, 1986

How to Prove Yourself: Practical Solutions to Identification and Signature Problems.
Proceedings of the Advances in Cryptology, 1986

1985
Number-Theoretic Functions Which Are Equivalent to Number of Divisors.
Inf. Process. Lett., 1985

The Cryptographic Security of Truncated Linearly Related Variables
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Polymorphic Arrays: An Architecture for a Programmable Systolic Machine.
Proceedings of the International Conference on Parallel Processing, 1985

Efficient Factoring Based on Partial Information.
Proceedings of the Advances in Cryptology, 1985

On the Security of DES.
Proceedings of the Advances in Cryptology, 1985

On the Security of Ping-Pong Protocols when Implemented using the RSA.
Proceedings of the Advances in Cryptology, 1985

1984
Generalized 'write-once' memories.
IEEE Trans. Information Theory, 1984

Cryptanalysis of Certain Variants of Rabin's Signature Scheme.
Inf. Process. Lett., 1984

How to Expose an Eavesdropper.
Commun. ACM, 1984

An Efficient Signature Scheme Based on Quadratic Equations
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

Identity-Based Cryptosystems and Signature Schemes.
Proceedings of the Advances in Cryptology, 1984

Efficient Signature Schemes Based on Polynomial Equations.
Proceedings of the Advances in Cryptology, 1984

1983
On the Generation of Cryptographically Strong Pseudorandom Sequences
ACM Trans. Comput. Syst., 1983

Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems.
Inf. Process. Lett., 1983

A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint).
Commun. ACM, 1983

On the Cryptographic Security of Single RSA Bits
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982
How to Reuse a "Write-Once" Memory
Information and Control, 1982

How to Reuse a "Write-Once" Memory (Preliminary Version).
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981
A T=O(2n/2), S=O(2n/4) Algorithm for Certain NP-Complete Problems.
SIAM J. Comput., 1981

On the Generation of Cryptographically Strong Pseudo-Random Sequences.
Proceedings of the Automata, 1981

The Generation of Cryptographically Strong Pseudo-Random Sequences.
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

1980
On the security of the Merkle- Hellman cryptographic scheme (Corresp.).
IEEE Trans. Information Theory, 1980

The Cryptographic Security of Compact Knapsacks (Preliminary Report).
Proceedings of the 1980 IEEE Symposium on Security and Privacy, 1980

On the Power of Commutativity in Cryptography.
Proceedings of the Automata, 1980

1979
A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs.
SIAM J. Comput., 1979

Factoring Numbers in O(log n) Arithmetic Steps.
Inf. Process. Lett., 1979

How to Share a Secret.
Commun. ACM, 1979

On the Cryptocomplexity of Knapsack Systems
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

A T S^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete Problems
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978
The Convergence of Functions to Fixedpoints of Recursive Definitions.
Theor. Comput. Sci., 1978

A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.
Commun. ACM, 1978

1977
The Optimal Approach to Recursive Programs.
Commun. ACM, 1977

Data Types as Objects.
Proceedings of the Automata, 1977

1976
The Theoretical Aspects of the Optimal Fixed Point.
SIAM J. Comput., 1976

On the Complexity of Timetable and Multicommodity Flow Problems.
SIAM J. Comput., 1976

1975
The Optimal Fixedpoint of Recursive Programs
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

On the Complexity of Timetable and Multi-Commodity Flow Problems
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975


  Loading...