Thomas Johansson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Thomas Johansson has a total of 60 co-authors. Here are the top co-authors by number of shared publications:
- Qian Guo
Lund University
16 shared publications - Paul Stankovski
Lund University
7 shared publications - Martin Hell
Lund University
6 shared publications - Carl Löndahl
Lund University
3 shared publications - Erik Mårtensson
Lund University
3 shared publications - Alexander Maximov
Ericsson Research
2 shared publications
Latest Publications
- Open Access
- 23 July 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (5) , 1735-1762
A BKW-style solver for the restricted syndrome decoding problem
The Restricted Syndrome Decoding Problem (RSDP) is a variant of the well-known syndrome decoding problem. It has recently been turned into a post-quantum signature scheme named CROSS by Baldi et al.. It is a scheme highlighted for being computationally friendly and providing a compact signature and public key size. This paper investigates an Oracle-based definition of the RSDP that has already proved useful in constructing other cryptographic primitives. We propose a new solving algorithm for this novel and interesting problem. Our approach is to first introduce a new weight definition for vectors over $$\mathbb {F}_{p}$$ and then develop a solving algorithm similar to the BKW algorithm that includes finding many such low-weight vectors in a dual space. We make use of several advanced techniques, such as Covering codes and Subspace Hypothesis Testing . We show that when there are many samples, our algorithm can be more advantageous than prior work based on information-set decoding adaptations for RSDP or algebraic approaches.- 23 July 2026
- Published by Springer Nature in Cryptography and Communications
- Vol. 18 (5) , 1735-1762
Open AccessA BKW-style solver for the restricted syndrome decoding problem
The Restricted Syndrome Decoding Problem (RSDP) is a variant of the well-known syndrome decoding problem. It has recently been turned into a post-quantum signature scheme named CROSS by Baldi et al.. It is a scheme highlighted for being computationally friendly and providing a compact signature and public key size. This paper investigates an Oracle-based definition of the RSDP that has already proved useful in constructing other cryptographic primitives. We propose a new solving algorithm for this novel and interesting problem. Our approach is to first introduce a new weight definition for vectors over $$\mathbb {F}_{p}$$ and then develop a solving algorithm similar to the BKW algorithm that includes finding many such low-weight vectors in a dual space. We make use of several advanced techniques, such as Covering codes and Subspace Hypothesis Testing . We show that when there are many samples, our algorithm can be more advantageous than prior work based on information-set decoding adaptations for RSDP or algebraic approaches. - Open Access
- 11 June 2026
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2026 (2)
Introducing the ALF Family: AES-NI-Based Length- and Format-Preserving Encryption
This paper introduces the ALF cipher family, designed for format-preserving encryption. The key strategy is to leverage AES-NI instructions to achieve a high software performance while also providing 128-bit security. A central part of the paper is the design of an AES-related bit-oriented block cipher called ALF-n-t, with a block size ranging from 16 to 127 bits. The core of the design is byte-oriented, but allows appending up to 7 bits to a byte-oriented input. We introduce an approach for efficient implementation using AES-NI, even though the block size is not 128 bits. The block cipher family is turned into a format-preserving encryption by a new cycle-sliding transformation, improving slightly on traditional cycle-walking. Performance evaluation shows speed improvements compared to the standardised algorithm FF1 and the previous FF3. As the input size may vary a lot between different cases, we also include the description of other members of the ALF family that cover different domain sizes. While these designs differ, they share a common theme: the use of AES-NI instructions.
- 11 June 2026
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2026 (2)
Open AccessIntroducing the ALF Family: AES-NI-Based Length- and Format-Preserving Encryption
This paper introduces the ALF cipher family, designed for format-preserving encryption. The key strategy is to leverage AES-NI instructions to achieve a high software performance while also providing 128-bit security. A central part of the paper is the design of an AES-related bit-oriented block cipher called ALF-n-t, with a block size ranging from 16 to 127 bits. The core of the design is byte-oriented, but allows appending up to 7 bits to a byte-oriented input. We introduce an approach for efficient implementation using AES-NI, even though the block size is not 128 bits. The block cipher family is turned into a format-preserving encryption by a new cycle-sliding transformation, improving slightly on traditional cycle-walking. Performance evaluation shows speed improvements compared to the standardised algorithm FF1 and the previous FF3. As the input size may vary a lot between different cases, we also include the description of other members of the ALF family that cover different domain sizes. While these designs differ, they share a common theme: the use of AES-NI instructions.
- Open Access
- 4 May 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (1)
Pushing to the limits: SNOW-Axn – a fast AEAD stream cipher in aggregated mode
For future 6G, there is an anticipation that a speed of around 100 Gbps could become a requirement, a speed that most current ciphers cannot reach. Due to this, we propose a new SNOW family AEAD stream cipher called SNOW-Axn that has the capability to adopt a variable length of the key (up to 256 bits), IV/nonce (up to 224 bits) and MAC (up to 128 bits) for the three modes of operation (encryption only, integrity only, AEAD), application and/or standardisation domain separations, and other parameters. SNOW-Axn has new updated LFSR and FSM components, the feature of aggregated processing, as well as a new integrity mechanism. These changes bring a significant performance boost. We provide exampled instances called SNOW-Ax1 and SNOW-Ax4, where the latter reaches the encryption speed of 421 Gbps in pure software on a laptop-grade CPU.
- 4 May 2026
- Published by International Association for Cryptologic Research in IACR Communications in Cryptology
- Vol. 3 (1)
Open AccessPushing to the limits: SNOW-Axn – a fast AEAD stream cipher in aggregated mode
For future 6G, there is an anticipation that a speed of around 100 Gbps could become a requirement, a speed that most current ciphers cannot reach. Due to this, we propose a new SNOW family AEAD stream cipher called SNOW-Axn that has the capability to adopt a variable length of the key (up to 256 bits), IV/nonce (up to 224 bits) and MAC (up to 128 bits) for the three modes of operation (encryption only, integrity only, AEAD), application and/or standardisation domain separations, and other parameters. SNOW-Axn has new updated LFSR and FSM components, the feature of aggregated processing, as well as a new integrity mechanism. These changes bring a significant performance boost. We provide exampled instances called SNOW-Ax1 and SNOW-Ax4, where the latter reaches the encryption speed of 421 Gbps in pure software on a laptop-grade CPU.
- Open Access
- 22 August 2025
- Published by Springer Nature in Research Square
A BKW-Style Solver for the Restricted Syndrome Decoding Problem
The Restricted Syndrome Decoding Problem (RSDP) is a variant of the well-known syndrome decoding problem. It has recently been turned into a post-quantum signature scheme named CROSS by Baldi et al.. It is a scheme highlighted for being computationally friendly and providing a compact signature and public key size. This paper investigates an Oracle-based definition of the RSDP that has already proved useful in constructing other cryptographic primitives. We propose a new solving algorithm for this novel and interesting problem. Our approach is to first introduce a new weight definition for vectors over $\ffield{p}$ and then develop a solving algorithm similar to the BKW algorithm that includes finding many such low-weight vectors in a dual space. We make use of several advanced techniques, such as Covering codes and Subspace Hypothesis Testing. We show that when there are many samples, our algorithm can be more advantageous than prior work based on information-set decoding adaptations for RSDP or algebraic approaches.- 22 August 2025
- Published by Springer Nature in Research Square
Open AccessA BKW-Style Solver for the Restricted Syndrome Decoding Problem
The Restricted Syndrome Decoding Problem (RSDP) is a variant of the well-known syndrome decoding problem. It has recently been turned into a post-quantum signature scheme named CROSS by Baldi et al.. It is a scheme highlighted for being computationally friendly and providing a compact signature and public key size. This paper investigates an Oracle-based definition of the RSDP that has already proved useful in constructing other cryptographic primitives. We propose a new solving algorithm for this novel and interesting problem. Our approach is to first introduce a new weight definition for vectors over $\ffield{p}$ and then develop a solving algorithm similar to the BKW algorithm that includes finding many such low-weight vectors in a dual space. We make use of several advanced techniques, such as Covering codes and Subspace Hypothesis Testing. We show that when there are many samples, our algorithm can be more advantageous than prior work based on information-set decoding adaptations for RSDP or algebraic approaches. - Open Access
- 7 March 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2025 (1) , 5-43
A New Stand-Alone MAC Construct Called SMAC
In this paper, we present a new efficient stand-alone MAC construct named SMAC, based on processing using the Finite State Machine (FSM) part of the stream cipher family SNOW, which in turn uses the AES round function. It offers a combination of very high speed in software and hardware with a truncatable tag. Three concrete base versions of SMAC are proposed, each offering a different security level. SMAC can also be directly integrated with an external ciphering engine in an AEAD mode. Every design decision is thoroughly justified and supported by the results of our cryptanalysis and simulations. Additionally, we introduce an aggregated mode version, SMAC-1xn, in which software performance reaches up to 925 Gbps (around 0.038 cycles per byte) for long messages in a single thread. To the best of our knowledge, SMAC achieves a record-breaking software performance compared to all known MAC engines.
- 7 March 2025
- Published by Universitatsbibliothek der Ruhr-Universitat Bochum in IACR Transactions on Symmetric Cryptology
- Vol. 2025 (1) , 5-43
Open AccessA New Stand-Alone MAC Construct Called SMAC
In this paper, we present a new efficient stand-alone MAC construct named SMAC, based on processing using the Finite State Machine (FSM) part of the stream cipher family SNOW, which in turn uses the AES round function. It offers a combination of very high speed in software and hardware with a truncatable tag. Three concrete base versions of SMAC are proposed, each offering a different security level. SMAC can also be directly integrated with an external ciphering engine in an AEAD mode. Every design decision is thoroughly justified and supported by the results of our cryptanalysis and simulations. Additionally, we introduce an aggregated mode version, SMAC-1xn, in which software performance reaches up to 925 Gbps (around 0.038 cycles per byte) for long messages in a single thread. To the best of our knowledge, SMAC achieves a record-breaking software performance compared to all known MAC engines.
- 25 December 2024
- Published by Springer Nature
- p. 171-190
Formal Analysis of Julia Key Agreement Protocol
- 25 December 2024
- Published by Springer Nature
- p. 171-190
Formal Analysis of Julia Key Agreement Protocol
- 10 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (11) , 8303-8319
A New Sieving-Style Information-Set Decoding Algorithm
The problem of decoding random codes is a fundamental problem for code-based cryptography, including recent code-based candidates in the NIST post-quantum standardization process. In this paper, we present a novel Sieving-style Information-set Decoding algorithm, addressing the task of solving the syndrome decoding problem. Our approach involves maintaining a list of weight- $2p$ solution vectors to a partial syndrome decoding problem and then creating new vectors by identifying pairs of vectors that collide in p positions. By gradually increasing the parity-check condition by one and repeating this process iteratively, we find the final solution(s). We show that our novel algorithm performs better than other ISDs in the memory-restricted scenario when applied to McEliece. Notably, in the case of problem instances with very low relative weight, the sieving approach uses significantly less memory compared to other ISD algorithms while being competitive in terms of performance.
- 10 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (11) , 8303-8319
A New Sieving-Style Information-Set Decoding Algorithm
The problem of decoding random codes is a fundamental problem for code-based cryptography, including recent code-based candidates in the NIST post-quantum standardization process. In this paper, we present a novel Sieving-style Information-set Decoding algorithm, addressing the task of solving the syndrome decoding problem. Our approach involves maintaining a list of weight- $2p$ solution vectors to a partial syndrome decoding problem and then creating new vectors by identifying pairs of vectors that collide in p positions. By gradually increasing the parity-check condition by one and repeating this process iteratively, we find the final solution(s). We show that our novel algorithm performs better than other ISDs in the memory-restricted scenario when applied to McEliece. Notably, in the case of problem instances with very low relative weight, the sieving approach uses significantly less memory compared to other ISD algorithms while being competitive in terms of performance.
- 18 December 2023
- Published by Springer Nature
- p. 203-236
SCA-LDPC: A Code-Based Framework for Key-Recovery Side-Channel Attacks on Post-quantum Encryption Schemes
- 18 December 2023
- Published by Springer Nature
- p. 203-236
SCA-LDPC: A Code-Based Framework for Key-Recovery Side-Channel Attacks on Post-quantum Encryption Schemes
- 1 December 2023
- Published by Wiley
- p. 143-154
Correlation Attacks on Stream Ciphers
- Open Access
- 25 April 2023
- Published by Springer Nature in Journal of Cryptographic Engineering
- Vol. 13 (4) , 443-460
A side-channel attack on a masked and shuffled software implementation of Saber
In this paper, we show that a software implementation of IND-CCA-secure Saber key encapsulation mechanism protected by first-order masking and shuffling can be broken by deep learning-based power analysis. Using an ensemble of deep neural networks trained at the profiling stage, we can recover the session key and the secret key from $$257 \times N$$ and $$24 \times 257 \times N$$ traces, respectively, where N is the number of repetitions of the same measurement. The value of N depends on the implementation of the algorithm, the type of device under attack, environmental factors, acquisition noise, etc.; in our experiments $$N = 10$$ is sufficient for a successful attack. The neural networks are trained on a combination of 80% of traces from the profiling device with a known shuffling order and 20% of traces from the device under attack captured for all-0 and all-1 messages. “Spicing” the training set with traces from the device under attack helps us minimize the negative effect of inter-device variability.- 25 April 2023
- Published by Springer Nature in Journal of Cryptographic Engineering
- Vol. 13 (4) , 443-460
Open AccessA side-channel attack on a masked and shuffled software implementation of Saber
In this paper, we show that a software implementation of IND-CCA-secure Saber key encapsulation mechanism protected by first-order masking and shuffling can be broken by deep learning-based power analysis. Using an ensemble of deep neural networks trained at the profiling stage, we can recover the session key and the secret key from $$257 \times N$$ and $$24 \times 257 \times N$$ traces, respectively, where N is the number of repetitions of the same measurement. The value of N depends on the implementation of the algorithm, the type of device under attack, environmental factors, acquisition noise, etc.; in our experiments $$N = 10$$ is sufficient for a successful attack. The neural networks are trained on a combination of 80% of traces from the profiling device with a known shuffling order and 20% of traces from the device under attack captured for all-0 and all-1 messages. “Spicing” the training set with traces from the device under attack helps us minimize the negative effect of inter-device variability.