SwePub
Sök i LIBRIS databas

  Utökad sökning

id:"swepub:oai:lup.lub.lu.se:a2330486-01df-44fb-a22a-8908cdc58d0a"
 

Sökning: id:"swepub:oai:lup.lub.lu.se:a2330486-01df-44fb-a22a-8908cdc58d0a" > A novel CCA attack ...

A novel CCA attack using decryption errors against LAC

Guo, Qian (författare)
Lund University,Lunds universitet,Nätverk och säkerhet,Forskargrupper vid Lunds universitet,Networks and Security,Lund University Research Groups,University of Bergen
Johansson, Thomas (författare)
Lund University,Lunds universitet,Nätverk och säkerhet,Forskargrupper vid Lunds universitet,Networks and Security,Lund University Research Groups
Yang, Jing (författare)
Lund University,Lunds universitet,Nätverk och säkerhet,Forskargrupper vid Lunds universitet,Networks and Security,Lund University Research Groups
visa fler...
Galbraith, Steven D. (redaktör/utgivare)
Moriai, Shiho (redaktör/utgivare)
visa färre...
 (creator_code:org_t)
2019-11-25
2019
Engelska 30 s.
Ingår i: Advances in Cryptology – ASIACRYPT 2019 : 25th International Conference on the Theory and Application of Cryptology and Information Security, 2019, Proceedings, Part I - 25th International Conference on the Theory and Application of Cryptology and Information Security, 2019, Proceedings, Part I. - Cham : Springer International Publishing. - 1611-3349 .- 0302-9743. - 9783030345778 - 9783030345785 ; 11921 LNCS, s. 82-111
  • Konferensbidrag (refereegranskat)
Abstract Ämnesord
Stäng  
  • Cryptosystems based on Learning with Errors or related problems are central topics in recent cryptographic research. One main witness to this is the NIST Post-Quantum Cryptography Standardization effort. Many submitted proposals rely on problems related to Learning with Errors. Such schemes often include the possibility of decryption errors with some very small probability. Some of them have a somewhat larger error probability in each coordinate, but use an error correcting code to get rid of errors. In this paper we propose and discuss an attack for secret key recovery based on generating decryption errors, for schemes using error correcting codes. In particular we show an attack on the scheme LAC, a proposal to the NIST Post-Quantum Cryptography Standardization that has advanced to round 2. In a standard setting with CCA security, the attack first consists of a precomputation of special messages and their corresponding error vectors. This set of messages are submitted for decryption and a few decryption errors are observed. In a statistical analysis step, these vectors causing the decryption errors are processed and the result reveals the secret key. The attack only works for a fraction of the secret keys. To be specific, regarding LAC256, the version for achieving the 256-bit classical security level, we recover one key among approximately 264 public keys with complexity 279, if the precomputation cost of 2162 is excluded. We also show the possibility to attack a more probable key (say with probability 2-16). This attack is verified via extensive simulation. We further apply this attack to LAC256-v2, a new version of LAC256 in round 2 of the NIST PQ-project and obtain a multi-target attack with slightly increased precomputation complexity (from 2162 to 2171). One can also explain this attack in the single-key setting as an attack with precomputation complexity of 2171 and success probability of 2-64.

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Signalbehandling (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Signal Processing (hsv//eng)
NATURVETENSKAP  -- Matematik -- Beräkningsmatematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics -- Computational Mathematics (hsv//eng)

Nyckelord

Chosen-ciphertext security
Decryption errors
LAC
Lattice-based cryptography
LWE
NIST post-quantum standardization
Reaction attack

Publikations- och innehållstyp

kon (ämneskategori)
ref (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy