The DOI matches its Crossref record.
Fast Software Encryption: 8th International Workshop, FSE 2001 Yokohama, Japan, April 2–4, 2001 Revised Papers
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
How to Break MD5 and Other Hash Functions
Wang, X., & Yu, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_2 · Cited by 1,440
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
Local Shannon entropy measure with statistical tests for image randomness
Wu, Y., Zhou, Y., Saveriades, G., Agaian, S., Noonan, J. P., & Natarajan, P. (2013) · Information Sciences · doi:10.1016/j.ins.2012.07.049 · Cited by 722
HIGHT: A New Block Cipher Suitable for Low-Resource Device
Hong, D., Sung, J., Hong, S., Lim, J., Lee, S., Koo, B.-S., Lee, C., Chang, D., Lee, J., Jeong, K., et al. (2006) · Lecture Notes in Computer Science · doi:10.1007/11894063_4 · Cited by 708
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
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_35 · Cited by 558
The Security and Performance of the Galois/Counter Mode (GCM) of Operation
McGrew, D. A., & Viega, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30556-9_27 · Cited by 522
The 128-Bit Blockcipher CLEFIA (Extended Abstract)
Shirai, T., Shibutani, K., Akishita, T., Moriai, S., & Iwata, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74619-5_12 · Cited by 487
Pushing the Limits: A Very Compact and a Threshold Implementation of AES
Moradi, A., Poschmann, A., Ling, S., Paar, C., & Wang, H. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_6 · Cited by 463
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Stehlé, D., & Steinfeld, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_4 · Cited by 444
Masking against Side-Channel Attacks: A Formal Security Proof
Prouff, E., & Rivain, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_9 · Cited by 383
Cache-Collision Timing Attacks Against AES
Bonneau, J., & Mironov, I. (2006) · Lecture Notes in Computer Science · doi:10.1007/11894063_16 · Cited by 367
The Poly1305-AES Message-Authentication Code
Bernstein, D. J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11502760_3 · Cited by 362
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
Stam, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_22 · Cited by 361
spongent: A Lightweight Hash Function
Bogdanov, A., Knežević, M., Leander, G., Toz, D., Varıcı, K., & Verbauwhede, I. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23951-9_21 · Cited by 354
Distinguisher and Related-Key Attack on the Full AES-256
Biryukov, A., Khovratovich, D., & Nikolić, I. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_14 · Cited by 329
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
Güneysu, T., Lyubashevsky, V., & Pöppelmann, T. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33027-8_31 · Cited by 301
Circular-Secure Encryption from Decision Diffie-Hellman
Boneh, D., Halevi, S., Hamburg, M., & Ostrovsky, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_7 · Cited by 293
SWIFFT: A Modest Proposal for FFT Hashing
Lyubashevsky, V., Micciancio, D., Peikert, C., & Rosen, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71039-4_4 · Cited by 265
The Software Performance of Authenticated-Encryption Modes
Krovetz, T., & Rogaway, P. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21702-9_18 · Cited by 262
A Leakage-Resilient Mode of Operation
Pietrzak, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_27 · Cited by 261
PRINTcipher: A Block Cipher for IC-Printing
Knudsen, L., Leander, G., Poschmann, A., & Robshaw, M. J. B. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15031-9_2 · Cited by 261
A Meet-in-the-Middle Attack on 8-Round AES
Demirci, H., & Selçuk, A. A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71039-4_7 · Cited by 207
Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds
Biryukov, A., Dunkelman, O., Keller, N., Khovratovich, D., & Shamir, A. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_15 · Cited by 185
Preimage Attacks on One-Block MD4, 63-Step MD5 and More
Aoki, K., & Sasaki, Y. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04159-4_7 · Cited by 182
Babbage, S., & Dodd, M. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3_15 · Cited by 143
Guo, J., Ling, S., Rechberger, C., & Wang, H. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_4 · Cited by 127
Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
Aoki, K., & Sasaki, Y. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_5 · Cited by 115
Biryukov, A., & Nikolić, I. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_17 · Cited by 110
A Differential Fault Attack on the Grain Family of Stream Ciphers
Banik, S., Maitra, S., & Sarkar, S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33027-8_8 · Cited by 82
Related-Key Chosen IV Attacks on Grain-v1 and Grain-128
Lee, Y., Jeong, K., Sung, J., & Hong, S. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-70500-0_24 · Cited by 68
Conditional Differential Cryptanalysis of Trivium and KATAN
Knellwolf, S., Meier, W., & Naya-Plasencia, M. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-28496-0_12 · Cited by 66
A Comparison of Post-Processing Techniques for Biased Random Number Generators
Kwok, S.-H., Ee, Y.-L., Chew, G., Zheng, K., Khoo, K., & Tan, C.-H. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-21040-2_12 · Cited by 57
Improved Meet-in-the-Middle Attacks on AES
Demirci, H., Taşkın, İ., Çoban, M., & Baysal, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10628-6_10 · Cited by 47
Stack Overflow Considered Harmful? The Impact of Copy&Paste on Android Application Security
Fischer, F., Bottinger, K., Xiao, H., Stransky, C., Acar, Y., Backes, M., & Fahl, S. (2017) · 2017 IEEE Symposium on Security and Privacy (SP) · doi:10.1109/sp.2017.31 · Cited by 280
On the Security of the CCM Encryption Mode and of a Slight Variant
Fouque, P.-A., Martinet, G., Valette, F., & Zimmer, S. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68914-0_25 · Cited by 20
Metadata
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2495889793
- Cited by
- 1,422
- References
- 0
- FWCI
- 44.31
- Type
- conference paper
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.