Live briefing
Everything about Short integer solution problem
Computational problem used in cryptography
Short integer solution (SIS) and ring-SIS problems are two average-case problems that are used in lattice-based cryptography constructions. Lattice-based cryptography began in 1996 from a seminal work by Miklós Ajtai who presented a family of one-way functions based on SIS problem. He showed that it is secure in an average case if the shortest vector problem (where for some constant ) is hard in the worst case. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Short integer solution problemA 5-minute orientation
- Pick up a classic book: Introduction to Computing Using PythonThe most-reprinted book on the subject
- Read the landmark paper: Stochastic chance constrained mixed-integer nonlinear programming models and the solution approaches for refinery short-term crude oil scheduling problemCited 26 times
- Go sideways: Ideal latticeA closely related topic
- Go sideways: Polynomial ringA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Stochastic chance constrained mixed-integer nonlinear programming models and the solution approaches for refinery short-term crude oil scheduling problem
Improved Combinatorial Algorithms for the Inhomogeneous Short Integer Solution Problem
A novel fuzzy identity based signature scheme based on the short integer solution problem
A compromised multi-objective solution using fuzzy mixed integer goal programming for market-based short-term unit commitment problem
Key Evolving Attribute‐Based Signature Under Short Integer Solution Problem
📚 Books worth reading
Introduction to Computing Using PythonLjubomir Perkovic · 2011
Ada in actionDo-While Jones · 1989- 📕Netflow at PisaGiorgio Gallo · 1986
System modelling and optimizationIFIP TC7 Conference on System Modelling and Optimization (17th 1995 Prague, Czech Republic) · 1996
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Ideal lattice In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many…
- Polynomial ring In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more…
- Ring learning with errors In post-quantum cryptography, ring learning with errors (RLWE) is a computational problem which serves as the foundation of new cryptographic algorithms…
- SWIFFT In cryptography, SWIFFT is a collection of provably secure hash functions. It is based on the concept of the fast Fourier transform (FFT). SWIFFT is not…
- Associative algebra In mathematics, an associative algebra A over a commutative ring (often a field) K is a ring A together with a ring homomorphism from K into the center…
- Kernel (algebra) In algebra, the kernel of a homomorphism is the relation describing how elements in the domain of the homomorphism become related in the image. A homomorphism…
- Cyclic code In coding theory, a cyclic code is a block code, where the circular shifts of each codeword gives another word that belongs to the code. They are error-correcti…
- Learning with errors In cryptography, learning with errors (LWE) is a mathematical problem that is widely used to create secure encryption algorithms. It is based on the idea…