On the public citation graph

Improved low-density subset sum algorithms

https://doi.org/10.1007/bf01201999
0 signed · 222 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-18088-5_33openalex-snapshot
Approximating integer lattices by lattices with cyclic factor groups
inferredcites →https://doi.org/10.1007/3-540-46416-6_4openalex-snapshot
An Improved Low-Density Subset Sum Algorithm
inferredcites →https://doi.org/10.1007/3-540-54458-5_51openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferredcites →https://doi.org/10.1007/3-540-54458-5_70openalex-snapshot
Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems
inferredcites →https://doi.org/10.1007/978-1-4684-4730-9_2openalex-snapshot
Solving Low Density Knapsacks
inferredcites →https://doi.org/10.1007/978-94-009-2794-0_7openalex-snapshot
What Happened with Knapsack Cryptographic Schemes?
inferredcites →https://doi.org/10.1007/bf01202355openalex-snapshot
Simultaneous reduction of a lattice basis and its reciprocal basis
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bf01571276openalex-snapshot
Lattice points in high-dimensional spheres
inferredcites →https://doi.org/10.1016/0196-6774(88)90004-1openalex-snapshot
A more efficient algorithm for lattice basis reduction
inferredcites →https://doi.org/10.1016/0304-3975(87)90064-8openalex-snapshot
A hierarchy of polynomial time lattice basis reduction algorithms
inferredcites →https://doi.org/10.1109/18.21214openalex-snapshot
A knapsack-type public key cryptosystem based on arithmetic in finite fields
inferredcites →https://doi.org/10.1109/5.4443openalex-snapshot
Cryptanalysis: a survey of recent results
inferredcites →https://doi.org/10.1137/0215038openalex-snapshot
On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
inferredcites →https://doi.org/10.1137/0218037openalex-snapshot
Succinct Certificates for Almost All Subset Sum Problems
inferredcites →https://doi.org/10.1137/0218059openalex-snapshot
Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
inferredcites →https://doi.org/10.1145/2455.2461openalex-snapshot
Solving low-density subset sum problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4536622openalex-extracted
Self-Masking for Hardening Inversions1
inferred← citeshttps://doi.org/10.1002/(sici)1520-6610(1998)6:2<79::aid-jcd1>3.0.co;2-sopenalex-snapshot
Finding simplet-designs with enumeration techniques
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0093openalex-snapshot
Basis Reduction Methods
inferred← citeshttps://doi.org/10.1007/10722028_4openalex-snapshot
Lattice Reduction in Cryptology: An Update
inferred← citeshttps://doi.org/10.1007/10722028_7openalex-snapshot
New Results on Lattice Basis Reduction in Practice
inferred← citeshttps://doi.org/10.1007/11593447_3openalex-snapshot
Adapting Density Attacks to Low-Weight Knapsacks
inferred← citeshttps://doi.org/10.1007/11792086_17openalex-snapshot
Practical Lattice Basis Sampling Reduction
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_28openalex-snapshot
Secure Server-Aided Signature Generation
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferred← citeshttps://doi.org/10.1007/3-540-44691-5_6openalex-snapshot
Lattice Basis Reduction with Dynamic Approximation
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_4openalex-snapshot
Noisy Polynomial Interpolation and Noisy Chinese Remaindering
inferred← citeshttps://doi.org/10.1007/3-540-45682-1_2openalex-snapshot
On the Insecurity of a Server-Aided RSA Protocol
inferred← citeshttps://doi.org/10.1007/3-540-45712-7_17openalex-snapshot
Operator Learning for a Problem Class in a Distributed Peer-to-Peer Environment
inferred← citeshttps://doi.org/10.1007/3-540-46766-1_15openalex-snapshot
The Cryptanalysis of a New Public-Key Cryptosystem based on Modular Knapsacks
inferred← citeshttps://doi.org/10.1007/3-540-48285-7_5openalex-snapshot
Weaknesses of a public-key cryptosystem based on factorizations of finite groups
inferred← citeshttps://doi.org/10.1007/3-540-48329-2_2openalex-snapshot
A new identification scheme based on syndrome decoding
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_3openalex-snapshot
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications
inferred← citeshttps://doi.org/10.1007/3-540-57332-1_40openalex-snapshot
Cryptanalysis of another knapsack cryptosystem
inferred← citeshttps://doi.org/10.1007/3-540-69346-7_18openalex-snapshot
Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables
inferred← citeshttps://doi.org/10.1007/978-1-4612-4140-9_11openalex-snapshot
On a Subset Sum Algorithm and Its Probabilistic and Other Applications
inferred← citeshttps://doi.org/10.1007/978-1-4615-0895-3_18openalex-snapshot
Lattices and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-36030-6_4openalex-snapshot
Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_1openalex-snapshot
A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_2openalex-snapshot
Search for Combinatorial Objects Using Lattice Algorithms – Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-21017-4_22openalex-snapshot
Brief Announcement: Self Masking for Hardening Inversions
inferred← citeshttps://doi.org/10.1007/978-3-031-22966-4_13openalex-snapshot
Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with Rejection
inferred← citeshttps://doi.org/10.1007/978-3-031-50594-2_10openalex-snapshot
Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems
inferred← citeshttps://doi.org/10.1007/978-3-032-02717-7_24openalex-snapshot
On Acceleration of Logarithms Computing in the Chor-Rivest Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_23openalex-snapshot
The Dark Side of the Hidden Number Problem: Lattice Attacks on DSA
inferred← citeshttps://doi.org/10.1007/978-3-319-04720-1_11openalex-snapshot
Balanced Integer Solutions of Linear Equations
inferred← citeshttps://doi.org/10.1007/978-3-319-07995-0_37openalex-snapshot
Cryptanalytic Results on Knapsack Cryptosystem Using Binary Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-16715-2_13openalex-snapshot
Finding Shortest Lattice Vectors in the Presence of Gaps
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_52openalex-snapshot
A New Non-Merkle-Damgård Structural Hash Function with Provable Security
inferred← citeshttps://doi.org/10.1007/978-3-319-21398-9_53openalex-snapshot
A Public Key Cryptoscheme Using Bit-Pairs with Provable Semantical Security
inferred← citeshttps://doi.org/10.1007/978-3-319-53518-0_7openalex-snapshot
A Review of Modern Cryptography: From the World War II Era to the Big-Data Era
inferred← citeshttps://doi.org/10.1007/978-3-319-74325-7_4openalex-snapshot
Solutions of Hard Knapsack Problems Using Extreme Pruning
inferred← citeshttps://doi.org/10.1007/978-3-319-78813-5_6openalex-snapshot
Twisting Lattice and Graph Techniques to Compress Transactional Ledgers
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_25openalex-snapshot
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_25openalex-snapshot
Cryptographic Approaches to Privacy in Forensic DNA Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-68164-9_11openalex-snapshot
New Definition of Density on Knapsack Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-540-69311-6_31openalex-snapshot
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-76969-9_16openalex-snapshot
Toward Non-parallelizable Client Puzzles
inferred← citeshttps://doi.org/10.1007/978-3-540-79456-1_28openalex-snapshot
An Improved Multi-set Algorithm for the Dense Subset Sum Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_23openalex-snapshot
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_25openalex-snapshot
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
inferred← citeshttps://doi.org/10.1007/978-3-642-01957-9_28openalex-snapshot
Broadcast Attacks against Lattice-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-642-03869-3_88openalex-snapshot
Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_12openalex-snapshot
New Generic Algorithms for Hard Knapsacks
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_13openalex-snapshot
Lattice Enumeration Using Extreme Pruning
inferred← citeshttps://doi.org/10.1007/978-3-642-13739-6_28openalex-snapshot
Performance Evaluation of Non-parallelizable Client Puzzles for Defeating DoS Attacks in Authentication Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-15317-4_21openalex-snapshot
Recursive Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_21openalex-snapshot
Improved Generic Algorithms for Hard Knapsacks
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_28openalex-snapshot
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
inferred← citeshttps://doi.org/10.1007/978-3-642-24650-0_4openalex-snapshot
Improving the Parallel Schnorr-Euchner LLL Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-29952-0_18openalex-snapshot
Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-31448-3_4openalex-snapshot
Faster Algorithm for Solving Hard Knapsacks for Moderate Message Length
inferred← citeshttps://doi.org/10.1007/978-3-642-32928-9_18openalex-snapshot
New Attacks for Knapsack Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-642-35999-6_18openalex-snapshot
Lattice Reduction for Modular Knapsack
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_48openalex-snapshot
Outsourced Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_23openalex-snapshot
Solving Random Subset Sum Problem by l p -norm SVP Oracle
inferred← citeshttps://doi.org/10.1007/978-3-662-47989-6_3openalex-snapshot
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
inferred← citeshttps://doi.org/10.1007/978-94-015-1288-6_12openalex-snapshot
L
inferred← citeshttps://doi.org/10.1007/bf01581144openalex-snapshot
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
inferred← citeshttps://doi.org/10.1007/bfb0052236openalex-snapshot
Merkle-Hellman revisited: A cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations
inferred← citeshttps://doi.org/10.1007/bfb0054013openalex-snapshot
Lattices and cryptography: An overview
inferred← citeshttps://doi.org/10.1007/bfb0054129openalex-snapshot
Speeding up discrete log and factoring based schemes via precomputations
inferred← citeshttps://doi.org/10.1007/bfb0055731openalex-snapshot
Cryptanalysis of the Ajtai-Dwork cryptosystem
inferred← citeshttps://doi.org/10.1007/s00037-007-0234-9openalex-snapshot
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
inferred← citeshttps://doi.org/10.1007/s00145-018-9304-1openalex-snapshot
Improved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem
inferred← citeshttps://doi.org/10.1007/s001459900042openalex-snapshot
Lattice Reduction: A Toolbox for the Cryptanalyst
inferred← citeshttps://doi.org/10.1007/s00200-017-0323-1openalex-snapshot
A pseudorandom number generator based on worst-case lattice problems
inferred← citeshttps://doi.org/10.1007/s10207-015-0308-7openalex-snapshot
Efficient and verifiable algorithms for secure outsourcing of cryptographic computations
inferred← citeshttps://doi.org/10.1007/s10207-017-0374-0openalex-snapshot
Outsourced pattern matching
inferred← citeshttps://doi.org/10.1007/s10479-012-1143-0openalex-snapshot
Solving market split problems with heuristical lattice reduction
inferred← citeshttps://doi.org/10.1007/s10586-013-0252-0openalex-snapshot
Outsourcing computation of modular exponentiations in cloud computing
inferred← citeshttps://doi.org/10.1007/s10623-007-9058-5openalex-snapshot
Low-density attack revisited
inferred← citeshttps://doi.org/10.1007/s10623-015-0067-5openalex-snapshot
Finding shortest lattice vectors faster using quantum search
inferred← citeshttps://doi.org/10.1007/s10623-026-01913-yopenalex-snapshot
A knapsack McEliece-based public key cryptosystem
inferred← citeshttps://doi.org/10.1007/s10898-017-0514-0openalex-snapshot
A new fully polynomial time approximation scheme for the interval subset sum problem
inferred← citeshttps://doi.org/10.1007/s11036-019-01216-8openalex-snapshot
Cryptanalysis of Merkle-Hellman Cipher Using Parallel Genetic Algorithm
inferred← citeshttps://doi.org/10.1007/s11424-015-3324-9openalex-snapshot
Solving low-density multiple subset sum problems with SVP oracle
inferred← citeshttps://doi.org/10.1007/s11434-014-0344-0openalex-snapshot
A quantum algorithm for the dihedral hidden subgroup problem based on lattice basis reduction algorithm
inferred← citeshttps://doi.org/10.1016/j.camwa.2008.09.006openalex-snapshot
Safer parameters for the Chor–Rivest cryptosystem
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.08.031openalex-snapshot
Quadratic compact knapsack public-key cryptosystem
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.035openalex-snapshot
Bisecting binomial coefficients
inferred← citeshttps://doi.org/10.1016/j.disopt.2012.06.002openalex-snapshot
Lattice-based algorithms for number partitioning in the hard phase
inferred← citeshttps://doi.org/10.1016/j.ejor.2018.11.055openalex-snapshot
An improved balanced algorithm for the subset-sum problem
inferred← citeshttps://doi.org/10.1016/j.ffa.2004.07.001openalex-snapshot
Koblitz curve cryptosystems
inferred← citeshttps://doi.org/10.1016/j.ins.2009.08.030openalex-snapshot
Analysis of the efficiency of the Chor–Rivest cryptosystem implementation in a safe-parameter range
inferred← citeshttps://doi.org/10.1016/j.ins.2018.04.021openalex-snapshot
Improved broadcast attacks against subset sum problems via lattice oracle
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.10.004openalex-snapshot
A note on BDD problems with λ2 -gap
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.01.002openalex-snapshot
The inapproximability of lattice and coding problems with preprocessing
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.002openalex-snapshot
The Projection Games Conjecture and the hardness of approximation of super-SAT and related problems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2018.04.014openalex-snapshot
Accelerating subset sum and lattice based public-key cryptosystems with multi-core CPUs and GPUs
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.06.008openalex-snapshot
Asymptotic granularity reduction and its application
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.011openalex-snapshot
A public key cryptosystem based on three new provable problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.10.011openalex-snapshot
Lower bounds of shortest vector lengths in random NTRU lattices
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.023openalex-snapshot
A provably secure non-iterative hash function resisting birthday attack
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.017openalex-snapshot
A semantically secure public key cryptoscheme using bit-pair shadows
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.015openalex-snapshot
Tightly secure signature schemes from the LWE and subset sum assumptions
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115094openalex-snapshot
Self-masking for hardening inversions
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00337-7openalex-snapshot
Non-standard approaches to integer programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00297-2openalex-snapshot
Non-injective knapsack public-key cryptosystems
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12004-0openalex-snapshot
Integer Programming, Lattices, and Results in Fixed Dimension
inferred← citeshttps://doi.org/10.1017/s0963548300001371openalex-snapshot
Block Reduced Lattice Bases and Successive Minima
inferred← citeshttps://doi.org/10.1017/s0963548399003764openalex-snapshot
A Measure for the Non-Orthogonality of a Lattice Basis
inferred← citeshttps://doi.org/10.1023/a:1013355015853openalex-snapshot
Attacking the Market Split Problem with Lattice Point Enumeration
inferred← citeshttps://doi.org/10.1038/s41378-026-01341-xopenalex-snapshot
Amplification of computational power by the multiplication of bacteria exploring microfluidic networks encoding mathematical problems
inferred← citeshttps://doi.org/10.1049/iet-com.2013.0180openalex-snapshot
Analysis of two knapsack public key cryptosystems
inferred← citeshttps://doi.org/10.1049/iet-ifs.2017.0107openalex-snapshot
Deterministic lattice reduction on knapsacks with collision‐free properties
inferred← citeshttps://doi.org/10.1080/00150517.2015.12428284openalex-snapshot
A Knapsack-Like Code Using Recurrence Sequence Representations
inferred← citeshttps://doi.org/10.1088/0253-6102/66/4/401openalex-snapshot
General Quantum Meet-in-the-Middle Search Algorithm Based on Target Solution of Fixed Weight*
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-00995-3openalex-snapshot
Analysis of PSLQ, an integer relation finding algorithm
inferred← citeshttps://doi.org/10.1101/gr.282202.126openalex-snapshot
Private information leakage from polygenic risk scores
inferred← citeshttps://doi.org/10.1103/prxquantum.2.020319openalex-snapshot
Number Partitioning With Grover’s Algorithm in Central Spin Systems
inferred← citeshttps://doi.org/10.1109/18.556672openalex-snapshot
A new paradigm for public key identification
inferred← citeshttps://doi.org/10.1109/18.915688openalex-snapshot
The hardness of the closest vector problem with preprocessing
inferred← citeshttps://doi.org/10.1109/access.2020.3031276openalex-snapshot
A Review of Sieve Algorithms in Solving the Shortest Lattice Vector Problem
inferred← citeshttps://doi.org/10.1109/access.2020.3033306openalex-snapshot
Securely Outsource Modular Exponentiations With Single Untrusted Cloud Server
inferred← citeshttps://doi.org/10.1109/acsac.2009.33openalex-snapshot
A Guided Tour Puzzle for Denial of Service Prevention
inferred← citeshttps://doi.org/10.1109/aina.2012.43openalex-snapshot
Knapsack Cryptosystems and Unreliable Reliance on Density
inferred← citeshttps://doi.org/10.1109/ccc.2002.1004338openalex-snapshot
The inapproximability of lattice and coding problems with preprocessing
inferred← citeshttps://doi.org/10.1109/cctae.2010.5544339openalex-snapshot
Fast public key algorithm of knapsack type
inferred← citeshttps://doi.org/10.1109/cec.2002.1004471openalex-snapshot
A scalable and robust framework for distributed applications
inferred← citeshttps://doi.org/10.1109/cis.2011.147openalex-snapshot
Analysis of the Success Rate of the LLL Lattice Basis Reduction
inferred← citeshttps://doi.org/10.1109/cis.2013.102openalex-snapshot
Analysis of Success Rate of Attacking Knapsacks from JUNA Cryptosystem by LLL Lattice Basis Reduction
inferred← citeshttps://doi.org/10.1109/focs.2015.41openalex-snapshot
Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!
inferred← citeshttps://doi.org/10.1109/hpcc.2011.61openalex-snapshot
Parallel Lattice Basis Reduction - The Road to Many-Core
inferred← citeshttps://doi.org/10.1109/i2ct45611.2019.9033917openalex-snapshot
Cryptanalyzing Merkle-Hellman Public Key Cryptosystem with Artificial Neural Networks
inferred← citeshttps://doi.org/10.1109/ias.2009.300openalex-snapshot
A New Knapsack Public-Key Cryptosystem
inferred← citeshttps://doi.org/10.1109/ic3.2015.7346740openalex-snapshot
Analysis of the improved knapsack cipher
inferred← citeshttps://doi.org/10.1109/icasid.2012.6325281openalex-snapshot
Empirical exploration of lattice attacks for building secure knapsack cryptosystems
inferred← citeshttps://doi.org/10.1109/iccasm.2010.5622956openalex-snapshot
Cryptanalysis of two knapsack-type public-key cryptosystems
inferred← citeshttps://doi.org/10.1109/icsmc.1995.537834openalex-snapshot
Solving large knapsack problems with a genetic algorithm
inferred← citeshttps://doi.org/10.1109/incos.2012.31openalex-snapshot
Efficient and Secure Batch Exponentiations Outsourcing in Cloud Computing
inferred← citeshttps://doi.org/10.1109/incos.2012.89openalex-snapshot
Key Recovery Attack on a Knapsack Public Key Cryptosystem
inferred← citeshttps://doi.org/10.1109/incos.2012.90openalex-snapshot
Lattice Attack on the Knapsack Cipher 0/255
inferred← citeshttps://doi.org/10.1109/isita.2010.5649321openalex-snapshot
On the critical density associated with the matrix type knapsack cryptosystem
inferred← citeshttps://doi.org/10.1109/jiot.2023.3279283openalex-snapshot
ACKE: Asymmetric Computing Key Exchange Protocol for IoT Environments
inferred← citeshttps://doi.org/10.1109/pdcat.2008.70openalex-snapshot
Operation of Super Long Integers in Cryptographic Applications
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743432openalex-snapshot
The shortest vector in a lattice is hard to approximate to within some constant
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181960openalex-snapshot
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions
inferred← citeshttps://doi.org/10.1109/tifs.2015.2421875openalex-snapshot
On the Linearization of Human Identification Protocols: Attacks Based on Linear Algebra, Coding Theory, and Lattices
inferred← citeshttps://doi.org/10.1134/s0965542523010116openalex-snapshot
Generalization of the Subset Sum Problem and Cubic Forms
inferred← citeshttps://doi.org/10.1134/s207004661604004xopenalex-snapshot
Simultaneous approximation problems of p-adic numbers and p-adic knapsack cryptosystems - Alice in p-adic numberland
inferred← citeshttps://doi.org/10.1137/100811970openalex-snapshot
A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
inferred← citeshttps://doi.org/10.1137/17m1158203openalex-snapshot
Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539700373039openalex-snapshot
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
inferred← citeshttps://doi.org/10.1142/s0129054123500296openalex-snapshot
Smooth Subsum Search A Heuristic for Practical Integer Factorization
inferred← citeshttps://doi.org/10.1145/1806689.1806739openalex-snapshot
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
inferred← citeshttps://doi.org/10.1145/2810103.2813723openalex-snapshot
Lattice Basis Reduction Attack against Physically Unclonable Functions
inferred← citeshttps://doi.org/10.1145/3055259.3055268openalex-snapshot
Privacy-preserving Hybrid Recommender System
inferred← citeshttps://doi.org/10.1145/3055399.3055467openalex-snapshot
Faster space-efficient algorithms for subset sum and k-sum
inferred← citeshttps://doi.org/10.1145/352600.352616openalex-snapshot
Multi-round passive attacks on server-aided RSA protocols
inferred← citeshttps://doi.org/10.1145/780542.780578openalex-snapshot
Random knapsack in expected polynomial time
inferred← citeshttps://doi.org/10.1145/944618.944619openalex-snapshot
Heuristics on lattice basis reduction in practice
inferred← citeshttps://doi.org/10.11540/jsiamt.18.1_185openalex-snapshot
OTU2000の鍵生成および関連する問題について(数論アルゴリズムとその応用, 平成19年研究部会連合発表会)
inferred← citeshttps://doi.org/10.11540/jsiamt.18.4_687openalex-snapshot
Knapsack暗号への攻撃を効果的にするためのSampling Reductionの改良と考察(応用,数論アルゴリズムとその応用, 平成20年研究部会連合発表)
inferred← citeshttps://doi.org/10.1155/2014/475678openalex-snapshot
Preimage Selective Trapdoor Function: How to Repair an Easy Problem
inferred← citeshttps://doi.org/10.1155/2018/2363928openalex-snapshot
Privacy-Preserving Oriented Floating-Point Number Fully Homomorphic Encryption Scheme
inferred← citeshttps://doi.org/10.1287/moor.25.3.427.12219openalex-snapshot
Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables
inferred← citeshttps://doi.org/10.12988/ams.2018.8687openalex-snapshot
A disaggregation approach for solving linear Diophantine equations
inferred← citeshttps://doi.org/10.14495/jsiaml.2.29openalex-snapshot
A knapsack public-key cryptosystem with cyclic code over $GF(2)$
inferred← citeshttps://doi.org/10.1515/dmvm-1993-0408openalex-snapshot
Leserbriefe
inferred← citeshttps://doi.org/10.15439/2025f5496openalex-snapshot
Adiabatic Quantum Computing for the Subset Sum Problem: Preliminary Studies
inferred← citeshttps://doi.org/10.1587/transfun.2023tal0004openalex-snapshot
High-Density Knapsack Cryptosystem Using Shifted-Odd and Super-Increasing Sequence
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.1058openalex-snapshot
New Conditions for Secure Knapsack Schemes against Lattice Attack
inferred← citeshttps://doi.org/10.1587/transfun.e95.a.903openalex-snapshot
On the Hardness of Subset Sum Problem from Different Intervals
inferred← citeshttps://doi.org/10.1587/transfun.e97.a.298openalex-snapshot
A Note on Security of Public-Key Cryptosystem Provably as Secure as Subset Sum Problem
inferred← citeshttps://doi.org/10.1587/transfun.e97.a.421openalex-snapshot
Improvement on a Knapsack-Based Probabilistic Encryption Scheme
inferred← citeshttps://doi.org/10.18419/opus-2891openalex-snapshot
Der Algorithmus von Howgrave-Graham und Joux zur Lösung von Rucksackproblemen
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1504750/v1openalex-snapshot
Cryptanalysis of the quantum public-key cryptosystem OTU under heuristics from combinatorial statements
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2411586/v1openalex-snapshot
Provably Solving the Subset Sum Problem by lp-norm SVP Oracle
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3887968/v1openalex-snapshot
Quantum Nested Search for Lattice Enumeration
inferred← citeshttps://doi.org/10.23919/cje.2014.10848014openalex-snapshot
Analysis of Two Public Key Cryptosystems Based on Randomized Knapsack Sequences
inferred← citeshttps://doi.org/10.2991/ccis-13.2013.33openalex-snapshot
A Probabilistic Encryption Way in Knapsack PKC
inferred← citeshttps://doi.org/10.31857/s0044466923010118openalex-snapshot
Generalization of the Subset Sum Problem and Cubic Forms
inferred← citeshttps://doi.org/10.3390/a14120362openalex-snapshot
Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in ℓp Norm
inferred← citeshttps://doi.org/10.3390/cryptography7020031openalex-snapshot
Inferring Bivariate Polynomials for Homomorphic Encryption Application
inferred← citeshttps://doi.org/10.3390/math11030766openalex-snapshot
Lattice Enumeration with Discrete Pruning: Improvements, Cost Estimation and Optimal Parameters
inferred← citeshttps://doi.org/10.3934/amc.2018026openalex-snapshot
Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.441.678openalex-snapshot
An Extended Knapsack Public Key Cryptosystem
inferred← citeshttps://doi.org/10.4086/cjtcs.2006.002openalex-snapshot
inferred← citeshttps://doi.org/10.4230/dagsemproc.09221.4openalex-snapshot
Probabilistic Analysis of LLL Reduced Bases
inferred← citeshttps://doi.org/10.4230/lipics.esa.2019.73openalex-snapshot
Equal-Subset-Sum Faster Than the Meet-in-the-Middle
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2015.48openalex-snapshot
Subset Sum in the Absence of Concentration
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2016.13openalex-snapshot
Dense Subset Sum May Be the Hardest
inferred← citeshttps://doi.org/10.4233/uuid:5b9353c1-6d89-4730-b1ff-caca2301ed92openalex-snapshot
On Lattice Methods in Integer Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.0807.3355openalex-snapshot
Parallel Approximation and Integer Programming Reformulation
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0023openalex-snapshot
Branching proofs of infeasibility in low density subset sum problems
inferred← citeshttps://doi.org/10.48550/arxiv.1201.2739openalex-snapshot
Division algorithms for the fixed weight subset sum problem
inferred← citeshttps://doi.org/10.48550/arxiv.1402.7032openalex-snapshot
Parameter security characterization of knapsack public-key crypto under quantum computing
inferred← citeshttps://doi.org/10.48550/arxiv.2001.01078openalex-snapshot
On the Hardness of Almost All Subset Sum Problems by Ordinary Branch-and-Bound
inferred← citeshttps://doi.org/10.48550/arxiv.2108.13086openalex-snapshot
A New Lever Function with Adequate Indeterminacy
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0507008openalex-snapshot
Complexity Science for Simpletons
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0702046openalex-snapshot
Design and Analysis of the REESSE1+ Public Key Cryptosystem v2.21
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5250openalex-snapshot
Cryptographic Hash Functions in Groups and Provable Properties
inferred← citeshttps://doi.org/10.5120/20043-7214openalex-snapshot
The Subset-Sum Problem: Revisited with an Improved Approximated Solution
inferred← citeshttps://doi.org/10.5753/sbseg.2017.19487openalex-snapshot
A Zero-Knowledge Proof for the Hidden Subset Sum Problem
inferred← citeshttps://doi.org/10.5815/ijmsc.2017.02.05openalex-snapshot
A Fast Heuristic Algorithm for Solving High-Density Subset-Sum Problems
showing the first 200 of 205 · page through all 205
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.