Author
Yiqun Lisa Yin
Other affiliations: EMC Corporation, RSA
Bio: Yiqun Lisa Yin is an academic researcher from Princeton University. The author has contributed to research in topics: Hash function & Cryptography. The author has an hindex of 20, co-authored 28 publications receiving 3125 citations. Previous affiliations of Yiqun Lisa Yin include EMC Corporation & RSA.
Papers
More filters
••
07 Jul 2008
TL;DR: The computational trade-off between the key schedule and encryption in a block cipher-based hash function is explored and the approach is illustrated with a 256-bit hash function that has a hashing rate equivalent to the encryption rate of AES-128.
Abstract: We present two (related) dedicated hash functions that deliberately borrow heavily from the block ciphers that appeared in the final stages of the AES process. We explore the computational trade-off between the key schedule and encryption in a block cipher-based hash function and we illustrate our approach with a 256-bit hash function that has a hashing rate equivalent to the encryption rate of AES-128. The design extends naturally to a 512-bit hash function.
6 citations
01 Dec 2005
3 citations
••
Johns Hopkins University1, Ruhr University Bochum2, ETH Zurich3, Orange S.A.4, Katholieke Universiteit Leuven5, University of Toronto6, Queensland University of Technology7, University of Hong Kong8, Hewlett-Packard9, University of Salerno10, University of Cincinnati11, Aarhus University12, École Normale Supérieure13, École normale supérieure de Lyon14, University of Cambridge15, Toshiba16, NEC17, IBM18, Spansion19, University of London20, Tokyo Institute of Technology21, Eindhoven University of Technology22, Versailles Saint-Quentin-en-Yvelines University23, University of Connecticut24, Tokai University25, University of California, San Diego26, Banaras Hindu University27, Technical University of Denmark28, Serbian Academy of Sciences and Arts29, Motorola30, Indiana University31, New York University32, Hitachi33, University of Waterloo34, University of Bristol35, Chonnam National University36, Mitsubishi Electric37, German Office for Information Security38, Massachusetts Institute of Technology39, Gemalto40, Dongbei University of Finance and Economics41, Yale University42, Pohang University of Science and Technology43, Alcoa44
TL;DR: Lecture Notes in Computer Science (including subseries Lecture notes in Artificial Intelligence and Lecture note in Bioinformatics) as discussed by the authors, including subseries lecture notes in artificial intelligence and bioinformatism.
Abstract: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) : Preface
3 citations
Cited by
More filters
•
01 Jan 1996TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Abstract: From the Publisher:
A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.
13,597 citations
•
01 Jan 2004
TL;DR: This guide explains the basic mathematics, describes state-of-the-art implementation methods, and presents standardized protocols for public-key encryption, digital signatures, and key establishment, as well as side-channel attacks and countermeasures.
Abstract: After two decades of research and development, elliptic curve cryptography now has widespread exposure and acceptance. Industry, banking, and government standards are in place to facilitate extensive deployment of this efficient public-key mechanism. Anchored by a comprehensive treatment of the practical aspects of elliptic curve cryptography (ECC), this guide explains the basic mathematics, describes state-of-the-art implementation methods, and presents standardized protocols for public-key encryption, digital signatures, and key establishment. In addition, the book addresses some issues that arise in software and hardware implementation, as well as side-channel attacks and countermeasures. Readers receive the theoretical fundamentals as an underpinning for a wealth of practical and accessible knowledge about efficient application. Features & Benefits: * Breadth of coverage and unified, integrated approach to elliptic curve cryptosystems * Describes important industry and government protocols, such as the FIPS 186-2 standard from the U.S. National Institute for Standards and Technology * Provides full exposition on techniques for efficiently implementing finite-field and elliptic curve arithmetic* Distills complex mathematics and algorithms for easy understanding* Includes useful literature references, a list of algorithms, and appendices on sample parameters, ECC standards, and software toolsThis comprehensive, highly focused reference is a useful and indispensable resource for practitioners, professionals, or researchers in computer science, computer engineering, network design, and network data security.
2,893 citations
••
TL;DR: The ANSI X9.62 ECDSA is described and related security, implementation, and interoperability issues are discussed, and the strength-per-key-bit is substantially greater in an algorithm that uses elliptic curves.
Abstract: The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA). It was accepted in 1999 as an ANSI standard and in 2000 as IEEE and NIST standards. It was also accepted in 1998 as an ISO standard and is under consideration for inclusion in some other ISO standards. Unlike the ordinary discrete logarithm problem and the integer factorization problem, no subexponential-time algorithm is known for the elliptic curve discrete logarithm problem. For this reason, the strength-per-key-bit is substantially greater in an algorithm that uses elliptic curves. This paper describes the ANSI X9.62 ECDSA, and discusses related security, implementation, and interoperability issues.
2,092 citations
••
14 Aug 2005TL;DR: This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound, and it is shown that collisions ofSHA-1 can be found with complexityLess than 269 hash operations.
Abstract: In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than 269 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound.
1,600 citations
•
05 Jul 2001
TL;DR: In this paper, a business model for the creation, maintenance, transmission, and use of digital medical records is presented, which allows financial burdens to be reallocated optimally and equitably, resulting in decreased overall societal cost.
Abstract: A method of maintaining digital medical records, comprising a step of receiving a medical transaction record (102), encrypted with a key in accordance with a patient-file association. Also comprising a step of accessing the encrypted medical transaction record according to a patient association with the record (111). And further comprising a step of re-encryption of the encrypted accessed medical transaction record with a key associated with an intended recipient of the medical record. The system and method according to the present invention presents a new business model for creation, maintenance, transmission, and use of medical records. The invention also allows financial burdens to be reallocated optimally and equitably, resulting in decreased overall societal cost and providing a successful business model for a database proprietor. Secure entrusted medical records are held in trust by an independent third party on behalf of the patient (113), and serve the medical community at large. Separately encrypted record elements may be aggregated as an information polymer.
1,457 citations