Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jing Yang 0025

dblp:62/5839-25 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2022
0000-0003-0443-8272ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 2 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
3 papers
Cryptographic primitives and cryptanalysis · 96% Cryptographic protocols and secure computation · 4%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › stream cipher cryptanalysis
guess-and-determine attack
0.612022
Revisiting the Concrete Security of Goldreich's Pseudorandom Generator · IEEE Trans. Inf. Theory 2022
Cryptographic primitives and cryptanalysis › pseudorandom generators
NC0 pseudorandom generators
0.612022
Revisiting the Concrete Security of Goldreich's Pseudorandom Generator · IEEE Trans. Inf. Theory 2022
Cryptographic primitives and cryptanalysis
pseudorandom generators
0.612022
Revisiting the Concrete Security of Goldreich's Pseudorandom Generator · IEEE Trans. Inf. Theory 2022
Cryptographic primitives and cryptanalysis › symmetric cryptography
lightweight cryptography
0.412020
An overview of cryptographic primitives for possible use in 5G and beyond · Sci. China Inf. Sci. 2020
Cryptographic primitives and cryptanalysis
post-quantum cryptography
0.412020
An overview of cryptographic primitives for possible use in 5G and beyond · Sci. China Inf. Sci. 2020
Cryptographic primitives and cryptanalysis › provable security › security notions
chosen ciphertext attack
0.412019
A Novel CCA Attack Using Decryption Errors Against LAC · ASIACRYPT (1) 2019
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key cryptanalysis
decryption failure attack
0.412019
A Novel CCA Attack Using Decryption Errors Against LAC · ASIACRYPT (1) 2019
Coding theory › error-correcting codes › decoding
iterative decoding
0.212022
Revisiting the Concrete Security of Goldreich's Pseudorandom Generator · IEEE Trans. Inf. Theory 2022

Methods — techniques the papers use, named apart from their topics

iterative decoding · 1.1guess-and-decode · 1.1survey · 0.4
YearPublicationVenuePosition
2022 Revisiting the Concrete Security of Goldreich's Pseudorandom Generator
abstract
Local pseudorandom generators are a class of fundamental cryptographic primitives having very broad applications in theoretical cryptography. Following Couteauet al.’swork at ASIACRYPT 2018, this paper further studies the concrete security of one important class of local pseudorandom generators, i.e., Goldreich’s pseudorandom generators. Our first attack is of the guess-and-determine type. Our result significantly improves the state-of-the-art algorithm proposed by Couteauet al., in terms of both asymptotic and concrete complexity, and breaks all the challenge parameters they proposed. For instance, for a parameter set suggested for 128 bits of security, we could solve the instance faster by a factor of about 277, thereby destroying the claimed security completely. Our second attack further exploits the extremely sparse structure of the predicate$P_{5}$and combines ideas from iterative decoding. This novel attack, named guess-and-decode, substantially improves the guess-and-determine approaches for cryptographic-relevant parameters. All the challenge parameter sets proposed in Couteauet al.’swork in ASIACRYPT 2018 aiming for 80-bit (128-bit) security levels can be solved in about 258(278) operations. We suggest new parameters for achieving 80-bit (128-bit) security with respect to our attacks. We also extend the attacks to other promising predicates and investigate their resistance.
Jing Yang 0025, Qian Guo 0001, Thomas Johansson 0001, Michael Lentmaier
IEEE Trans. Inf. Theory1
2021 SNOW-Vi: an extreme performance variant of SNOW-V for lower grade CPUs
abstract
SNOW 3G is a stream cipher used as one of the standard algorithms for data confidentiality and integrity protection over the air interface in the 3G and 4G mobile communication systems. SNOW-V is a recent new version that was proposed as a candidate for inclusion in the 5G standard. In this paper, we propose a faster variant of SNOW-V, called SNOW-Vi, that can reach the targeted speeds for 5G in a software implementation on a larger variety of CPU architectures. SNOW-Vi differs in the way how the LFSR is updated and also introduces a new location of the tap T2 for stronger security, while everything else is kept the same as in SNOW-V. The throughput in a software environment is increased by around 50% in average, up to 92 Gbps. This makes the applicability of the cipher much wider and more use cases are covered. The security analyses previously done for SNOW-V are not affected in most aspects, and SNOW-Vi provides the same 256-bit security level as SNOW-V.
Patrik Ekdahl, Alexander Maximov, Thomas Johansson 0001, Jing Yang 0025
WISEC4
2020 An overview of cryptographic primitives for possible use in 5G and beyond
abstract
Abstract This survey overviews the potential use of cryptographic primitives in the fifth-generation mobile communications system (aka 5G) and beyond. It discusses the new security challenges that come with 5G and presents the upcoming security architecture. It shows the use of current cryptographic algorithms and discusses new algorithms or modifications of existing ones, that can be relevant. It also discusses the need for lightweight algorithms to meet the new use cases as well as the general demand for algorithms secure even when large quantum computers are available.
Jing Yang 0025, Thomas Johansson 0001
Sci. China Inf. Sci.1
2019 A Novel CCA Attack Using Decryption Errors Against LAC
Qian Guo 0001, Thomas Johansson 0001, Jing Yang 0025
ASIACRYPT (1)3