|
Algebraic Eraser
Algebraic Eraser (AE)Also referred to as the colored Burau key agreement protocol (CBKAP), Anshel–Anshel–Goldfeld–Lemieux key agreement protocol, Algebraic Eraser key agreement protocol (AEKAP), and Algebraic Eraser Diffie–Hellman (AEDH). is an anonymous key agreement protocol that allows two parties, each having an AE public–private key pair, to establish a shared secret over an insecure channel. This shared secret may be directly used as a key, or to derive another key that can then be used to encrypt subsequent communications using a symmetric key cipher. Algebraic Eraser was developed by Iris Anshel, Michael Anshel, Dorian Goldfeld and Stephane Lemieux. SecureRF owns patents covering the protocol and unsuccessfully attempted (as of July 2019) to standardize the protocol as part of ISO/IEC 29167-20, a standard for securing radio-frequency identification devices and wireless sensor networks. Keyset parameters Before two parties can establish a key t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Key Agreement
In cryptography, a key-agreement protocol is a protocol whereby two (or more) parties generate a cryptographic Key (cryptography), key as a function of information provided by each honest party so that no party can predetermine the resulting value. In particular, all honest participants influence the outcome. A key-agreement protocol is a specialisation of a key-exchange protocol. At the completion of the protocol, all parties share the same key. A key-agreement protocol precludes undesired third parties from forcing a key choice on the agreeing parties. A secure key agreement can ensure confidentiality and data integrity in communications systems, ranging from simple messaging applications to complex banking transactions. Secure agreement is defined relative to a security model, for example the Universal Model. More generally, when evaluating protocols, it is important to state security goals and the security model. For example, it may be required for the session key to be Authen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ephemeral Key
A cryptographic key is called ephemeral if it is generated for each execution of a key establishment process. In some cases ephemeral keys are used more than once, within a single session (e.g., in broadcast applications) where the sender generates only one ephemeral key pair per message and the private key is combined separately with each recipient's public key. Contrast with a static key. Private / public ephemeral key agreement key Private (resp. public) ephemeral key agreement keys are the private (resp. public) keys of asymmetric key pairs that are used a single key establishment transaction to establish one or more keys (e.g., key wrapping keys, data encryption keys, or MAC keys) and, optionally, other keying material (e.g., initialization vectors). See also * Cryptographic key types * Session key A session key is a single-use symmetric key used for encrypting all messages in one communication session. A closely related term is content encryption key (CEK), traffic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group-based Cryptography
Group-based cryptography is a use of groups to construct cryptographic primitives. A group is a very general algebraic object and most cryptographic schemes use groups in some way. In particular Diffie–Hellman key exchange uses finite cyclic groups. So the term ''group-based cryptography'' refers mostly to cryptographic protocols that use infinite non-abelian groups such as a braid group. Examples * Shpilrain–Zapata public-key protocols * Magyarik–Wagner public key protocol * Anshel–Anshel–Goldfeld key exchange * Ko–Lee et al. key exchange protocol See also *Non-commutative cryptography Non-commutative cryptography is the area of cryptology where the cryptographic primitives, methods and systems are based on algebraic structures like semigroups, groups and rings which are non-commutative. One of the earliest applications of a non-c ... References * * * * * * Further reading * Paul, Kamakhya; Goswami, Pinkimani; Singh, Madan Mohan. (2022)"ALGEBRAIC BRAID GR ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Anshel–Anshel–Goldfeld Key Exchange
Anshel–Anshel–Goldfeld protocol, also known as a commutator key exchange, is a key-exchange protocol using nonabelian groups. It was invented by Drs. Michael Anshel, Iris Anshel, and Dorian Goldfeld. Unlike other group-based protocols, it does not employ any commuting or commutative subgroups of a given platform group and can use any nonabelian group with efficiently computable normal forms. It is often discussed specifically in application of braid groups, which notably are infinite (and the group elements can take variable quantities of space to represent). The computed shared secret is an element of the group, so in practice this scheme must be accompanied with a sufficiently secure compressive hash function to normalize the group element to a usable bitstring. Description Let G be a fixed nonabelian group called a ''platform group''. Alice's public/private information: * ''Alice's public key'' is a tuple of elements =(a_1,\ldots,a_n) in G. * ''Alice's private key'' i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cryptology EPrint Archive
The Cryptology ePrint Archive is an electronic archive (eprint) of new results in the field of cryptography, maintained by the International Association for Cryptologic Research. It contains articles covering many of the most recent advances in cryptography, that did not necessarily undergo any refereeing process. See also * arXiv arXiv (pronounced as "archive"—the X represents the Chi (letter), Greek letter chi ⟨χ⟩) is an open-access repository of electronic preprints and postprints (known as e-prints) approved for posting after moderation, but not Scholarly pee ... * Electronic Colloquium on Computational Complexity External links * References Cryptography journals Publications with year of establishment missing Eprint archives Open-access archives {{compu-journal-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Message Authentication Code
In cryptography, a message authentication code (MAC), sometimes known as an authentication tag, is a short piece of information used for authentication, authenticating and Data integrity, integrity-checking a message. In other words, it is used to confirm that the message came from the stated sender (its authenticity) and has not been changed (its integrity). The MAC value allows verifiers (who also possess a secret key) to detect any changes to the message content. Terminology The term message integrity code (MIC) is frequently substituted for the term ''MAC'', especially in communications to distinguish it from the use of the latter as ''media access control address'' (''MAC address''). However, some authors use MIC to refer to a message digest, which aims only to uniquely but opaquely identify a single message. RFC 4949 recommends avoiding the term ''message integrity code'' (MIC), and instead using ''checksum'', ''error detection code'', ''hash function, hash'', ''keyed hash'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cryptographic Hash Function
A cryptographic hash function (CHF) is a hash algorithm (a map (mathematics), map of an arbitrary binary string to a binary string with a fixed size of n bits) that has special properties desirable for a cryptography, cryptographic application: * the probability of a particular n-bit output result (hash value) for a random input string ("message") is 2^ (as for any good hash), so the hash value can be used as a representative of the message; * finding an input string that matches a given hash value (a ''pre-image'') is infeasible, ''assuming all input strings are equally likely.'' The ''resistance'' to such search is quantified as security strength: a cryptographic hash with n bits of hash value is expected to have a ''preimage resistance'' strength of n bits, unless the space of possible input values is significantly smaller than 2^ (a practical example can be found in ); * a ''second preimage'' resistance strength, with the same expectations, refers to a similar problem of f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matt Robshaw
Matthew John Barton "Matt" Robshaw is a cryptographer. Formerly a lecturer at Royal Holloway, University of London and a member of the cryptography research group at France Telecom's Orange Labs, he is now a Technical Fellow at Impinj. He coordinated the Symmetric Techniques Virtual Lab (STVL) for ECRYPT. Robshaw's notable work includes the cryptanalysis of a number of cryptographic primitives, including the extension of linear cryptanalysis to use multiple approximations, and the design of the block ciphers Crab and RC6. Robshaw received his Ph.D. in mathematics in 1992 from Royal Holloway, University of London Royal Holloway, University of London (RH), formally incorporated as Royal Holloway and Bedford New College, is a public university, public research university and a constituent college, member institution of the federal University of London. It .... References External links Matt Robshaw's page at Orange Labs Living people Modern cryptographers Alumni of R ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Advances In Applied Mathematics
''Advances in Applied Mathematics'' is a peer-reviewed mathematics journal publishing research on applied mathematics. Its founding editor was Gian-Carlo Rota (Massachusetts Institute of Technology); from 1980 to 1999, Joseph P. S. Kung (University of North Texas) served as managing editor. It is currently published by Elsevier with eight issues per year and edited by Hal Schenck (Auburn University) and Catherine Yan (Texas A&M University). Abstracting and indexing The journal is abstracted and indexed by: * ACM Guide to Computing Literature * CompuMath Citation Index * Current Contents/Physics, Chemical, & Earth Sciences * ''Mathematical Reviews'' * Science Citation Index * Scopus According to the ''Journal Citation Reports'', the journal has a 2020 impact factor The impact factor (IF) or journal impact factor (JIF) of an academic journal is a type of journal ranking. Journals with higher impact factor values are considered more prestigious or important within their fi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Boaz Tsaban
Boaz Tsaban (Hebrew: בועז צבאן; born February 1973) is an Israeli mathematician on the faculty of Bar-Ilan University. His research interests include selection principles within set theory and nonabelian cryptology, within mathematical cryptology. Biography Boaz Tsaban grew up in Or Yehuda, a city near Tel Aviv. At the age of 16 he was selected with other high school students to attend the first cycle of a special preparation program in mathematics, at Bar-Ilan University, being admitted to regular mathematics courses at the University a year later. He completed his B.Sc., M.Sc. and Ph.D. degrees with highest distinctions. Two years as a post-doctoral fellow at Hebrew University were followed by a three-year Koshland Fellowship at the Weizmann Institute of Science before he joined the Department of Mathematics, Bar-Ilan University in 2007. Academic career In the field of selection principles, Tsaban devised the method of omission of intervals for establishing covering ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mina Teicher
Mina Teicher (Hebrew: מינה טייכר) is an Israeli mathematician at Bar-Ilan University, specializing in algebraic geometry. Teicher earned bachelor's, masters, and doctoral degrees from Tel Aviv University in 1974, 1976, and 1981 respectively. Her dissertation, ''Birational Transformation Between 4-folds'', was supervised by Ilya Piatetski-Shapiro. Since 1999, she has directed the Emmy Noether Research Institute for Mathematics at Bar-Ilan University. In 2001–2002 she was the inaugural Emmy Noether Visiting professor at the University of Göttingen, where she lectured about braid groups. She has held leadership roles in academia and science, including serving from 2005 to 2007 as chief scientist at Israel's Ministry of Science and Technology, and chairing the board of governors of the United States – Israel Binational Science Foundation The United States-Israel Binational Science Foundation (BSF) is a grant-awarding institution that promotes collaborative research ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Braid Group Cryptography
Group-based cryptography is a use of groups to construct cryptographic primitives. A group is a very general algebraic object and most cryptographic schemes use groups in some way. In particular Diffie–Hellman key exchange uses finite cyclic groups. So the term ''group-based cryptography'' refers mostly to cryptographic protocols that use infinite non-abelian groups such as a braid group. Examples * Shpilrain–Zapata public-key protocols * Magyarik–Wagner public key protocol * Anshel–Anshel–Goldfeld key exchange * Ko–Lee et al. key exchange protocol See also *Non-commutative cryptography Non-commutative cryptography is the area of cryptology where the cryptographic primitives, methods and systems are based on algebraic structures like semigroups, groups and rings which are non-commutative. One of the earliest applications of a non-c ... References * * * * * * Further reading * Paul, Kamakhya; Goswami, Pinkimani; Singh, Madan Mohan. (2022)"ALGEBRAIC BRAID GR ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |