Pub Date : 2023-02-08DOI: 10.1080/01611194.2022.2160677
G. Lasry, Norbert Biermann, Satoshi Tomokiyo
Abstract Mary Stuart, Queen of Scots (1542–1587), has left an extensive corpus of letters held in various archive collections. There is evidence, however that other letters from Mary Stuart are missing from those collections, such as letters referenced in other sources but not found elsewhere. In Under the Molehill – an Elizabethan Spy Story, John Bossy writes that a secret correspondence with her associates and allies, prior to its compromise in mid-1583, was “kept so secure that none of it has survived, and we don’t know what was in it.” We have found over 55 letters fully in cipher in the Bibliothèque nationale de France, which, after we broke the code and deciphered the letters, unexpectedly turned out to be letters from Mary Stuart, addressed mostly to Michel de Castelnau Mauvissière, the French ambassador to England. Written between 1578 and 1584, those newly deciphered letters are most likely part of the aforementioned secret correspondence considered to have been lost, and they constitute a voluminous body of new primary material on Mary Stuart – about 50,000 words in total, shedding new light on some of her years of captivity in England.
{"title":"Deciphering Mary Stuart’s lost letters from 1578-1584","authors":"G. Lasry, Norbert Biermann, Satoshi Tomokiyo","doi":"10.1080/01611194.2022.2160677","DOIUrl":"https://doi.org/10.1080/01611194.2022.2160677","url":null,"abstract":"Abstract Mary Stuart, Queen of Scots (1542–1587), has left an extensive corpus of letters held in various archive collections. There is evidence, however that other letters from Mary Stuart are missing from those collections, such as letters referenced in other sources but not found elsewhere. In Under the Molehill – an Elizabethan Spy Story, John Bossy writes that a secret correspondence with her associates and allies, prior to its compromise in mid-1583, was “kept so secure that none of it has survived, and we don’t know what was in it.” We have found over 55 letters fully in cipher in the Bibliothèque nationale de France, which, after we broke the code and deciphered the letters, unexpectedly turned out to be letters from Mary Stuart, addressed mostly to Michel de Castelnau Mauvissière, the French ambassador to England. Written between 1578 and 1584, those newly deciphered letters are most likely part of the aforementioned secret correspondence considered to have been lost, and they constitute a voluminous body of new primary material on Mary Stuart – about 50,000 words in total, shedding new light on some of her years of captivity in England.","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"47 1","pages":"101 - 202"},"PeriodicalIF":0.6,"publicationDate":"2023-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47968338","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 : 2023-01-16DOI: 10.1080/01611194.2022.2156311
Philip Marks
{"title":"Review of Behind the Enigma by John Ferris","authors":"Philip Marks","doi":"10.1080/01611194.2022.2156311","DOIUrl":"https://doi.org/10.1080/01611194.2022.2156311","url":null,"abstract":"","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"169 ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41282267","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 : 2023-01-12DOI: 10.1080/01611194.2022.2134752
Wolfgang Killmann
{"title":"On security aspects of the ciphers T-310 and SKS with approved long-term keys","authors":"Wolfgang Killmann","doi":"10.1080/01611194.2022.2134752","DOIUrl":"https://doi.org/10.1080/01611194.2022.2134752","url":null,"abstract":"","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45839592","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 : 2022-11-03DOI: 10.1080/01611194.2022.2113185
Beáta Megyesi, Crina Tudor, Benedek Láng, Anna Lehofer, Nils Kopal, K. de Leeuw, Michelle Waldispühl
{"title":"Keys with nomenclatures in the early modern Europe","authors":"Beáta Megyesi, Crina Tudor, Benedek Láng, Anna Lehofer, Nils Kopal, K. de Leeuw, Michelle Waldispühl","doi":"10.1080/01611194.2022.2113185","DOIUrl":"https://doi.org/10.1080/01611194.2022.2113185","url":null,"abstract":"","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"1 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2022-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41326686","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 : 2022-10-25DOI: 10.1080/01611194.2022.2134753
Stuart Boersma, J. Linhart
Elizabeth Smith Friedman was a phenomenal cryptanalyst who worked with the US Government during both world wars and broke the codes and ciphers of drug and alcohol smugglers in the tumultuous years of Prohibition in between the wars. Her husband William Friedman was also a cryptanalyst whose career is often allowed to eclipse hers. There are two new biographies, with women authors, that give Elizebeth center stage and that introduce cryptography, codebreaking, and her accomplishments to a wider audience. The first biography, The Woman All Spies Fear: Code breaker Elizebeth Smith Friedman and her hidden life by Amy Butler Greenfield, was a finalist for the 2022 Young Adult Library Services Association’s award for excellence in nonfiction. Do not make the mistake of thinking this book is just for “young adults” – we “not-so-young adult” reviewers thoroughly enjoyed it too! The second biography is Code Breaker, Spy Hunter: How Elizebeth Smith Friedman changed the Course of Two World Wars by Laurie Wallmark and illustrated by Brook Smart. This is a beautifully illustrated children’s picture book. The Woman All Spies Fear opens with a teaser about the Doll Woman spying case that Elizebeth helped crack in 1944 and then flips back to Elizebeth Smith’s childhood, her drive to get a college education, and her struggle to repay a loan from her father for her education. In 1916, the need to repay her father results in her working for eccentric millionaire George Fabyan at his estate called Riverbank in Geneva, Illinois. At this point the narrative is interrupted with an interlude called a “Code Break” which educates the reader on the difference between a code and a cipher. Attentive readers might identify the beginning of a hidden message in this section before the biography returns to the main story where we find Elizebeth at Riverbank trying to find messages encrypted with a Bacon cipher hidden among the fonts of Shakespeare’s first folio. These “Code Break” sections appear frequently throughout the book and will be described in more detail below. Elizebeth soon meets William Friedman and
{"title":"Review of The Woman All Spies Fear by Amy Butler Greenfield and Code Breaker, Spy Hunter by Laurie Wallmark, Illustrated by Brooke Smart","authors":"Stuart Boersma, J. Linhart","doi":"10.1080/01611194.2022.2134753","DOIUrl":"https://doi.org/10.1080/01611194.2022.2134753","url":null,"abstract":"Elizabeth Smith Friedman was a phenomenal cryptanalyst who worked with the US Government during both world wars and broke the codes and ciphers of drug and alcohol smugglers in the tumultuous years of Prohibition in between the wars. Her husband William Friedman was also a cryptanalyst whose career is often allowed to eclipse hers. There are two new biographies, with women authors, that give Elizebeth center stage and that introduce cryptography, codebreaking, and her accomplishments to a wider audience. The first biography, The Woman All Spies Fear: Code breaker Elizebeth Smith Friedman and her hidden life by Amy Butler Greenfield, was a finalist for the 2022 Young Adult Library Services Association’s award for excellence in nonfiction. Do not make the mistake of thinking this book is just for “young adults” – we “not-so-young adult” reviewers thoroughly enjoyed it too! The second biography is Code Breaker, Spy Hunter: How Elizebeth Smith Friedman changed the Course of Two World Wars by Laurie Wallmark and illustrated by Brook Smart. This is a beautifully illustrated children’s picture book. The Woman All Spies Fear opens with a teaser about the Doll Woman spying case that Elizebeth helped crack in 1944 and then flips back to Elizebeth Smith’s childhood, her drive to get a college education, and her struggle to repay a loan from her father for her education. In 1916, the need to repay her father results in her working for eccentric millionaire George Fabyan at his estate called Riverbank in Geneva, Illinois. At this point the narrative is interrupted with an interlude called a “Code Break” which educates the reader on the difference between a code and a cipher. Attentive readers might identify the beginning of a hidden message in this section before the biography returns to the main story where we find Elizebeth at Riverbank trying to find messages encrypted with a Bacon cipher hidden among the fonts of Shakespeare’s first folio. These “Code Break” sections appear frequently throughout the book and will be described in more detail below. Elizebeth soon meets William Friedman and","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"47 1","pages":"88 - 92"},"PeriodicalIF":0.6,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41750599","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 : 2022-10-12DOI: 10.1080/01611194.2022.2103754
Selma Gomez Orr, C. Bonyadi, Enis Golaszewski, Alan T. Sherman, Peter A. H. Peterson, R. Forno, Sydney Johns, Jimmy Rodriguez
We explore shadow information technology (IT) at institutions of higher education through a two-tiered approach involving a detailed case study and comprehensive survey of IT professionals. In its many forms, shadow IT is the software or hardware present in a computer system or network that lies outside the typical review process of the responsible IT unit. We carry out a case study of an internally built legacy grants management system at the University of Maryland, Baltimore County that exemplifies the vulnerabilities, including cross-site scripting and SQL injection, typical of such unauthorized and ad-hoc software. We also conduct a survey of IT professionals at universities, colleges, and community colleges that reveals new and actionable information regarding the prevalence, usage patterns, types, benefits, and risks of shadow IT at their respective institutions. Further, we propose a security-based profile of shadow IT, involving a subset of elements from existing shadow IT taxonomies, that categorizes shadow IT from a security perspective. Based on this profile, survey respondents identified the predominant form of shadow IT at their institutions, revealing close similarities to findings from our case study. Through this work, we are the first to identify possible susceptibility factors associated with the occurrence of shadow IT related security incidents within academic institutions. Correlations of significance include the presence of certain graduate schools, the level of decentralization of the IT department, the types of shadow IT present, the percentage of security violations related to shadow IT, and the institution’s overall attitude toward shadow IT. The combined elements of our case study, profile, and survey provide the first comprehensive view of shadow IT security at academic institutions, highlighting tension between its risks and benefits, and suggesting strategies for managing it successfully.
{"title":"Shadow IT in higher education: survey and case study for cybersecurity","authors":"Selma Gomez Orr, C. Bonyadi, Enis Golaszewski, Alan T. Sherman, Peter A. H. Peterson, R. Forno, Sydney Johns, Jimmy Rodriguez","doi":"10.1080/01611194.2022.2103754","DOIUrl":"https://doi.org/10.1080/01611194.2022.2103754","url":null,"abstract":"We explore shadow information technology (IT) at institutions of higher education through a two-tiered approach involving a detailed case study and comprehensive survey of IT professionals. In its many forms, shadow IT is the software or hardware present in a computer system or network that lies outside the typical review process of the responsible IT unit. We carry out a case study of an internally built legacy grants management system at the University of Maryland, Baltimore County that exemplifies the vulnerabilities, including cross-site scripting and SQL injection, typical of such unauthorized and ad-hoc software. We also conduct a survey of IT professionals at universities, colleges, and community colleges that reveals new and actionable information regarding the prevalence, usage patterns, types, benefits, and risks of shadow IT at their respective institutions. Further, we propose a security-based profile of shadow IT, involving a subset of elements from existing shadow IT taxonomies, that categorizes shadow IT from a security perspective. Based on this profile, survey respondents identified the predominant form of shadow IT at their institutions, revealing close similarities to findings from our case study. Through this work, we are the first to identify possible susceptibility factors associated with the occurrence of shadow IT related security incidents within academic institutions. Correlations of significance include the presence of certain graduate schools, the level of decentralization of the IT department, the types of shadow IT present, the percentage of security violations related to shadow IT, and the institution’s overall attitude toward shadow IT. The combined elements of our case study, profile, and survey provide the first comprehensive view of shadow IT security at academic institutions, highlighting tension between its risks and benefits, and suggesting strategies for managing it successfully.","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":" ","pages":""},"PeriodicalIF":0.6,"publicationDate":"2022-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45046651","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 : 2022-10-10DOI: 10.1080/01611194.2022.2109943
R. Santosh Kumar, S. Krishna
Abstract RSA is a well-known cryptosystem in Modern Cryptography and its efficiency is based on the hardness of the Integer Factorization problem. The algorithm is shown to be vulnerable to several attacks in a number of special scenarios with assumptions. In this paper, the strength of RSA is investigated if the primes in the modulus are close and the same modulus is used for two instances. The attack is highly efficient compared to other known attacks which are only concentrated on either closeness of the primes or the same modulus used for two or more instances. This attack examines the closeness of the primes chosen whenever the RSA system is used for two instances with the same modulus. The LLL algorithm is used to obtain the bound, and the bound is highly efficient compared to other known attacks.
{"title":"Cryptanalysis of RSA with small difference of primes and two decryption exponents: Jochemsz and May approach","authors":"R. Santosh Kumar, S. Krishna","doi":"10.1080/01611194.2022.2109943","DOIUrl":"https://doi.org/10.1080/01611194.2022.2109943","url":null,"abstract":"Abstract RSA is a well-known cryptosystem in Modern Cryptography and its efficiency is based on the hardness of the Integer Factorization problem. The algorithm is shown to be vulnerable to several attacks in a number of special scenarios with assumptions. In this paper, the strength of RSA is investigated if the primes in the modulus are close and the same modulus is used for two instances. The attack is highly efficient compared to other known attacks which are only concentrated on either closeness of the primes or the same modulus used for two or more instances. This attack examines the closeness of the primes chosen whenever the RSA system is used for two instances with the same modulus. The LLL algorithm is used to obtain the bound, and the bound is highly efficient compared to other known attacks.","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"47 1","pages":"570 - 583"},"PeriodicalIF":0.6,"publicationDate":"2022-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47768406","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 : 2022-09-22DOI: 10.1080/01611194.2022.2081824
Satish Kumar, Indivar Gupta, Ashok Gupta
Abstract A public-key cryptosystem is the undoubted spine of present-day communication systems. Many mathematical theories like number theory, group theory, and ring theory were utilized to design various cryptographic protocols. Similarly, quasigroups play a significant part in building both symmetric and public-key cryptosystems. Some famous cryptographic primitives like EdonX and NASHA are based on quasigroups. In this survey article, we will discuss some public-key cryptographic algorithms based on quasigroups and their structures.
{"title":"A study of public key cryptosystems based on quasigroups","authors":"Satish Kumar, Indivar Gupta, Ashok Gupta","doi":"10.1080/01611194.2022.2081824","DOIUrl":"https://doi.org/10.1080/01611194.2022.2081824","url":null,"abstract":"Abstract A public-key cryptosystem is the undoubted spine of present-day communication systems. Many mathematical theories like number theory, group theory, and ring theory were utilized to design various cryptographic protocols. Similarly, quasigroups play a significant part in building both symmetric and public-key cryptosystems. Some famous cryptographic primitives like EdonX and NASHA are based on quasigroups. In this survey article, we will discuss some public-key cryptographic algorithms based on quasigroups and their structures.","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"47 1","pages":"511 - 540"},"PeriodicalIF":0.6,"publicationDate":"2022-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49296029","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 : 2022-09-21DOI: 10.1080/01611194.2022.2116614
Leonardo Campanelli
Abstract The encryption method used to encode the second Beale cipher leads to a ε-Benford’s distribution for the first significant digit of the numbers in the coded message. The relative level of deviation from Benford’s law, ε, is about 0.15 for the second decoded cipher. The other two undeciphered codes show a statistically significant deviation from a 0.15-Benford’s law, suggesting that either ciphers 1 and 3 are fake or the encryption method used to encode them is different from the one used for cipher 2.
{"title":"A statistical cryptanalysis of the Beale ciphers","authors":"Leonardo Campanelli","doi":"10.1080/01611194.2022.2116614","DOIUrl":"https://doi.org/10.1080/01611194.2022.2116614","url":null,"abstract":"Abstract The encryption method used to encode the second Beale cipher leads to a ε-Benford’s distribution for the first significant digit of the numbers in the coded message. The relative level of deviation from Benford’s law, ε, is about 0.15 for the second decoded cipher. The other two undeciphered codes show a statistically significant deviation from a 0.15-Benford’s law, suggesting that either ciphers 1 and 3 are fake or the encryption method used to encode them is different from the one used for cipher 2.","PeriodicalId":55202,"journal":{"name":"Cryptologia","volume":"47 1","pages":"466 - 473"},"PeriodicalIF":0.6,"publicationDate":"2022-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46512651","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
扫码关注我们
求助内容：
应助结果提醒方式：