Pub Date : 2021-12-06DOI: 10.1080/01611194.2021.1969703
Chris Christensen
{"title":"Review of Reflections of Alan Turing: A Relative Story by Dermot Turing","authors":"Chris Christensen","doi":"10.1080/01611194.2021.1969703","DOIUrl":"https://doi.org/10.1080/01611194.2021.1969703","url":null,"abstract":"","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"46 1","pages":"287 - 289"},"PeriodicalIF":0.6,"publicationDate":"2021-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44052736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-11-13DOI: 10.1080/01611194.2021.1974124
Paul W. Relkin
Abstract During the second World War, American mathematician Paul Olum created two ciphers, labeled “Olum 1” and “Olum 2”, as challenges for the renowned atomic physicist Richard Feynman. These ciphers eluded solution by Feynman and remained unsolved for over 75 years. This manuscript presents the first successful decoding of the Olum 1 cipher. It describes the methods used to solve Olum 1 as well as the historical context of the once-classified information it contains. It concludes with observations about the possible authorship of additional ciphers given to Richard Feynman and examines the possibility that they, too, were created by Paul Olum.
{"title":"Solving the Olum 1 Cipher","authors":"Paul W. Relkin","doi":"10.1080/01611194.2021.1974124","DOIUrl":"https://doi.org/10.1080/01611194.2021.1974124","url":null,"abstract":"Abstract During the second World War, American mathematician Paul Olum created two ciphers, labeled “Olum 1” and “Olum 2”, as challenges for the renowned atomic physicist Richard Feynman. These ciphers eluded solution by Feynman and remained unsolved for over 75 years. This manuscript presents the first successful decoding of the Olum 1 cipher. It describes the methods used to solve Olum 1 as well as the historical context of the once-classified information it contains. It concludes with observations about the possible authorship of additional ciphers given to Richard Feynman and examines the possibility that they, too, were created by Paul Olum.","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"38 3","pages":"291 - 301"},"PeriodicalIF":0.6,"publicationDate":"2021-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41309298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract An m-sequence is the one of the largest period among those produced by a linear feedback shift register. It possesses several desirable features of pseudorandomness such as balance, uniform pattern distribution and ideal autocorrelation for applications to communications. However, it also possesses undesirable features such as low linear complexity. Here we prove a nontrivial upper bound on its arithmetic autocorrelation, another figure of merit introduced by Mandelbaum for error-correcting codes and later investigated by Goresky and Klapper for FCSRs. The upper bound is close to half of the period and hence rather large, which gives an undesirable feature.
{"title":"Arithmetic autocorrelation of binary m-sequences","authors":"Zhixiong Chen, Zhihua Niu, Yuqi Sang, Chenhuang Wu","doi":"10.1080/01611194.2022.2071116","DOIUrl":"https://doi.org/10.1080/01611194.2022.2071116","url":null,"abstract":"Abstract An m-sequence is the one of the largest period among those produced by a linear feedback shift register. It possesses several desirable features of pseudorandomness such as balance, uniform pattern distribution and ideal autocorrelation for applications to communications. However, it also possesses undesirable features such as low linear complexity. Here we prove a nontrivial upper bound on its arithmetic autocorrelation, another figure of merit introduced by Mandelbaum for error-correcting codes and later investigated by Goresky and Klapper for FCSRs. The upper bound is close to half of the period and hence rather large, which gives an undesirable feature.","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"47 1","pages":"449 - 458"},"PeriodicalIF":0.6,"publicationDate":"2021-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45559852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-06DOI: 10.1080/01611194.2021.1969704
Chris Christensen
{"title":"Review of USN & USMC WW II Cryptologists’ Oral Histories; Voices from the past, Volumes 1 and 2 by U.S. Naval Cryptologic Veterans Association","authors":"Chris Christensen","doi":"10.1080/01611194.2021.1969704","DOIUrl":"https://doi.org/10.1080/01611194.2021.1969704","url":null,"abstract":"","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"46 1","pages":"380 - 381"},"PeriodicalIF":0.6,"publicationDate":"2021-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47510405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-06DOI: 10.1080/01611194.2021.1950077
Chris Christensen
word in the describes the majority of the contents of this book. On the 132 pages, there are 107 images; nearly all the are at least half-page and many are full-page. Most images are of pages of documents The National Kew. The back cover blurb states that the “ book reveals the story of British codebreakers ” and “ ends with a re-assessment of the work undertaken by the British code breaker and mathematician Alan Turing. ” The book is not that dra-matic; the text describes well-known stories of twentieth century codebreaking and the now common view of the work and life of Alan Turing.
{"title":"Review of Images of the National Archives Codebreakers by Stephen Twigge","authors":"Chris Christensen","doi":"10.1080/01611194.2021.1950077","DOIUrl":"https://doi.org/10.1080/01611194.2021.1950077","url":null,"abstract":"word in the describes the majority of the contents of this book. On the 132 pages, there are 107 images; nearly all the are at least half-page and many are full-page. Most images are of pages of documents The National Kew. The back cover blurb states that the “ book reveals the story of British codebreakers ” and “ ends with a re-assessment of the work undertaken by the British code breaker and mathematician Alan Turing. ” The book is not that dra-matic; the text describes well-known stories of twentieth century codebreaking and the now common view of the work and life of Alan Turing.","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"46 1","pages":"284 - 286"},"PeriodicalIF":0.6,"publicationDate":"2021-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47283367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-04DOI: 10.1080/01611194.2021.1969705
Chris Christensen
On page 243 the author states that the purpose of Backing Bletchley is “to give the reader the bigger picture in respect of the integration of outstations with Bletchley Park and how it worked in practice.” The author Ronald Koorm is described as a person who has lectured on codebreaking and the outstations and who has done research on Eastcote, codebreaking, and the development of GCHQ. The outstations were located at Adstock, Wavendon, Gayhurst, Stanmore, and Eastcote. These were the locations outside of Bletchley Park where Bombe work was done. The reader is told (many times) that Bombes occasionally moved between the outstations and that data from the Bombe Registers shows that:
{"title":"Review of Backing Bletchley: The Codebreaking Outstations from Eastcote to GCHQ by Ronald Koorm","authors":"Chris Christensen","doi":"10.1080/01611194.2021.1969705","DOIUrl":"https://doi.org/10.1080/01611194.2021.1969705","url":null,"abstract":"On page 243 the author states that the purpose of Backing Bletchley is “to give the reader the bigger picture in respect of the integration of outstations with Bletchley Park and how it worked in practice.” The author Ronald Koorm is described as a person who has lectured on codebreaking and the outstations and who has done research on Eastcote, codebreaking, and the development of GCHQ. The outstations were located at Adstock, Wavendon, Gayhurst, Stanmore, and Eastcote. These were the locations outside of Bletchley Park where Bombe work was done. The reader is told (many times) that Bombes occasionally moved between the outstations and that data from the Bombe Registers shows that:","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"46 1","pages":"277 - 279"},"PeriodicalIF":0.6,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48511020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-04DOI: 10.1080/01611194.2021.1969702
Chris Christensen
{"title":"Review of Geniuses at War: Bletchley Park, Colossus, and the Dawn of the Digital Age by David A. Price","authors":"Chris Christensen","doi":"10.1080/01611194.2021.1969702","DOIUrl":"https://doi.org/10.1080/01611194.2021.1969702","url":null,"abstract":"","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"46 1","pages":"193 - 194"},"PeriodicalIF":0.6,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44231654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-01DOI: 10.1080/01611194.2021.1949761
Chris Christensen
To people interested in cryptologic history, the word “Bombe” likely brings to mind Bletchley Park’s Turing-Welchman Bombe or, perhaps, the US Navy Cryptologic Bombe or the Polish Bomba, which was the predecessor of both. But there was another Bombe – the US Army Cryptologic Bombe which is sometimes called “Madame X” or “003.” In Madame X, Michael Barbakoff notes that “Knowledge of the Enigma challenge and some details of how Bletchley Park were approaching the problem was first brought to the [US Army’s Signal Intelligence Service (SIS)] in the spring of 1941 by Abraham Sinkov and Leo Rosen, following their trip to the [Government Code and Cypher School (GCCS) at Bletchley Park] in February of that year.” (28) Collin Burke (2002, 135 140) gives a brief description of this “other Bombe Program.” He notes that in 1942, SIS engineer Leo Rosen was given the task of producing a machine that would allow SIS to compete with the US Navy’s OP-20-G developing cryptologic Bombe program.
{"title":"Review of Madame X: The Story of ‘003’, the U.S. Army Cryptologic Bombe in World War II by Michael Barbakoff","authors":"Chris Christensen","doi":"10.1080/01611194.2021.1949761","DOIUrl":"https://doi.org/10.1080/01611194.2021.1949761","url":null,"abstract":"To people interested in cryptologic history, the word “Bombe” likely brings to mind Bletchley Park’s Turing-Welchman Bombe or, perhaps, the US Navy Cryptologic Bombe or the Polish Bomba, which was the predecessor of both. But there was another Bombe – the US Army Cryptologic Bombe which is sometimes called “Madame X” or “003.” In Madame X, Michael Barbakoff notes that “Knowledge of the Enigma challenge and some details of how Bletchley Park were approaching the problem was first brought to the [US Army’s Signal Intelligence Service (SIS)] in the spring of 1941 by Abraham Sinkov and Leo Rosen, following their trip to the [Government Code and Cypher School (GCCS) at Bletchley Park] in February of that year.” (28) Collin Burke (2002, 135 140) gives a brief description of this “other Bombe Program.” He notes that in 1942, SIS engineer Leo Rosen was given the task of producing a machine that would allow SIS to compete with the US Navy’s OP-20-G developing cryptologic Bombe program.","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"46 1","pages":"280 - 283"},"PeriodicalIF":0.6,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49322124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-30DOI: 10.1080/01611194.2021.1949760
Chris Christensen
{"title":"Review of Before Bletchley Park: The Codebreakers of the First World War by Paul Gannon","authors":"Chris Christensen","doi":"10.1080/01611194.2021.1949760","DOIUrl":"https://doi.org/10.1080/01611194.2021.1949760","url":null,"abstract":"","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"46 1","pages":"272 - 276"},"PeriodicalIF":0.6,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44752252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-30DOI: 10.1080/01611194.2021.1969706
Chris Christensen
{"title":"Review of Radio War: The Secret Espionage War of the Radio Security Service 1938–1946 by David Abrutat","authors":"Chris Christensen","doi":"10.1080/01611194.2021.1969706","DOIUrl":"https://doi.org/10.1080/01611194.2021.1969706","url":null,"abstract":"","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"46 1","pages":"382 - 384"},"PeriodicalIF":0.6,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47048570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：