DOCSLIB.ORG

A Bibliography of Publications on Hashing Algorithms

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Bibliography of Publications on Hashing Algorithms A Bibliography of Publications on Hashing Algorithms Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 24 August 2021 Version 2.344 Title word cross-reference [BRM+09, BS91b, BS91a, CM01, Gir87, Ven86, WS93, War14, Coh97, Coh98, LHC05, QG89, QG90]. O(1) [FKS84]. O(log log n) #2 [Cer85]. [MN90]. O(log W ) [LS07b]. O(N) [HG77, MN90]. pn [Ack74]. π [FFGL10]. q 1 [PPS21]. 10 [GLM+10]. 11 [SY11]. 2 [OWZ14]. SL2 [MT16]. Z=p [Mue04]. + [EAA 16, GG92, HD72]. 2n [QG89, QG90]. + 3 [CBA94, Fly92, GG92, GK94, LMJC07, -approximate [SWQ 14]. -ary LDY+16, SYW+20, WSSO12]. 5=8 [Sch11]. [CC91, CLC92, Gui78, RRS07]. -Bit $62m [Nic17]. 64 [LK16]. ∗ [LNS93]. + [QG89, QG90, LK16, LK11]. -Body MT [WS93, War14]. -codes [Bie95]. -dimension [Omi88, Omi89a]. [HRB13]. 2 [AK98, QJ97]. A [Lyo83]. A∗ [MD97]. A2 [LHC05]. -dimensional [Yuv75]. + + -Functions [OOB12]. -gram [Bie95]. α [ABC 16]. b [LK11]. B [TB91]. + c [SWQ+14]. d [FPS17, PRM16]. f [LG78]. [Coh98, Ven86]. -Grams [Coh97, BRM 09]. 2 -Hash [BS91b, BS91a]. -Independence GL2(Fpn )[TNS20].H [DRS12]. H2A [CBB05]. K [Yuv75, APV07, CL85, CC91, [PT16, PT10a]. -mer [HC14, PNPC20]. CLC92, DKRT15, Die96, EFMRK+20, -min-wise [FPS17]. -Nearest [CL85]. + -partitions [DKRT15]. -Pipeline [PRM16]. FPS17, Gui78, HC14, LLG 17, PT10a, + PT16, PNPC20, RRS07, SS90b]. L [OOB12]. -probe [SS90b]. -Round [GLM 10, SY11]. + -tree [Omi89a, Lyo83]. -trees [CM01]. Lp [CJ19, HFF 17]. SL2(F2n ) [SGGB00]. N 1 2 -verarbeitung [Nie75]. -wise [Die96]. [ACM97a, ACM97b, ANS97]. 1998 [ACM98, GSW98, Kar98]. 1999 [AOV+99]. 0 [BCJ15, ITP14, NSS+06, WYY05d]. '07 19th [ACM91b, Kui92, RRR99, Wie99, [ACM07]. '08 [ACM08b]. vL94, ABB93]. 1st [CCC89, Coh94]. 1 2 [BH86, GT63, KMV10, LS15, ST86, SK05]. [AMSM+09, AAE+14, BCJ15, Con17, DR06, 2000 [Shm00, ZC12]. 2001 JRPK07, KKRJ07, KRJ09b, KJS17, Nat95, [ACM01, AAC+01]. 2002 [ACM02]. 2003 SKP15, WYY05a, WYY05b, WYY05c]. '10 [ACM03a, ACM03b, Deb03]. 2004 [ACM04]. [Ano10]. 100 [BLC12]. 100-Gb [BLC12]. 2005 [ACM05, ANS05]. 2006 [ABM06]. 100-Gb/s [BLC12]. 10118-3 [ISO04]. 10th 2007 [ACM07]. 2008 [ACM08b, LL08]. [Ano93a, DSZ07a, DSZ07b, DJRZ06, IEE94a, 2009 [Mat09]. 2010 [Ano10]. 2011 Fre90]. 11th [PV85, Shm00]. 128 [Van10, LCK11]. 20th [LP16, MNS12, WFLY04]. 128-bit [MIO89]. [AH03, Bel00, EF12, WGM88, BJZ94]. 12th [BJZ94, Bri92, Bri93, DJNR09, LC06]. 21-January [USE91]. 21./22 [Lut88]. 21st 13th [DJNR09, Sti93, Sti94c, Vid90]. 14th [ACM91b, IEE80b, JY14]. 22nd [AAC+01, Bir07]. 15th [AiNOW11, Yun02]. 23rd [IEE82]. 24th [BIP92, BJZ94, Cop95a, Cop95b, IEE74]. [??69, ABB93, Fra04]. 24th-27th [ABB93]. 160 [BDP97, PBD97]. 16th 25/1989 [AW89]. 256 [HM08, MSDS90]. 17th [AKY13, CMP07, MAK+12, PPS21, Sch11]. [FS09, IEE76, IEE05, MS05, Pat90, Ano10]. 25th [Sho05, Vau06]. 26th [IEE85a]. 27th 18 [Sar80]. 180 [Nat95]. 180-1 [ABB93]. 28-July [Rei88]. 29-March [Ano95b, Nat95]. 180-4 [Dan13]. 18th [IEE88a]. 29/Sept [BD88]. 29th [IEE88c]. [Deb03, Yua92]. 1969 [AFI69]. 1974 2HOT [War14]. 2k [USE00b]. 2nd [Ros74]. 1975 [ACM83a, ACM94a, ABM06, HL91, ICD86, [ACM75c, ACM75b, ACM75a, Ker75]. 1976 Sch82a, KI94, Yu92]. [ACM76]. 1977 [ACM77b, Gil77, TWW77]. 1978 [Win78, Yao78]. 1979 [ACM79, Ng79]. 3 1980 [dBvL80]. 1981 [Bai81, Mo92b]. 1982 [ABM+12, jCPB+12, NIS15, Sed93, Ruc15]. [LFP82, VLD82, IEE82, NS82, Sch82a]. 30-May [ACM84b]. 30th [IEE89]. 1983 [Ano83, ST83b]. 1984 31-November [ST83b]. 320 [MJ08]. [ACM84b, ACM84a, DSS84]. 1985 [PV85]. 320-bit [MJ08]. 32nd [CIM+05, IEE91b]. 1985/11th [PV85]. 1986 33rd [ACM01, IEE92b]. 34th [ACJT07]. [ACM86b, CGO86, Fis87, Oxb86]. 1987 35th [ADG+08, Gol94]. 360 [Dit76]. 36th [DT87]. 1988 [ACM88b, BD88, WGM88]. [AMSM+09]. 37th [AGK+10]. 39th 1989 [ACM07]. 3rd [J´aj90, LS89, Rei88, TWW77, [IJW89, ACM89c, MK89, PK89, RK89]. Wol93a, Wol93b, ACM91c]. 1990 [ACM90, J´aj90, USE90, Vid90, WPY90]. 40th [ACM08b, IEE99]. 42-step [AKY13]. 1990's [Rie89]. 1991 45 [Pro94]. 47th [IEE06]. 48th [IEE07]. [ACM91d, ACM91e, IEE91a, lWSS91]. 1992 4th [IJW89, BW92, Far93, HKNW07, [BIP92, Sto92]. 1993 [BJ93, IEE93]. JBJ94, Lom93, PSN95, USE00a]. 1993/sponsored [HB93]. 1994 [SW94b]. 1996 [ACM96]. 1997 5 [PW94]. 5-Independent [TZ12]. 512 3 [GLM+10]. 51st [IEE10]. 52nd [IEE11b]. KR86a, KM88b, LK84, Lit84, LL86, LMR02, 54th [IEE13]. 5G [Cho21]. 5th MY79, Mul72, Ols69, Pet57, SD85, SDKR87, [BRW93, Boy95a, Boy95b]. SHRD09, Tra63, VB00, XHZ+19, YL04, And88, Bay73b, BCGS16, CS93a, FPSS05, 68110a [Sar80]. HB89b, KFG15, Lar88b, Lin63, MBK00, Mil95, ML95, RT89, TKT+89, ZO13]. '76 [Jen76]. '79 [Ng79]. 7th access-pattern-driven [ZO13]. Accessed [ARA94, Bar83, CHK06, USE00b, Win78]. [Ols69]. Accesses [Pan05]. Accessing [Cha88, Ore83, FK89]. accommodation 80f [Sar80]. '83 [Ano83, CRS83a]. '84 [HO72]. Accountable [XHZ+19]. [ACM84a]. '85 [IEE85b]. '86 [AA86]. '87 Accumulated [Nyb96]. accumulating [CP87, CP88]. '88 [ACM88a]. '89 [ACM89a, [ZHW01]. Accumulators BV89, BF89, Bra90, QV89, QV90, CP91c]. [CHKO08, PTT16, CHKO12]. Accuracy [YWH09, HKL07]. Accurate [LCL+20, 9-13 [ACJT07]. '90 [AFK90, A+90, PCV94, SL16, YGS+19, NTW09, TYSK10]. Dam90a, Dam91, IEE90, MV91c, SP90]. '91 Achieve [LLL+16]. achieved [Con17]. [ACM91a, Dav91, Fei91, HL91, IEE91a, Achieving [Lar88b, Lyo85]. ACM IRM93, ACM91c]. '92 [ACM94d, ??69, ACM75c, ACM75b, [Bri92, Bri93, BW92, FNY92, IEE92a, ACM75a, ACM76, ACM77b, LFP82, KLT92, Rue93, SZ93, Yua92]. '93 ACM82, ACM83b, ACM84b, ACM85b, [Ano93c, BRW93, BJ93, Hel94, IEE93, ACM85a, ACM86b, ACM86a, ACM87, Lom93, Sti93, Sti94c, vL94]. 93k [Pro94]. ACM88a, ACM88b, ACM89b, ACM89a, '94 [ACM94b, De 95, JBJ94, PSN95, ACM89c, SDA90, ACM90, ACM91c, SW94b, SW94a]. '95 ACM91d, ACM91a, SDA91, ACM91e, [Cop95b, GQ95, IEE95, Lev95, QG95]. 959 ACM96, ACM97a, ACM97b, ACM98, [ACZ16].´ '96 [Lak96]. '99 [Wie99]. 9th ACM01, ACM02, ACM03a, ACM04, ACM05, [DJRZ06, ST83a, IEE88d]. ACM07, ACM08a, ACM08b, ACM11, ACM12, Ano92, BIP92, BJ93, CLM89, A. [Pro94]. Aarhus FMA02, GMJ90, Van10, HF13, IEE02, [Dam90a, Dam91, NS82]. ability [DLM07]. Jen76, Kar98, LL08, Mat09, Nav85, Rie89, abolishing [DSS10]. Abstract [DP08, ACM77a, Shm00, SW94b, Sto92, YR87, EjKMP80, Lum73, MW95, SW87, THS97]. ACM81, ACM91b, BV89, Lie81]. Abstraction [CL83, DL06, Hil88, LPSW03]. ACM-SIAM [ACM94d, SDA90, SDA91, abstraction-safe [LPSW03]. Academic ACM97a, ACM05, ACM08a, Kar98]. [Cer85]. ACCEL [HKL04]. ACM-SIGMOD [Nav85, Lie81, ACM81]. ACCEL-RATE [HKL04]. accelerate across [HWZP18, SF88]. Action [BFR87]. [GK12b]. Accelerated activation [SZO+20]. Active [Kri89, MW09, MWC12]. Accelerating [GHJ+93, EVF06]. Actor [TCP+17]. Ad [HAK+16, TT82, BLY20]. Acceleration [DPH08, JLH08, Cha12]. Ad-Hoc [JLH08]. [FAFK21, JMH02]. Accelerator Ada [BCS89, ST86, Tro06, Wol84]. [FM91, TLLL09]. Access AdaBoost [LLZ10]. Adaptable [NHS84]. [Ast80, BDPSNG97, BM76, CF89a, Cla77, adaptation [DOP+14]. Adapted [RJK79]. Dum56, FNPS79, Fal85b, F+03, FP89b, Adaptive FKS84, GG74, HB89a, HB92, KR86b, [Ahn86, Ahn87, BK90, CBB05, CS02, Gri98, 4 HT88, IGA05, KR91, KL08, LBJ02, OL91, Albuquerque [ACM75c, ACM75a, IEE91a]. OL92, ST93, TC04, ZG90a, Zel91, GZ99, Algebra [Bra84b, KTMO83b, KTMo83c, HAK+16, LYJ+13, LMLC14, TB91]. EBD91, FP89a]. Algebraic Adaptive-Hash [OL91, OL92]. add [FJ13]. [ACM94b, EjKMP80, Jen76, Lak96, Lev95, add-rotate-xor [FJ13]. Addendum Mar71, Ng79, WX01, vdHvH12, BF08, GS89, [CV85]. addition [FJ13]. Additional LS06, Pon87, Coh94, AAGG16]. Algebras [LY72]. Additive [MBBS12]. Address [CT96]. Algol [FR69]. Algol-Based [FR69]. [HP63, Jai89, Jai92a, Jai92b, Jaixx, LYD71, Algorithm Lum73, PK87, SR63, Tam85, TK85, Wil96, [ANS97, ANS05, AKS78, ABH+73, LY72, MLP07, MPL09, RW07]. AEMR09, BH90, BI87, Bou12, Boy98, Addressable [Hin20, RSK17, Koh80, BB07]. CS85a, jCPB+12, CdM89, CW09, CT12, Addressed [SVCC01]. Addressing Coh98, CHM92a, CHM92b, CM93, Dev93, [Bay74, Bra84a, Bra86, Buc63, Fab74, Fel87, DCM18, FL73, FFPV84, FCHD88, FCHD89, Gon77, Gon80, JC88a, Joh61, Kno71, Kno88, FCH92, Fro81, Get01, Han90, HCKW90, KR79, KRJ+80, Lit80, Litxxa, LH03b, HR96, HW08, HG77, HC13, Jen97, JRPK07, LH03a, Mot84, MC86, Pet57, RJK79, SS62, KMM+06, KKRJ07, Leb87, LLDZ18, LLL11, SD76, Som99, Tra63, CKW93, Lin63, NK16, LLW10, MXL+12, Man12, MHB90, MV01, TT81, Wan05, van73]. Adelaide [Bar83]. MH00, NP91, OG94a, OOB17, OL91, Omi91, Adjusting [Pag85, Wog89]. OL92, Pap94, PCY95, Pes96, Pit87, PVM97, Administration [Fis87]. Adressing Reg82, SS01, Sol93, Spe92, Sta99, TRN86, [Bra85]. Advanced TTY93, Toy93, TSP+11, WG00, WWZ09, [Ano93d, CE95, HDCM11, Hsi83]. WZJS10, WS93, WVT90, Wil97, Wil71, Advances [Buc82, AFK90, Bel00, Bra90, WDYT91, WYT93, WL12, ZG90a, ZJM94b, Bri92, Bri93, CRS83a, CP87, CP88, Cop95a, ZPS90, ZPS93a, AS89, AT18, AGJA06, Cop95b, Dam90a, Dam91, Dav91, De 95, ATAKS07, CLS95, CLW98, DHKP97, FH79, Fei91, Fra04, GQ95, Hel94, IRM93, JBJ94, FHC89, FKI+21, Gai82, GBY90, HLL18b, LC06, MV91c, PSN95, QV89, QV90, QG95, HL94, ISO97, ISHY88, JWM+18, Kim99, Rue93, SP90, SZ93, Sho05, Sti93, Sti94c, LEHN02, MMC01, MKSiA98, OT89]. Vau06, Wie99, Yun02]. Advantage algorithm [PCV94, PL21, Pri95, SB95, [WSSO12]. Adversaries [LN93]. Advisor SM94, Sil02b, Ste18, WM93, War14, Wie86, [Cer85]. Aegean [Rei88, Rei88]. YCJ12, ZJM94a, ZJM94c, ZPS93b, ACZ16,´ Aeronautical [KCF84]. Aeronautics Sta94, TKI99]. Algorithmen [Fis87]. Aerospace [Fis87, IEE94b]. AES [Meh77, Meh86, Wir75, Wir83, Zel91]. [ABO+17, BOY11, BOS11,¨ GK08, Rog19a, Algorithmics [Mat93]. Algorithms Sas11, JNPP14]. AES-like [JNPP14]. [ACM94d,
Load more

Recommended publications
  • A Quantitative Study of Advanced Encryption Standard Performance
    United States Military Academy USMA Digital Commons West Point ETD 12-2018 A Quantitative Study of Advanced Encryption Standard Performance as it Relates to Cryptographic Attack Feasibility Daniel Hawthorne United States Military Academy, [email protected] Follow this and additional works at: https://digitalcommons.usmalibrary.org/faculty_etd Part of the Information Security Commons Recommended Citation Hawthorne, Daniel, "A Quantitative Study of Advanced Encryption Standard Performance as it Relates to Cryptographic Attack Feasibility" (2018). West Point ETD. 9. https://digitalcommons.usmalibrary.org/faculty_etd/9 This Doctoral Dissertation is brought to you for free and open access by USMA Digital Commons. It has been accepted for inclusion in West Point ETD by an authorized administrator of USMA Digital Commons. For more information, please contact [email protected]. A QUANTITATIVE STUDY OF ADVANCED ENCRYPTION STANDARD PERFORMANCE AS IT RELATES TO CRYPTOGRAPHIC ATTACK FEASIBILITY A Dissertation Presented in Partial Fulfillment of the Requirements for the Degree of Doctor of Computer Science By Daniel Stephen Hawthorne Colorado Technical University December, 2018 Committee Dr. Richard Livingood, Ph.D., Chair Dr. Kelly Hughes, DCS, Committee Member Dr. James O. Webb, Ph.D., Committee Member December 17, 2018 © Daniel Stephen Hawthorne, 2018 1 Abstract The advanced encryption standard (AES) is the premier symmetric key cryptosystem in use today. Given its prevalence, the security provided by AES is of utmost importance. Technology is advancing at an incredible rate, in both capability and popularity, much faster than its rate of advancement in the late 1990s when AES was selected as the replacement standard for DES. Although the literature surrounding AES is robust, most studies fall into either theoretical or practical yet infeasible.
    [Show full text]
  • Acm Names Fellows for Innovations in Computing
    CONTACT: Virginia Gold 212-626-0505 [email protected] ACM NAMES FELLOWS FOR INNOVATIONS IN COMPUTING 2014 Fellows Made Computing Contributions to Enterprise, Entertainment, and Education NEW YORK, January 8, 2015—ACM has recognized 47 of its members for their contributions to computing that are driving innovations across multiple domains and disciplines. The 2014 ACM Fellows, who hail from some of the world’s leading universities, corporations, and research labs, have achieved advances in computing research and development that are driving innovation and sustaining economic development around the world. ACM President Alexander L. Wolf acknowledged the advances made by this year’s ACM Fellows. “Our world has been immeasurably improved by the impact of their innovations. We recognize their contributions to the dynamic computing technologies that are making a difference to the study of computer science, the community of computing professionals, and the countless consumers and citizens who are benefiting from their creativity and commitment.” The 2014 ACM Fellows have been cited for contributions to key computing fields including database mining and design; artificial intelligence and machine learning; cryptography and verification; Internet security and privacy; computer vision and medical imaging; electronic design automation; and human-computer interaction. ACM will formally recognize the 2014 Fellows at its annual Awards Banquet in June in San Francisco. Additional information about the ACM 2014 Fellows, the awards event, as well as previous
    [Show full text]
  • Journal of Applied Logic
    JOURNAL OF APPLIED LOGIC AUTHOR INFORMATION PACK TABLE OF CONTENTS XXX . • Description p.1 • Impact Factor p.1 • Abstracting and Indexing p.1 • Editorial Board p.1 • Guide for Authors p.5 ISSN: 1570-8683 DESCRIPTION . This journal welcomes papers in the areas of logic which can be applied in other disciplines as well as application papers in those disciplines, the unifying theme being logics arising from modelling the human agent. For a list of areas covered see the Editorial Board. The editors keep close contact with the various application areas, with The International Federation of Compuational Logic and with the book series Studies in Logic and Practical Reasoning. Benefits to authors We also provide many author benefits, such as free PDFs, a liberal copyright policy, special discounts on Elsevier publications and much more. Please click here for more information on our author services. Please see our Guide for Authors for information on article submission. This journal has an Open Archive. All published items, including research articles, have unrestricted access and will remain permanently free to read and download 48 months after publication. All papers in the Archive are subject to Elsevier's user license. If you require any further information or help, please visit our Support Center IMPACT FACTOR . 2016: 0.838 © Clarivate Analytics Journal Citation Reports 2017 ABSTRACTING AND INDEXING . Zentralblatt MATH Scopus EDITORIAL BOARD . Executive Editors Dov M. Gabbay, King's College London, London, UK Sarit Kraus, Bar-llan University,
    [Show full text]
  • Knowledge Representation in Bicategories of Relations
    Knowledge Representation in Bicategories of Relations Evan Patterson Department of Statistics, Stanford University Abstract We introduce the relational ontology log, or relational olog, a knowledge representation system based on the category of sets and relations. It is inspired by Spivak and Kent’s olog, a recent categorical framework for knowledge representation. Relational ologs interpolate between ologs and description logic, the dominant formalism for knowledge representation today. In this paper, we investigate relational ologs both for their own sake and to gain insight into the relationship between the algebraic and logical approaches to knowledge representation. On a practical level, we show by example that relational ologs have a friendly and intuitive—yet fully precise—graphical syntax, derived from the string diagrams of monoidal categories. We explain several other useful features of relational ologs not possessed by most description logics, such as a type system and a rich, flexible notion of instance data. In a more theoretical vein, we draw on categorical logic to show how relational ologs can be translated to and from logical theories in a fragment of first-order logic. Although we make extensive use of categorical language, this paper is designed to be self-contained and has considerable expository content. The only prerequisites are knowledge of first-order logic and the rudiments of category theory. 1. Introduction arXiv:1706.00526v2 [cs.AI] 1 Nov 2017 The representation of human knowledge in computable form is among the oldest and most fundamental problems of artificial intelligence. Several recent trends are stimulating continued research in the field of knowledge representation (KR).
    [Show full text]
  • On Security and Privacy for Networked Information Society
    Antti Hakkala On Security and Privacy for Networked Information Society Observations and Solutions for Security Engineering and Trust Building in Advanced Societal Processes Turku Centre for Computer Science TUCS Dissertations No 225, November 2017 ON SECURITY AND PRIVACY FOR NETWORKED INFORMATIONSOCIETY Observations and Solutions for Security Engineering and Trust Building in Advanced Societal Processes antti hakkala To be presented, with the permission of the Faculty of Mathematics and Natural Sciences of the University of Turku, for public criticism in Auditorium XXII on November 18th, 2017, at 12 noon. University of Turku Department of Future Technologies FI-20014 Turun yliopisto 2017 supervisors Adjunct professor Seppo Virtanen, D. Sc. (Tech.) Department of Future Technologies University of Turku Turku, Finland Professor Jouni Isoaho, D. Sc. (Tech.) Department of Future Technologies University of Turku Turku, Finland reviewers Professor Tuomas Aura Department of Computer Science Aalto University Espoo, Finland Professor Olaf Maennel Department of Computer Science Tallinn University of Technology Tallinn, Estonia opponent Professor Jarno Limnéll Department of Communications and Networking Aalto University Espoo, Finland The originality of this thesis has been checked in accordance with the University of Turku quality assurance system using the Turnitin OriginalityCheck service ISBN 978-952-12-3607-5 (Online) ISSN 1239-1883 To my wife Maria, I am forever grateful for everything. Thank you. ABSTRACT Our society has developed into a networked information soci- ety, in which all aspects of human life are interconnected via the Internet — the backbone through which a significant part of communications traffic is routed. This makes the Internet ar- guably the most important piece of critical infrastructure in the world.
    [Show full text]
  • Efficient Hashing Using the AES Instruction
    Efficient Hashing Using the AES Instruction Set Joppe W. Bos1, Onur Özen1, and Martijn Stam2 1 Laboratory for Cryptologic Algorithms, EPFL, Station 14, CH-1015 Lausanne, Switzerland {joppe.bos,onur.ozen}@epfl.ch 2 Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, United Kingdom [email protected] Abstract. In this work, we provide a software benchmark for a large range of 256-bit blockcipher-based hash functions. We instantiate the underlying blockci- pher with AES, which allows us to exploit the recent AES instruction set (AES- NI). Since AES itself only outputs 128 bits, we consider double-block-length constructions, as well as (single-block-length) constructions based on RIJNDAEL- 256. Although we primarily target architectures supporting AES-NI, our frame- work has much broader applications by estimating the performance of these hash functions on any (micro-)architecture given AES-benchmark results. As far as we are aware, this is the first comprehensive performance comparison of multi- block-length hash functions in software. 1 Introduction Historically, the most popular way of constructing a hash function is to iterate a com- pression function that itself is based on a blockcipher (this idea dates back to Ra- bin [49]). This approach has the practical advantage—especially on resource-constrained devices—that only a single primitive is needed to implement two functionalities (namely encrypting and hashing). Moreover, trust in the blockcipher can be conferred to the cor- responding hash function. The wisdom of blockcipher-based hashing is still valid today. Indeed, the current cryptographic hash function standard SHA-2 and some of the SHA- 3 candidates are, or can be regarded as, blockcipher-based designs.
    [Show full text]
  • Contextuality, Cohomology and Paradox
    The Sheaf Team Rui Soares Barbosa, Kohei Kishida, Ray Lal and Shane Mansfield Samson Abramsky Joint work with Rui Soares Barbosa, KoheiContextuality, Kishida, Ray LalCohomology and Shane and Mansfield Paradox (Department of Computer Science, University of Oxford)2 / 37 Contextuality. Key to the \magic" of quantum computation. Experimentally verified, highly non-classical feature of physical reality. And pervasive in logic, computation, and beyond. In a nutshell: data which is locally consistent, but globally inconsistent. We find a direct connection between the structure of quantum contextuality and classic semantic paradoxes such as \Liar cycles". Conversely, contextuality offers a novel perspective on these paradoxes. Cohomology. Sheaf theory provides the natural mathematical setting for our analysis, since it is directly concerned with the passage from local to global. In this setting, it is furthermore natural to use sheaf cohomology to characterise contextuality. Cohomology is one of the major tools of modern mathematics, which has until now largely been conspicuous by its absence, in logic, theoretical computer science, and quantum information. Our results show that cohomological obstructions to the extension of local sections to global ones witness a large class of contextuality arguments. Contextual Semantics Samson Abramsky Joint work with Rui Soares Barbosa, KoheiContextuality, Kishida, Ray LalCohomology and Shane and Mansfield Paradox (Department of Computer Science, University of Oxford)3 / 37 In a nutshell: data which is locally consistent, but globally inconsistent. We find a direct connection between the structure of quantum contextuality and classic semantic paradoxes such as \Liar cycles". Conversely, contextuality offers a novel perspective on these paradoxes. Cohomology. Sheaf theory provides the natural mathematical setting for our analysis, since it is directly concerned with the passage from local to global.
    [Show full text]
  • Current Issue of FACS FACTS
    Issue 2021-2 July 2021 FACS A C T S The Newsletter of the Formal Aspects of Computing Science (FACS) Specialist Group ISSN 0950-1231 FACS FACTS Issue 2021-2 July 2021 About FACS FACTS FACS FACTS (ISSN: 0950-1231) is the newsletter of the BCS Specialist Group on Formal Aspects of Computing Science (FACS). FACS FACTS is distributed in electronic form to all FACS members. Submissions to FACS FACTS are always welcome. Please visit the newsletter area of the BCS FACS website for further details at: https://www.bcs.org/membership/member-communities/facs-formal-aspects- of-computing-science-group/newsletters/ Back issues of FACS FACTS are available for download from: https://www.bcs.org/membership/member-communities/facs-formal-aspects- of-computing-science-group/newsletters/back-issues-of-facs-facts/ The FACS FACTS Team Newsletter Editors Tim Denvir [email protected] Brian Monahan [email protected] Editorial Team: Jonathan Bowen, John Cooke, Tim Denvir, Brian Monahan, Margaret West. Contributors to this issue: Jonathan Bowen, Andrew Johnstone, Keith Lines, Brian Monahan, John Tucker, Glynn Winskel BCS-FACS websites BCS: http://www.bcs-facs.org LinkedIn: https://www.linkedin.com/groups/2427579/ Facebook: http://www.facebook.com/pages/BCS-FACS/120243984688255 Wikipedia: http://en.wikipedia.org/wiki/BCS-FACS If you have any questions about BCS-FACS, please send these to Jonathan Bowen at [email protected]. 2 FACS FACTS Issue 2021-2 July 2021 Editorial Dear readers, Welcome to the 2021-2 issue of the FACS FACTS Newsletter. A theme for this issue is suggested by the thought that it is just over 50 years since the birth of Domain Theory1.
    [Show full text]
  • Stream Cipher Designs: a Review
    SCIENCE CHINA Information Sciences March 2020, Vol. 63 131101:1–131101:25 . REVIEW . https://doi.org/10.1007/s11432-018-9929-x Stream cipher designs: a review Lin JIAO1*, Yonglin HAO1 & Dengguo FENG1,2* 1 State Key Laboratory of Cryptology, Beijing 100878, China; 2 State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100190, China Received 13 August 2018/Accepted 30 June 2019/Published online 10 February 2020 Abstract Stream cipher is an important branch of symmetric cryptosystems, which takes obvious advan- tages in speed and scale of hardware implementation. It is suitable for using in the cases of massive data transfer or resource constraints, and has always been a hot and central research topic in cryptography. With the rapid development of network and communication technology, cipher algorithms play more and more crucial role in information security. Simultaneously, the application environment of cipher algorithms is in- creasingly complex, which challenges the existing cipher algorithms and calls for novel suitable designs. To accommodate new strict requirements and provide systematic scientific basis for future designs, this paper reviews the development history of stream ciphers, classifies and summarizes the design principles of typical stream ciphers in groups, briefly discusses the advantages and weakness of various stream ciphers in terms of security and implementation. Finally, it tries to foresee the prospective design directions of stream ciphers. Keywords stream cipher, survey, lightweight, authenticated encryption, homomorphic encryption Citation Jiao L, Hao Y L, Feng D G. Stream cipher designs: a review. Sci China Inf Sci, 2020, 63(3): 131101, https://doi.org/10.1007/s11432-018-9929-x 1 Introduction The widely applied e-commerce, e-government, along with the fast developing cloud computing, big data, have triggered high demands in both efficiency and security of information processing.
    [Show full text]
  • Physics from Computer Science
    Physics from Computer Science Samson Abramsky and Bob Coecke Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK. samson abramsky · [email protected] Where sciences interact. We are, respectively, a computer scientist interested in the logic and seman- tics of computation, and a physicist interested in the foundations of quantum mechanics. Currently we are pursuing what we consider to be a very fruitful collaboration as members of the same Computer Science department. How has this come about? It flows naturally from the fact that we are working in a field of computer science where physical theory starts to play a key role, that is, natural computation, with, of course, quantum computation as a special case. At this workshop there will be many advocates of this program present, and we are honoured to be part of that community. But there is more. Our joint research is both research on semantics for distributed computing with non-von Neumann architectures, and on the axiomatic foundations of physical theories. This dual character of our work comes without any compromise, and proves to be very fruitful. Computational architectures as toy models for physics. Computer science has something more to offer to the other sciences than the computer. Indeed, on the topic of mathematical and logical un- derstanding of fundamental transdisciplinary scientific concepts such as interaction, concurrency and causality, synchrony and asynchrony, compositional modelling and reasoning, open systems, qualitative versus quantitative reasoning, operational methodologies, continuous versus discrete, hybrid systems etc. computer science is far ahead of many other sciences, due to the challenges arising from the amaz- ing rapidity of the technology change and development it is constantly being confronted with.
    [Show full text]
  • A Fully Abstract Game Semantics for Countable Nondeterminism
    A Fully Abstract Game Semantics for Countable Nondeterminism W. John Gowers1 Computer Science Department, University of Bath Claverton Down Road, Bath. BA2 7QY, United Kingdom [email protected] https://orcid.org/0000-0002-4513-9618 James D. Laird Department of Computer Science, University of Bath Claverton Down Road, Bath. BA2 7QY, United Kingdom [email protected] Abstract The concept of fairness for a concurrent program means that the program must be able to exhibit an unbounded amount of nondeterminism without diverging. Game semantics models of nondeterminism show that this is hard to implement; for example, Harmer and McCusker’s model only admits infinite nondeterminism if there is also the possibility of divergence. We solve a long standing problem by giving a fully abstract game semantics for a simple stateful language with a countably infinite nondeterminism primitive. We see that doing so requires us to keep track of infinitary information about strategies, as well as their finite behaviours. The unbounded nondeterminism gives rise to further problems, which can be formalized as a lack of continuity in the language. In order to prove adequacy for our model (which usually requires continuity), we develop a new technique in which we simulate the nondeterminism using a deterministic stateful construction, and then use combinatorial techniques to transfer the result to the nondeterministic language. Lastly, we prove full abstraction for the model; because of the lack of continuity, we cannot deduce this from definability of compact elements in the usual way, and we have to use a stronger universality result instead.
    [Show full text]
  • Optimizing Authenticated Encryption Algorithms
    Masaryk University Faculty of Informatics Optimizing authenticated encryption algorithms Master’s Thesis Ondrej Mosnáček Brno, Fall 2017 Masaryk University Faculty of Informatics Optimizing authenticated encryption algorithms Master’s Thesis Ondrej Mosnáček Brno, Fall 2017 This is where a copy of the official signed thesis assignment and a copy ofthe Statement of an Author is located in the printed version of the document. Declaration Hereby I declare that this paper is my original authorial work, which I have worked out on my own. All sources, references, and literature used or excerpted during elaboration of this work are properly cited and listed in complete reference to the due source. Ondrej Mosnáček Advisor: Ing. Milan Brož i Acknowledgement I would like to thank my advisor, Milan Brož, for his guidance, pa- tience, and helpful feedback and advice. Also, I would like to thank my girlfriend Ludmila, my family, and my friends for their support and kind words of encouragement. If I had more time, I would have written a shorter letter. — Blaise Pascal iii Abstract In this thesis, we look at authenticated encryption with associated data (AEAD), which is a cryptographic scheme that provides both confidentiality and integrity of messages within a single operation. We look at various existing and proposed AEAD algorithms and compare them both in terms of security and performance. We take a closer look at three selected candidate families of algorithms from the CAESAR competition. Then we discuss common facilities provided by the two most com- mon CPU architectures – x86 and ARM – that can be used to implement cryptographic algorithms efficiently.
    [Show full text]