|
Format-preserving Encryption
In cryptography, format-preserving encryption (FPE), refers to encrypting in such a way that the output (the ciphertext) is in the same format as the input (the plaintext). The meaning of "format" varies. Typically only finite sets of characters are used; numeric, alphabetic or alphanumeric. For example: * Encrypting a 16-digit credit card number so that the ciphertext is another 16-digit number. * Encrypting an English word so that the ciphertext is another English word. * Encrypting an ''n''-bit number so that the ciphertext is another ''n''-bit number (this is the definition of an ''n''-bit block cipher). For such finite domains, and for the purposes of the discussion below, the cipher is equivalent to a permutation of ''N'' integers where ''N'' is the size of the domain. Motivation Restricted field lengths or formats One motivation for using FPE comes from the problems associated with integrating encryption into existing applications, with well-defined data models. A typica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cryptography
Cryptography, or cryptology (from "hidden, secret"; and ''graphein'', "to write", or ''-logy, -logia'', "study", respectively), is the practice and study of techniques for secure communication in the presence of Adversary (cryptography), adversarial behavior. More generally, cryptography is about constructing and analyzing Communication protocol, protocols that prevent third parties or the public from reading private messages. Modern cryptography exists at the intersection of the disciplines of mathematics, computer science, information security, electrical engineering, digital signal processing, physics, and others. Core concepts related to information security (confidentiality, data confidentiality, data integrity, authentication, and non-repudiation) are also central to cryptography. Practical applications of cryptography include electronic commerce, Smart card#EMV, chip-based payment cards, digital currencies, password, computer passwords, and military communications. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Black (cryptographer)
John Richard Black, Jr. is a cryptologist, programmer, and professor of computer science at the University of Colorado Boulder focusing on computer security. He graduated with a BA in computer science from CSU East Bay in 1988 and completed his PhD in cryptography at UC Davis with Phillip Rogaway in 2000. He has taught at CU-Boulder since 2002. Black has been involved in the invention of several cryptographic algorithms including UMAC, PMAC, OCB, and CMAC as well as algorithms related to Format Preserving Encryption. In 2004, he worked with students Martin Cochran and Ryan Gardner to defeat the security mechanisms of the Internet Chess Club The Internet Chess Club (ICC) is a commercial Internet chess server devoted to the play and discussion of chess and chess variants. ICC had over 30,000 subscribing members in 2005. It was the first Internet chess server and was the largest p .... Notes External links * John Black's home page at CU-BouldeFive Questions for Jo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ingenico
Ingenico is a French merchant services technology company, that facilitates secure Electronic Funds Transfer, electronic transactions. The company expanded as a manufacturer of point of sale (POS) payment terminals to also include complete merchant payment Software as a service, SaaS and related services. History Ingenico was founded in France by Jean-Jacques Poutrel and Michel Malhouitre in 1980. It is headquartered in Suresnes, France. In 2008, after the merger resulting in The Ingenium Group, Ingenico closed its R&D centre in Barcelona. This centre developed Ingenico's suite of EFTPOS (Electronic funds transfer at point of sale). In 2008, Ingenico acquired 55% of Fujian Landi, a Chinese EFTPOS vendor. In 2009, Ingenico partnered with its two largest competitors, Hypercom and VeriFone, to found the Secure POS Vendor Alliance, a non-profit organization whose goal is to increase awareness of and improve payment industry security. Ingenico acquired German payment processor Easyc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Éric Brier
Éric Brier is a French cryptographer whose surname has been given to the Brier number and, acronymically with his colleagues Thomas Peyrin and Jacques Stern, the (since deprecated) Format-preserving encryption standard ''BPS'', more formally known as FFP3. He has also given his name to the Brier- Joye ladder. He has worked for the French military procurement agency DGA, at Gemplus in the field of smart cards as a white-hat hacker, and similarly at Gemalto and Ingenico. He has been employed at the Thales Group since July 2020, working largely on quantum cryptography and NIST Post-Quantum Cryptography Standardization As Chief Technology Officer his team's signature-signing scheme Falcon was selected as a standard under the aegis of NIST after a rigorous six-year competition His educational career is as follows: École Polytechnique Engineer (Physics, Mathematics) 19921995 Aix-Marseille University DEA (Discrete Mathematics) 20012002 ENSTA Paris Engineer (Physics, Computer Scie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Peter Gutmann (computer Scientist)
Peter Claus Gutmann is a computer scientist in the Department of Computer Science at the University of Auckland, Auckland, New Zealand. He has a Ph.D. in computer science from the University of Auckland. His Ph.D. thesis and a book based on the thesis were about a cryptographic security architecture. He is interested in computer security issues, including security architecture, security usability (or more usually the lack thereof), and hardware security; he has discovered several flaws in publicly released cryptosystems and protocols. He is the developer of the cryptlib open source software security library and contributed to PGP version 2. In 1994 he developed the Secure FileSystem (SFS). He is also known for his analysis of data deletion on electronic memory media, magnetic and otherwise, and devised the Gutmann method for erasing data from a hard drive more or less securely. These analyses have gained great popularity, although they are based on numerous inaccuracies an ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Federal Information Processing Standard
The Federal Information Processing Standards (FIPS) of the United States are a set of publicly announced standards that the National Institute of Standards and Technology (NIST) has developed for use in computer systems of non-military United States government agencies and contractors. FIPS standards establish requirements for ensuring computer security and interoperability, and are intended for cases in which suitable industry standards do not already exist. Many FIPS specifications are modified versions of standards the technical communities use, such as the American National Standards Institute (ANSI), the Institute of Electrical and Electronics Engineers (IEEE), and the International Organization for Standardization (ISO). Specific areas of FIPS standardization The U.S. government has developed various FIPS specifications to standardize a number of topics including: * Codes, e.g., FIPS county codes or codes to indicate weather conditions or emergency indications. In 1994, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
JPEG 2000
JPEG 2000 (JP2) is an image compression standard and coding system. It was developed from 1997 to 2000 by a Joint Photographic Experts Group committee chaired by Touradj Ebrahimi (later the JPEG president), with the intention of superseding their original JPEG standard (created in 1992), which is based on a discrete cosine transform (DCT), with a newly designed, wavelet-based method. The standardized filename extension is .jp2 for International Organization for Standardization, ISO/International Electrotechnical Commission, IEC 15444-1 conforming files and .jpx for the extended part-2 specifications, published as ISO/IEC 15444-2. The Internet media type, MIME types for JPEG 2000 are defined in RFC 3745. The MIME type for JPEG 2000 (ISO/IEC 15444-1) is image/jp2. The JPEG 2000 project was motivated by Ricoh, Ricoh's submission in 1995 of the CREW (Compression with Reversible Embedded Wavelets) algorithm to the standardization effort of JPEG LS. Ultimately the Lossless JPEG#LOCO-I_a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mihir Bellare
Mihir Bellare is a cryptographer and professor at the University of California San Diego. He holds a Bachelor of Science degree from the California Institute of Technology and a Ph.D. from the Massachusetts Institute of Technology. He has published several seminal papers in the field of cryptography (notably in the area of provable security), many of which were co-written with Phillip Rogaway. Bellare has published a number of papers in the field of Format-Preserving Encryption. His students include Michel Abdalla, Chanathip Namprempre, Tadayoshi Kohno and Anton Mityagin. Bellare is one of the authors of skein. In 2003 Bellare was a recipient of RSA Conference's Sixth Annual Award for outstanding contributions in the field of mathematics for his research in cryptography. In 2013 he became a Fellow of the Association for Computing Machinery. In 2019 he was awarded Levchin Prize for Real-World Cryptography for his outstanding contributions to the design and analysis of real-wor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hasty Pudding Cipher
The Hasty Pudding cipher (HPC) is a variable-block-size block cipher designed by Richard Schroeppel, which was an unsuccessful candidate in the competition for selecting the U.S. Advanced Encryption Standard (AES). It has a number of unusual properties for a block cipher: its input block size and key length are variable, and it includes an additional input parameter called the "spice" for use as a secondary, non-secret key. The Hasty Pudding cipher was the only AES candidate designed exclusively by U.S. cryptographers. The Hasty Pudding cipher is in the public domain, and open source implementations are available. The cipher The Hasty Pudding cipher consists of 5 different sub-ciphers: The Hasty Pudding cipher algorithms all use 64-bit words internally. The cipher is designed to run on 64-bit machines, which can easily perform simple operations on 64-bit words. Key expansion The Hasty Pudding cipher can take a key of any number of bits for any one of the five subciphers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Luhn Algorithm
The Luhn algorithm or Luhn formula (creator: IBM scientist Hans Peter Luhn), also known as the " modulus 10" or "mod 10" algorithm, is a simple check digit formula used to validate a variety of identification numbers. The algorithm is in the public domain and is in wide use today. It is specified in ISO/IEC 7812-1. It is not intended to be a cryptographically secure hash function; it was designed to protect against accidental errors, not malicious attacks. Most credit card numbers and many government identification numbers use the algorithm as a simple method of distinguishing valid numbers from mistyped or otherwise incorrect numbers. Description The check digit is computed as follows: # Drop the check digit from the number (if it's already present). This leaves the payload. # Start with the payload digits. Moving from right to left, double every second digit, starting from the last digit. If doubling a digit results in a value > 9, subtract 9 from it (or sum its digits). # ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Feistel Cipher
In cryptography, a Feistel cipher (also known as Luby–Rackoff block cipher) is a symmetric structure used in the construction of block ciphers, named after the German-born physicist and cryptographer Horst Feistel, who did pioneering research while working for IBM; it is also commonly known as a Feistel network. A large number of block ciphers use the scheme, including the US Data Encryption Standard, the Soviet/Russian GOST and the more recent Blowfish and Twofish ciphers. In a Feistel cipher, encryption and decryption are very similar operations, and both consist of iteratively running a function called a " round function" a fixed number of times. History Many modern symmetric block ciphers are based on Feistel networks. Feistel networks were first seen commercially in IBM's Lucifer cipher, designed by Horst Feistel and Don Coppersmith in 1973. Feistel networks gained respectability when the U.S. Federal Government adopted the DES (a cipher based on Lucifer, with cha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Phillip Rogaway
Phillip Rogaway (also referred to as Phil Rogaway) is an American cryptographer and former professor of computer science at the University of California, Davis. He graduated from Beverly Hills High School, and later earned a BA in computer science from UC Berkeley and completed his PhD in cryptography at MIT, in the Theory of Computation group. He has taught at UC Davis since 1994. He was awarded the Paris Kanellakis Award in 2009 and the first Levchin Prize for Real World Cryptography in 2016. Rogaway received an NSF CAREER award in 1996, which the NSA had attempted to prevent by influencing the NSF. He has been interviewed in multiple media outlets regarding his stance on the ethical obligations that cryptographers and computer scientists have to serve to the public good, specifically in the areas of internet privacy and digital surveillance. Rogaway's papers cover topics including: * CMAC * Concrete security * DES and DES-X * Format-preserving encryption * OCB mode * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
