Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
type: Item
instance of: scholarly article
title: Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
zbMATH Open document ID: 1294.94042
DOI: 10.1007/978-3-642-32009-5_42
author: Itai Dinur
author: Orr Dunkelman
author: Nathan Keller
author: Adi Shamir
published in: Lecture Notes in Computer Science
publication date: 2012-09-25T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6086105
zbMATH Keywords: cryptanalysis
zbMATH Keywords: TM-tradeoff
zbMATH Keywords: multi-encryption
zbMATH Keywords: knapsacks
zbMATH Keywords: bicomposite
zbMATH Keywords: dissection
zbMATH Keywords: rebound
MaRDI profile type: Publication
full work available at URL: 978-3-642-32009-5 42
OpenAlex ID: W2252401345
Recommended article: From Multiple Encryption to Knapsacks – Efficient Dissection of Composite Problems
Recommended article: Efficient dissection of bicomposite problems with cryptanalytic applications
Recommended article: COMBINATORIAL OPTIMIZATION AND THE KNAPSACK CIPHER
Recommended article: Q4737755
Recommended article: Q3484639
Recommended article: On the complexity of separation from the knapsack polytope
Recommended article: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
Recommended article: Complexity results and exact algorithms for robust knapsack problems
Recommended article: Discrete relaxations of combinatorial programs
Recommended article: Complexity of Positivstellensatz proofs for the knapsack
description: scientific article