{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T08:57:12Z","timestamp":1762333032255,"version":"build-2065373602"},"reference-count":16,"publisher":"Institution of Engineering and Technology (IET)","issue":"1","license":[{"start":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T00:00:00Z","timestamp":1709337600000},"content-version":"vor","delay-in-days":61,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602514","62202493","61802437","61902428"],"award-info":[{"award-number":["61602514","62202493","61802437","61902428"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Information Security"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p>\n                    GEA\u20101, a proprietary stream cipher, was initially designed and used to protect against eavesdropping general packet radio service (GPRS) between the phone and the base station. Now, a variety of current mobile phones still support this standard cipher. In this paper, a structural weakness of the GEA\u20101 stream cipher that has not been found in previous works is discovered and analyzed. That is the probability that two different inputs of GEA\u20101 generate the identical keystream can be up to 2\n                    <jats:sup>\u22127.30<\/jats:sup>\n                    , which is quite high compared with an ideal stream cipher that generates random sequences. Based on this newfound weakness, a new practical distinguishing attack on GEA\u20101 is proposed, which shows that the keystreams generated by GEA\u20101 are far from random and can be easily distinguished with a practical time cost. After then, a new practical key recovery attack on GEA\u20101 is presented. It has a time complexity of 2\n                    <jats:sup>21.02<\/jats:sup>\n                    GEA\u20101 encryptions and requires only seven related keys, which is much less than the existing related key attack on GEA\u20101. The experimental results show that GEA\u20101 can be broken within about 41.75\u2009s on a common PC in the related key setting. These cryptanalytic results show that GEA\u20101 cannot provide enough security and should be immediately prohibited to be supported in the massive GPRS devices.\n                  <\/jats:p>","DOI":"10.1049\/2024\/6674019","type":"journal-article","created":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T13:05:09Z","timestamp":1709384709000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["New Practical Attacks on GEA\u20101 Based on a New\u2010Found Weakness"],"prefix":"10.1049","volume":"2024","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2676-7512","authenticated-orcid":false,"given":"Zheng","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1482-1750","authenticated-orcid":false,"given":"Lin","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4302-7035","authenticated-orcid":false,"given":"Zhengting","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9129-0446","authenticated-orcid":false,"given":"Xinhai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1600-3835","authenticated-orcid":false,"given":"Ziyu","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"265","published-online":{"date-parts":[[2024,3,2]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77886-6_6"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2022.3197064"},{"key":"e_1_2_10_3_2","unstructured":"ETSI: security algorithms group of experts (sage) Report on the specification evaluation and usage of the gsm gprs encryption algorithm (gea) 1998 Technical Reporthttps:\/\/www.etsi.org\/deliver\/etsi_tr\/101300_101399\/101375\/01.01.01."},{"key":"e_1_2_10_4_2","unstructured":"BrooksonC. GPRS security 2001 https:\/\/web.archive.org\/web\/20120914110208\/."},{"key":"e_1_2_10_5_2","unstructured":"BeierleC. BeyneT. FelkeP. andLeanderG. Constructing and deconstructing intentional weaknesses in symmetric ciphers 2021 Cryptology ePrint Archivehttps:\/\/eprint.iacr.org\/2021\/829."},{"key":"e_1_2_10_6_2","doi-asserted-by":"crossref","unstructured":"BeierleC. BeyneT. FelkeP. andLeanderG. Constructing and deconstructing intentional weaknesses in symmetric ciphers Advances in Cryptology\u2013CRYPTO 2022: 42nd Annual International Cryptology Conference CRYPTO 2022 August 2022 Santa Barbara CA USA Association for Computing Machinery 748\u2013778 https:\/\/doi.org\/10.1007\/978-3-031-15982-4_25.","DOI":"10.1007\/978-3-031-15982-4_25"},{"key":"e_1_2_10_7_2","doi-asserted-by":"crossref","unstructured":"AmzalegD.andDinurI. Refined cryptanalysis of the GPRS ciphers GEA-1 and GEA-2 Advances in Cryptology\u2013EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques May 2022 Trondheim Norway Association for Computing Machinery 57\u201385 https:\/\/doi.org\/10.1007\/978-3-031-07082-2_3.","DOI":"10.1007\/978-3-031-07082-2_3"},{"key":"e_1_2_10_8_2","series-title":"Lecture Notes in Computer Science","first-page":"321","volume-title":"Information Security and Privacy. ACISP 2008","author":"Yuseop L.","year":"2008"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2256419"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39059-3_2"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2307202"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2011.0033"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45537-X_1"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00203965"},{"key":"e_1_2_10_15_2","series-title":"Lecture Notes in Computer Science","first-page":"196","volume-title":"Advances in Cryptology\u2014AUSCRYPT \u201992. AUSCRYPT 1992","author":"Knudsen L. R.","year":"1992"},{"key":"e_1_2_10_16_2","first-page":"315","volume-title":"Proc. ISIT 2002","author":"Ciet M.","year":"2002"}],"container-title":["IET Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/ietis\/2024\/6674019.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/ietis\/2024\/6674019.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/2024\/6674019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T08:51:12Z","timestamp":1762332672000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/2024\/6674019"}},"subtitle":[],"editor":[{"given":"Qichun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["10.1049\/2024\/6674019"],"URL":"https:\/\/doi.org\/10.1049\/2024\/6674019","archive":["Portico"],"relation":{},"ISSN":["1751-8709","1751-8717"],"issn-type":[{"type":"print","value":"1751-8709"},{"type":"electronic","value":"1751-8717"}],"subject":[],"published":{"date-parts":[[2024,1]]},"assertion":[{"value":"2023-07-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-01-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6674019"}}