Cube Attacks on Tweakable Black Box Polynomials
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
If |I|=deg-1, then the degree of the superpoly PS(I) is guaranteed to be linear.
“Interestingly enough, if |I|=deg-1, then the degree of the superpoly PS(I) is guaranteed to be linear.”
From Cube attacks on round-reduced TinyJAMBU (2022) · cites this paper as [8]
If the cube is big enough, i.e., lc=deg-1, then the degree of P is reduced to one and the superpoly PS(I) becomes linear.
“If the cube is big enough, i.e., ℓc=deg-1, then the degree of P is reduced to one. This means that the superpoly PS(I) becomes linear.”
From Cube attacks on round-reduced TinyJAMBU (2022) · cites this paper as [8]
Cites
Self-testing/correcting with applications to numerical problems
Blum, M., Luby, M., & Rubinfeld, R. (1993) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(93)90044-w · Cited by 712 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
KATAN and KTANTAN — A Family of Small and Efficient Hardware-Oriented Block Ciphers
De Cannière, C., Dunkelman, O., & Knežević, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04138-9_20 · Cited by 678 · see citing works
KLEIN: A New Family of Lightweight Block Ciphers
Gong, Z., Nikova, S., & Law, Y. W. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25286-0_1 · Cited by 405 · see citing works
Cube attacks on round-reduced TinyJAMBU
Teng, W. L., Salam, I., Yau, W.-C., Pieprzyk, J., & Phan, R. C.-W. (2022) · Scientific Reports · doi:10.1038/s41598-022-09004-3 · Cited by 15 · see citing works
“In 2009 Dinur and Shamir applied the cube attack against the Trivium stream cipher [8].”
BackgroundMethodInfluential
- Authors
- Dinur, I., & Shamir, A.
- Affiliations
- Weizmann Institute of Science (IL)
- ORCID
- Dinur, Itai
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 278-299
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2160494425
- Cited by
- 451
- References
- 1
- Citations by year
- 2026: 6 · 2025: 16 · 2024: 21 · 2023: 28 · 2022: 23 · 2021: 25 · 2020: 35 · 2019: 22 · 2018: 28 · 2017: 29 · 2016: 30 · 2015: 36 · 2014: 27 · 2013: 24 · 2012: 31
- FWCI
- 23.46
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Polynomial and algebraic computation
- Keywords
- cube attack, Trivium stream cipher, key recovery, block cipher, message authentication codes, stream ciphers
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
