DOCSLIB.ORG

Program Book

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Program Book WELCOME I wish to welcome you all to New Orleans for the Ninth Annual Winter Meeting of the Society of Urodynamics and Female Urology. Being a native of New Orleans, this is a very special meeting and I am equally excited to welcome you to the “Big Easy!” As in previous years, this meeting includes contributions from the International Society of Pelvic Neuromodulation (ISPiN), the Geriatric Urological Society (GUS) and a stronger basic science component than ever before. Our scientific program remains very topic-oriented, but more case-based discussion is included in the plenary sessions. We will review topics related to basic science, urodynamics, female urology, neuromodulation, IC/PBS, neurogenic bladder and pelvic reconstructive surgery. My program co-chairs, Drs. Quentin Clemens, Toby Chai and Steven Siegel, are honored to present a program, which we are excited about covering, in a format that is educational and more interactive. The meeting begins with a program dedicated to basic science and translational research, which extends over the next one and a half days. We believe the collaboration between clinicians and basic scientists is one of the outstanding and unique aspects of the meeting. Daily breakout sessions in various areas increase the breadth of topics covered and allow for more intimate discussion and sharing of ideas. We will have breakout sessions devoted to urodynamics, prolapse, reconstruction as well as other current topics of interest. From Wednesday through Friday, we will have industry-sponsored symposia over lunch. We hope many of you will take advantage of these successful symposia, remembering that without the sponsorship of industry, the cost of this meeting would be prohibitive. We are very excited about the program but realize that participation from those attending the meeting enhances the educational experience for all. So, in addition to state-of-the-art lectures, podium and poster presentations and breakout sessions, we have allotted time for discussion. Our hotel, the famous, historic Roosevelt Hotel in New Orleans, is one of the architectural icons in this city. It is an outstanding meeting venue, providing luxurious amenities, and is very close to all the famous restaurants and activities for which New Orleans is so popular. Join us for our welcome reception on Wednesday night for drinks and light hors d’oeuvres as you meet with industry partners in the exhibit hall. At the conclusion of the scientific program on Friday, we will have a cocktail reception and award presentations in the exhibit hall. There will be much to do and we will be happy to accommodate your needs. My co-chairs and I are excited for yet another terrific meeting. We hope you enjoy it here in this unforgettable city. J. Christian Winters, MD SUFU Program Chair 1 THANK YOU TO REVIEWERS Due to the large number of abstracts submitted this year, the selection process was done anonymously. We gratefully acknowledge the participation of: Karl-Erik Andersson, MD, PhD Magdy M. Hassouna, MD Jennifer Anger, MD Adonis K. Hijaz, MD Katie N. Ballert, MD Michael J. Kennelly, MD Charles Butrick, MD Kimberly Kenton, MD, MS R. Duane Cespedes, MD Adam P. Klausner, MD Christopher Chermansky, MD Kathleen C. Kobashi, MD Craig V. Comiter, MD Stephen R. Kraus, MD Vivian Cristofaro, PhD Deborah J. Lightner, MD Margot S. Damaser, PhD Paul Pettit, MD Sophie Fletcher, MD Nirit Rosenblum, MD Matthew O. Fraser, PhD Steven W. Siegel, MD Gamal M. Ghoniem, MD John T. Stoffel, MD Tomas Griebling, MD E. James Wright, MD Howard B. Goldman, MD And we thank each reviewer for the timely review of the abstracts and for conforming with the scoring grid: 2012 SUFU Meeting Program Chairs J. Christian Winters, MD J. Quentin Clemens, MD Toby Chai, MD Steven W. Siegel, MD We would also like to thank the 2012 SUFU Essay Competition Reviewers: Angelo E. Gousse, MD (Chair) Elise J.B. De, MD Matthew P. Rutman, MD 2 SCHEDULE AT A GLANCE TUESDAY WEDNESDAY THURSDAY February 28, 2012 February 29, 2012 March 1, 2012 GENERAL SESSION ROOM Waldorf Astoria Ballroom Waldorf Astoria Ballroom Roosevelt Ballroom REGISTRATION OPEN Location: Crescent City 11:00 a.m. – 6:00 p.m. 7:30 a.m. – 6:30 p.m. 7:00 a.m. – 6:00 p.m. Ballroom Foyer EXHIBIT HALL OPEN Location: Crescent City 10:00 a.m. – 3:30 p.m. Ballroom VIDEO VIEWING IN 8:00 a.m. – 4:30 p.m. SPEAKER READY ROOM (Speaker Ready Room Only – 8:00 a.m. – 5:00 p.m. OPEN Video Viewing Not Available) Location: Directors Room 7:00 a.m. Residents and Breakfast Fellows Breakfast Location: Roosevelt 7:30 a.m. Breakfast Location: Ballroom Foyer Location: Waldorf Astoria Chambers I & III Introduction Ballroom Foyer 2011 IC/Painful Bladder Syndrome 8:00 a.m. Welcome 8:30 a.m. IC Painful Bladder Case Presentations 9:00 a.m. Urothelial Regulation of 9:30 a.m. Bladder Function President’s Address 10:00 a.m. Break – Visit Exhibits Break 10:30 a.m. Bladder Remodeling and Effect NIH Sponsored Clinical Trials: Just the Facts 11:00 a.m. on Function 11:30 a.m. Industry Sponsored 12:00 p.m. Lunch Symposium Lunch 12:30 p.m. Location: Conti/Lafitte Room Location: Blue Room 1:00 p.m. How to Make the Bladder 1:30 p.m. Female Urology / Incontinence Podium Session Work After Spinal Cord 2:00 p.m. Injury NIDDK O’Brien Urology Centers Blaivas Lectureship: Break Sensation: A Trip Through Your Bladder 2:30 p.m. Break – Visit Exhibits Advancing Benign Urology 3:00 p.m. Mesenchymal Stem Cells Research Career and SUFU Post Prostatectomy Incontinence Study Development 3:30 p.m. Perception and Modulation of Bladder / Urethral / Pelvic ISPiN I: Update on Expanding Indications for Neuromodulation 4:00 p.m. Regulation of Bladder Floor Sensation Smooth Muscle Break 2. Crash Course on Contractility 3. Robotic Surgery in 4:30 p.m. 1. Basic Urodynamics Neuromodulation for POP Location: Chambers I Bowel Dysfunction Location: Basic Science Poster Session II & III Location: 5:00 p.m. Roosevelt Ballroom Break Location: Waldorf Astoria Conti / Lafitte Basic Science Ballroom 5:30 p.m. Female Urology / Incontinence Male Incontinence / Urodynamics Poster Session I Poster Session Podium Session 6:00 p.m. (with Wine & Cheese) Location: Waldorf Astoria Ballroom Location: Roosevelt Ballroom 6:30 p.m. Location: Waldorf Astoria 7:00 p.m. Ballroom Welcome Reception with 7:30 p.m. Corporate Members 8:00 p.m. Location: Crescent City Ballroom 3 SCHEDULE AT A GLANCE FRIDAY SATURDAY March 2, 2012 March 3, 2012 GENERAL SESSION ROOM Roosevelt Ballroom Roosevelt Ballroom 7:00 a.m. – 12:00 p.m. REGISTRATION OPEN 7:00 a.m. – 6:00 p.m. (Registration desk will be located in the Location: Crescent City Ballroom Foyer Roosevelt Ballroom Foyer on this day only). EXHIBIT HALL OPEN 7:00 a.m. – 3:00 p.m. Location: Crescent City Ballroom SPEAKER READY ROOM OPEN 8:00 a.m. – 5:00 p.m. 8:00 a.m. – 12:00 p.m. Location: Directors Room 7:00 a.m. Breakfast Breakfast 7:30 a.m. Location: Crescent City Ballroom Location: Roosevelt Ballroom Foyer 8:00 a.m. Annual Business Meeting Pelvic Organ Prolapse / IC / Pelvic Pain / 8:30 a.m. Reconstruction Geriatrics / BPH Podium Poster Session Session 9:00 a.m. Male Incontinence / Urodynamics Pelvic Organ Prolapse / Location: Waldorf Location: Roosevelt Moderated Poster Session Reconstruction Podium Session Astoria Ballroom Ballroom Location: Waldorf Astoria Ballroom Location: Roosevelt Ballroom Lapides Award Presentation 9:30 a.m. Prize Essay Winner Presentations 10:00 a.m. Break – Visit Exhibits Contemporary Management of Announcements Neurogenic LUTS 10:30 a.m. ESFFU Lecture: Neurostimulation in Spinal Cord Injury Patients 11:00 a.m. State of the Art: Biologic Graft Materials—Is there a Role in 2012? Urologic Management 11:30 a.m. Industry Sponsored Lunch Symposium 12:00 p.m. Location: Conti/Lafitte Room Adjourn 12:30 p.m. 1:00 p.m. 1:30 p.m. FDA Mesh Warning: Clinical Perspectives 2:00 p.m. 2:30 p.m. Break 3:00 p.m. ISPiN Session II PTNS for Urinary Symptoms 3:30 p.m. Fundamentals of Interstim Programming 4:00 p.m. ISPiN Podium Session 4:30 p.m. 5:00 p.m. 1. Managing Infections 2. Advanced and Prolapse in Older 3. Male Incontinence Urodynamics Females Location: Orpheum 5:30 p.m. Location: Roosevelt Location: Conti / Lafitte Room Ballroom Room 6:00 p.m. 6:30 p.m. Cocktail Hour and Award Presentations 7:00 p.m. Location: Crescent City Ballroom 7: 30 p.m. 4 TABLE OF CONTENTS Page # SUFU 2011 – 2012 Board of Directors ...................................................................................6 Needs and Objectives ............................................................................................................7 CME Accreditation .................................................................................................................7 Industry Sponsored Symposia................................................................................................8 2012 Promotional Partners ....................................................................................................9 2012 Exhibitors and Educational Grant Provider...................................................................10 Hotel Maps .............................................................................................................................11 General Information: Registration, Exhibit Hall and Speaker Ready Room Hours ................15 Mark Your Calendars ..............................................................................................................16 Program Schedule ..................................................................................................................17
Load more

Recommended publications
  • Nasha, Cubehash, SWIFFTX, Skein
    6.857 Homework Problem Set 1 # 1-3 - Open Source Security Model Aleksandar Zlateski Ranko Sredojevic Sarah Cheng March 12, 2009 NaSHA NaSHA was a fairly well-documented submission. Too bad that a collision has already been found. Here are the security properties that they have addressed in their submission: • Pseudorandomness. The paper does not address pseudorandomness directly, though they did show proof of a fairly fast avalanching effect (page 19). Not quite sure if that is related to pseudorandomness, however. • First and second preimage resistance. On page 17, it references a separate document provided in the submission. The proofs are given in the file Part2B4.pdf. The proof that its main transfunction is one-way can be found on pages 5-6. • Collision resistance. Same as previous; noted on page 17 of the main document, proof given in Part2B4.pdf. • Resistance to linear and differential attacks. Not referenced in the main paper, but Part2B5.pdf attempts to provide some justification for this. • Resistance to length extension attacks. Proof of this is given on pages 4-5 of Part2B4.pdf. We should also note that a collision in the n = 384 and n = 512 versions of the hash function. It was claimed that the best attack would be a birthday attack, whereas a collision was able to be produced within 2128 steps. CubeHash According to the author, CubeHash is a very simple cryptographic hash function. The submission does not include almost any of the security details, and for the ones that are included the analysis is very poor. But, for the sake of making this PSet more interesting we will cite some of the authors comments on different security issues.
    [Show full text]
  • Rebound Attack
    Rebound Attack Florian Mendel Institute for Applied Information Processing and Communications (IAIK) Graz University of Technology Inffeldgasse 16a, A-8010 Graz, Austria http://www.iaik.tugraz.at/ Outline 1 Motivation 2 Whirlpool Hash Function 3 Application of the Rebound Attack 4 Summary SHA-3 competition Abacus ECHO Lesamnta SHAMATA ARIRANG ECOH Luffa SHAvite-3 AURORA Edon-R LUX SIMD BLAKE EnRUPT Maraca Skein Blender ESSENCE MCSSHA-3 Spectral Hash Blue Midnight Wish FSB MD6 StreamHash Boole Fugue MeshHash SWIFFTX Cheetah Grøstl NaSHA Tangle CHI Hamsi NKS2D TIB3 CRUNCH HASH 2X Ponic Twister CubeHash JH SANDstorm Vortex DCH Keccak Sarmal WaMM Dynamic SHA Khichidi-1 Sgàil Waterfall Dynamic SHA2 LANE Shabal ZK-Crypt SHA-3 competition Abacus ECHO Lesamnta SHAMATA ARIRANG ECOH Luffa SHAvite-3 AURORA Edon-R LUX SIMD BLAKE EnRUPT Maraca Skein Blender ESSENCE MCSSHA-3 Spectral Hash Blue Midnight Wish FSB MD6 StreamHash Boole Fugue MeshHash SWIFFTX Cheetah Grøstl NaSHA Tangle CHI Hamsi NKS2D TIB3 CRUNCH HASH 2X Ponic Twister CubeHash JH SANDstorm Vortex DCH Keccak Sarmal WaMM Dynamic SHA Khichidi-1 Sgàil Waterfall Dynamic SHA2 LANE Shabal ZK-Crypt The Rebound Attack [MRST09] Tool in the differential cryptanalysis of hash functions Invented during the design of Grøstl AES-based designs allow a simple application of the idea Has been applied to a wide range of hash functions Echo, Grøstl, JH, Lane, Luffa, Maelstrom, Skein, Twister, Whirlpool, ... The Rebound Attack Ebw Ein Efw inbound outbound outbound Applies to block cipher and permutation based
    [Show full text]
  • The Hitchhiker's Guide to the SHA-3 Competition
    History First Second Third The Hitchhiker’s Guide to the SHA-3 Competition Orr Dunkelman Computer Science Department 20 June, 2012 Orr Dunkelman The Hitchhiker’s Guide to the SHA-3 Competition 1/ 33 History First Second Third Outline 1 History of Hash Functions A(n Extremely) Short History of Hash Functions The Sad News about the MD/SHA Family 2 The First Phase of the SHA-3 Competition Timeline The SHA-3 First Round Candidates 3 The Second Round The Second Round Candidates The Second Round Process 4 The Third Round The Finalists Current Performance Estimates The Outcome of SHA-3 Orr Dunkelman The Hitchhiker’s Guide to the SHA-3 Competition 2/ 33 History First Second Third History Sad Outline 1 History of Hash Functions A(n Extremely) Short History of Hash Functions The Sad News about the MD/SHA Family 2 The First Phase of the SHA-3 Competition Timeline The SHA-3 First Round Candidates 3 The Second Round The Second Round Candidates The Second Round Process 4 The Third Round The Finalists Current Performance Estimates The Outcome of SHA-3 Orr Dunkelman The Hitchhiker’s Guide to the SHA-3 Competition 3/ 33 History First Second Third History Sad A(n Extremely) Short History of Hash Functions 1976 Diffie and Hellman suggest to use hash functions to make digital signatures shorter. 1979 Salted passwords for UNIX (Morris and Thompson). 1983/4 Davies/Meyer introduce Davies-Meyer. 1986 Fiat and Shamir use random oracles. 1989 Merkle and Damg˚ard present the Merkle-Damg˚ard hash function.
    [Show full text]
  • NISTIR 7620 Status Report on the First Round of the SHA-3
    NISTIR 7620 Status Report on the First Round of the SHA-3 Cryptographic Hash Algorithm Competition Andrew Regenscheid Ray Perlner Shu-jen Chang John Kelsey Mridul Nandi Souradyuti Paul NISTIR 7620 Status Report on the First Round of the SHA-3 Cryptographic Hash Algorithm Competition Andrew Regenscheid Ray Perlner Shu-jen Chang John Kelsey Mridul Nandi Souradyuti Paul Information Technology Laboratory National Institute of Standards and Technology Gaithersburg, MD 20899-8930 September 2009 U.S. Department of Commerce Gary Locke, Secretary National Institute of Standards and Technology Patrick D. Gallagher, Deputy Director NISTIR 7620: Status Report on the First Round of the SHA-3 Cryptographic Hash Algorithm Competition Abstract The National Institute of Standards and Technology is in the process of selecting a new cryptographic hash algorithm through a public competition. The new hash algorithm will be referred to as “SHA-3” and will complement the SHA-2 hash algorithms currently specified in FIPS 180-3, Secure Hash Standard. In October, 2008, 64 candidate algorithms were submitted to NIST for consideration. Among these, 51 met the minimum acceptance criteria and were accepted as First-Round Candidates on Dec. 10, 2008, marking the beginning of the First Round of the SHA-3 cryptographic hash algorithm competition. This report describes the evaluation criteria and selection process, based on public feedback and internal review of the first-round candidates, and summarizes the 14 candidate algorithms announced on July 24, 2009 for moving forward to the second round of the competition. The 14 Second-Round Candidates are BLAKE, BLUE MIDNIGHT WISH, CubeHash, ECHO, Fugue, Grøstl, Hamsi, JH, Keccak, Luffa, Shabal, SHAvite-3, SIMD, and Skein.
    [Show full text]
  • Finding Bugs in Cryptographic Hash Function Implementations Nicky Mouha, Mohammad S Raunak, D
    1 Finding Bugs in Cryptographic Hash Function Implementations Nicky Mouha, Mohammad S Raunak, D. Richard Kuhn, and Raghu Kacker Abstract—Cryptographic hash functions are security-critical on the SHA-2 family, these hash functions are in the same algorithms with many practical applications, notably in digital general family, and could potentially be attacked with similar signatures. Developing an approach to test them can be par- techniques. ticularly diffcult, and bugs can remain unnoticed for many years. We revisit the NIST hash function competition, which was In 2007, the National Institute of Standards and Technology used to develop the SHA-3 standard, and apply a new testing (NIST) released a Call for Submissions [4] to develop the new strategy to all available reference implementations. Motivated SHA-3 standard through a public competition. The intention by the cryptographic properties that a hash function should was to specify an unclassifed, publicly disclosed algorithm, to satisfy, we develop four tests. The Bit-Contribution Test checks be available worldwide without royalties or other intellectual if changes in the message affect the hash value, and the Bit- Exclusion Test checks that changes beyond the last message bit property restrictions. To allow the direct substitution of the leave the hash value unchanged. We develop the Update Test SHA-2 family of algorithms, the SHA-3 submissions were to verify that messages are processed correctly in chunks, and required to provide the same four message digest lengths. then use combinatorial testing methods to reduce the test set size Chosen through a rigorous open process that spanned eight by several orders of magnitude while retaining the same fault- years, SHA-3 became the frst hash function standard that detection capability.
    [Show full text]
  • Grøstl – a SHA-3 Candidate
    Cryptographic hash functions NIST SHA-3 Competition Grøstl Grøstl – a SHA-3 candidate Krystian Matusiewicz Wroclaw University of Technology CECC 2010, June 12, 2010 Krystian Matusiewicz Grøstl – a SHA-3 candidate 1 / 26 Cryptographic hash functions NIST SHA-3 Competition Grøstl Talk outline ◮ Cryptographic hash functions ◮ NIST SHA-3 Competition ◮ Grøstl Krystian Matusiewicz Grøstl – a SHA-3 candidate 2 / 26 Cryptographic hash functions NIST SHA-3 Competition Grøstl Cryptographic hash functions Krystian Matusiewicz Grøstl – a SHA-3 candidate 3 / 26 Cryptographic hash functions NIST SHA-3 Competition Grøstl Cryptographic hash functions: why? ◮ We want to have a short, fixed length “fingerprint” of any piece of data ◮ Different fingerprints – certainly different data ◮ Identical fingerprints – most likely the same data ◮ No one can get any information about the data from the fingerprint Krystian Matusiewicz Grøstl – a SHA-3 candidate 4 / 26 Cryptographic hash functions NIST SHA-3 Competition Grøstl Random Oracle Construction: ◮ Box with memory ◮ On a new query: pick randomly and uniformly the answer, remember it and return the result ◮ On a repeating query, repeat the answer (function) Krystian Matusiewicz Grøstl – a SHA-3 candidate 5 / 26 Cryptographic hash functions NIST SHA-3 Competition Grøstl Random Oracle Construction: ◮ Box with memory ◮ On a new query: pick randomly and uniformly the answer, remember it and return the result ◮ On a repeating query, repeat the answer (function) Properties: ◮ No information about the data ◮ To find a preimage:
    [Show full text]
  • Hash Function Design Overview of the Basic Components in SHA-3 Competition
    Hash Function Design Overview of the basic components in SHA-3 competition Daniel Joščák [email protected] S.ICZ a.s. Hvězdova 1689/2a, 140 00 Prague 4; Faculty of Mathematics and Physics, Charles University, Prague Abstract In this article we bring an overview of basic building blocks used in the design of new hash functions submitted to the SHA-3 competition. We briefly present the current widely used hash functions MD5, SHA-1, SHA-2 and RIPEMD-160. At the end we consider several properties of the candidates and give an example of candidates that are in SHA-3 competition. Keywords: SHA-3 competition, hash functions. 1 Introduction In 2004 a group of researchers led by Xiaoyun Wang (Shandong University, China) presented real collisions in MD5 and other hash functions at the rump session of Crypto conference and they explained the method in [10]. In 2006 the same group presented a collision attack on SHA–1 in [8] and since then a lot of progress in collision finding algorithms has been made. Although there is no specific reason to believe that a practical attack on any of the SHA–2 family of hash functions is imminent, a successful collision attack on an algorithm in the SHA–2 family could have catastrophic effects for digital signatures. In reaction to this situation the National Institute of Standards and Technology (NIST) created a public competition for a new hash algorithm standard SHA–3 [1]. Except for the obvious requirements of the hash function (i.e. collision resistance, first and second preimage resistance, …) NIST expects SHA–3 to have a security strength that is at least as good as the hash algorithms in the SHA–2 family, and that this security strength will be achieved with significantly improved efficiency.
    [Show full text]
  • Portfolio of Optimized Cryptographic Functions Based on Keccak
    Portfolio of optimized cryptographic functions based on Keccak Guido Bertoni1 Joan Daemen1,2 Michaël Peeters1 Gilles Van Assche1 Ronny Van Keer1 1STMicroelectronics 2Radboud University FOSDEM, Brussels, February 4-5, 2017 1 / 41 Outline 1 Timeline 2 Security foundations 3 Unkeyed applications 4 Keyed applications 5 Keccak code package 6 Inventory 2 / 41 Timeline Outline 1 Timeline 2 Security foundations 3 Unkeyed applications 4 Keyed applications 5 Keccak code package 6 Inventory 3 / 41 Timeline Crisis! 2004: SHA-0 broken (Joux et al.) 2004: MD5 broken (Wang et al.) 2005: practical attack on MD5 (Lenstra et al., and Klima) 2005: SHA-1 theoretically broken (Wang et al.) 2006: SHA-1 broken further (De Cannière and Rechberger) 2007: NIST calls for SHA-3 By Marcel Germain (flickr.com) 4 / 41 Timeline The SHA-3 competition (2008-2012) EDON-R BMW Sgàil LANE Grøstl ZK-Crypt Keccak Maraca NKS2D Hamsi MeshHash MD6 Waterfall StreamHash ECOH EnRUPT Twister Abacus MCSSHA3 WaMM Ponic AURORA Shabal LUX Skein SHAMATA CubeHash CRUNCH Luffa Cheetah DynamicSHA 2 Spectral Hash ECHO DCH Sarmal SIMD ESSENCE SWIFFTX FSB ARIRANG NaSHA Lesamnta Fugue SHAvite-3 SANDstorm BLAKE Blender HASH 2X Tangle Vortex DynamicSHA BOOLE Khichidi-1 JH CHI TIB3 16/06/2009 2005 2006 2007 2008 2009 2010 2011 2012 [courtesy of Christophe De Cannière] 5 / 41 Timeline Our candidate: Keccak Keccak is a sponge function … input output r 0 outer f f f f f f inner c 0 absorbing squeezing … that uses the Keccak-f permutation 6 / 41 Timeline Standardization 2012: Keccak selected by NIST for
    [Show full text]
  • Hash Functions and Gröbner Bases Cryptanalysis
    Rune Steinsmo Ødegård Hash Functions and Gröbner Bases Cryptanalysis Thesis for the degree of Philosophiae Doctor Trondheim, April 2012 Norwegian University of Science and Technology Faculty of Information Technology, Mathematics and Electrical Engineering Department of Telematics NTNU Norwegian University of Science and Technology Thesis for the degree of Philosophiae Doctor Faculty of Information Technology, Mathematics and Electrical Engineering Department of Telematics © Rune Steinsmo Ødegård ISBN 978-82-471-3501-3 (printed ver.) ISBN 978-82-471-3502-0 (electronic ver.) ISSN 1503-8181 Doctoral theses at NTNU, 2012:111 Printed by NTNU-trykk Abstract Hash functions are being used as building blocks in such diverse primitives as commitment schemes, message authentication codes and digital signatures. These primitives have important applications by themselves, and they are also used in the construction of more complex protocols such as electronic voting systems, online auctions, public-key distribution, mutual authentication hand- shakes and more. Part of the work presented in this thesis has contributed to the \SHA-3 contest" for developing the new standard for hash functions orga- nized by the National Institute of Standards and Technology. We constructed the candidate Edon-R, which is a hash function based on quasigroup string transformation. Edon-R was designed to be much more efficient than SHA-2 cryptographic hash functions, while at the same time offering same or better security. Most notably Edon-R was the most efficient hash function submit- ted to the contest. Another contribution to the contest was our cryptanalysis of the second round SHA-3 candidate Hamsi. In our work we studied Hamsi's resistance to differential and higher-order differential cryptanalysis, with focus on the 256-bit version of Hamsi.
    [Show full text]
  • Keccak, More Than Just SHA3SUM
    Keccak, More Than Just SHA3SUM Guido Bertoni1 Joan Daemen1 Michaël Peeters2 Gilles Van Assche1 1STMicroelectronics 2NXP Semiconductors FOSDEM 2013, Brussels, February 2-3, 2013 1 / 36 Outline 1 How it all began 2 Introducing Keccak 3 More than just SHA3SUM 4 Inside Keccak 5 Keccak and the community 2 / 36 How it all began Outline 1 How it all began 2 Introducing Keccak 3 More than just SHA3SUM 4 Inside Keccak 5 Keccak and the community 3 / 36 How it all began Let’s talk about hash functions... ??? These are “hashes” of some sort, but they ain’t hash functions... 4 / 36 How it all began Cryptographic hash functions ∗ h : f0, 1g ! f0, 1gn Input message Digest MD5: n = 128 (Ron Rivest, 1992) SHA-1: n = 160 (NSA, NIST, 1995) SHA-2: n 2 f224, 256, 384, 512g (NSA, NIST, 2001) 5 / 36 How it all began Why should you care? You probably use them several times a day: website authentication, digital signature, home banking, secure internet connections, software integrity, version control software, … 6 / 36 How it all began Breaking news in crypto 2004: SHA-0 broken (Joux et al.) 2004: MD5 broken (Wang et al.) 2005: practical attack on MD5 (Lenstra et al., and Klima) 2005: SHA-1 theoretically broken (Wang et al.) 2006: SHA-1 broken further (De Cannière and Rechberger) 2007: NIST calls for SHA-3 Who answered NIST’s call? 7 / 36 How it all began Keccak Team to the rescue! 8 / 36 How it all began The battlefield EDON-R BMW Sgàil LANE Grøstl ZK-Crypt Keccak Maraca NKS2D Hamsi MeshHash MD6 Waterfall StreamHash ECOH EnRUPT Twister Abacus MCSSHA3 WaMM Ponic
    [Show full text]
  • SHA-3 Hash Competition, Round 1
    History of Round 1 Submission Website: September 2, 2009 Updated comments for: CHI August 3, 2009 Updated comments for: EDON-R July 20, 2009 Added comment for: FSB Updated comments for: Lesamnta July 16, 2009 Added comments for: CubeHash Updated comments for: Lesamnta July 7, 2009 Updated comments for: Lesamnta July 6, 2009 Updated comments for: Blender NaSHA July 2, 2009 Updated comments for: MD6 Added comment for: EnRUPT June 26, 2009 Updated comments for: Lesamnta June 25, 2009 Updated comments for: ESSENCE Added comment for: SHAvite-3 June 16, 2009 Updated comments for: ESSENCE June 10, 2009 Updated comments for: Lesamnta MCSSHA-3 June 3, 2009 Updated comments for: ECOH June 1, 2009 Updated comments for: Lesamnta Vortex Added Submitter’s Website link for: Vortex May 29, 2009 Updated comments for: AURORA Added comments for: Lesamnta May 27, 2009 Updated comments for: CHI EDON-R Added comments for: BLAKE May 12, 2009 Updated comments for: Skein Added Submitter’s Website link for: Shabal May 11, 2009 Updated comments for: CHI Fugue May 7, 2009 Updated comments for: Shabal May 5, 2009 Updated comments for: DynamicSHA TIB3 May 1, 2009 Updated comments for: DynamicSHA April 30, 2009 Updated comments for: Grostl April 28, 2009 Updated comments for: DynamicSHA April 22, 2009 Updated comments for: Cheetah Added Submitter’s Website link for: CHI April 20, 2009 Updated comments for: Blue Midnight Wish Shabal Added Submitter’s Website link for: MD6 April 13, 2009 Updated comments for: LUX Added comments for: ECOH April 9, 2009 Added comments
    [Show full text]
  • The Hitchhiker's Guide to the SHA-3 Competition
    Introduction How SHA-3 The Hitchhiker’s Guide to the SHA-3 Competition Orr Dunkelman Faculty of Mathematics and Computer Science Weizmann Institute of Science October 4th 2010 Orr Dunkelman The Hitchhiker’s Guide to the SHA-3 Competition 1/ 58 Introduction How SHA-3 Outline 1 Introducing Cryptographic Hash Functions What is a Cryptographic Hash Function Security Collision Resistance History of Hash Functions 2 How to Build a Hash Function The Hash Function Cookbook The Merkle-Damg˚ard Construction The Sad News about Merkle-Damg˚ard The MD/SHA Family The SHA-1 Hash Function The Sad News about the MD/SHA Family 3 The SHA-3 Competition The First Phase The Second Round Candidates The Third Round The Outcome of SHA-3 Orr Dunkelman The Hitchhiker’s Guide to the SHA-3 Competition 2/ 58 Introduction How SHA-3 HF Security CR History Outline 1 Introducing Cryptographic Hash Functions What is a Cryptographic Hash Function Security Collision Resistance History of Hash Functions 2 How to Build a Hash Function The Hash Function Cookbook The Merkle-Damg˚ard Construction The Sad News about Merkle-Damg˚ard The MD/SHA Family The SHA-1 Hash Function The Sad News about the MD/SHA Family 3 The SHA-3 Competition The First Phase The Second Round Candidates The Third Round The Outcome of SHA-3 Orr Dunkelman The Hitchhiker’s Guide to the SHA-3 Competition 3/ 58 Introduction How SHA-3 HF Security CR History What is a Cryptographic Hash Function? A hash function is a function that accepts an input of indefinite length, and outputs a digest of fixed length.
    [Show full text]