text stringlengths 16 172k | source stringlengths 32 122 |
|---|---|
Inmathematics,finite field arithmeticisarithmeticin afinite field(afieldcontaining a finite number ofelements) contrary to arithmetic in a field with an infinite number of elements, like the field ofrational numbers.
There are infinitely many different finite fields. Theirnumber of elementsis necessarily of the formpn... | https://en.wikipedia.org/wiki/Finite_field_arithmetic |
Inmathematics, more specificallyabstract algebra, afinite ringis aringthat has a finite number of elements.
Everyfinite fieldis an example of a finite ring, and the additive part of every finite ring is an example of anabelianfinite group, but the concept of finite rings in their own right has a more recent history.
A... | https://en.wikipedia.org/wiki/Finite_ring |
In mathematics,Galois ringsare a type offinitecommutative ringswhich generalize both thefinite fieldsand therings of integers moduloaprime power. A Galois ring is constructed from the ringZ/pnZ{\displaystyle \mathbb {Z} /p^{n}\mathbb {Z} }similar to how a finite fieldFpr{\displaystyle \mathbb {F} _{p^{r}}}is constructe... | https://en.wikipedia.org/wiki/Galois_ring |
Instatisticsandcoding theory, aHamming spaceis usually the set of all2N{\displaystyle 2^{N}}binary stringsof lengthN, where different binary strings are considered to beadjacentwhen they differ only in one position. The total distance between any two binary strings is then the total number of positions at which the cor... | https://en.wikipedia.org/wiki/Hamming_space |
Inmathematics, aquasi-finite field[1]is a generalisation of afinite field. Standardlocal class field theoryusually deals withcomplete valued fieldswhose residue field isfinite(i.e.non-archimedean local fields), but the theory applies equally well when the residue field is only assumed quasi-finite.[2]
Aquasi-finite fi... | https://en.wikipedia.org/wiki/Quasi-finite_field |
Inalgebra, adivision ring, also called askew field(or, occasionally, asfield[1][2]), is anontrivialringin whichdivisionby nonzero elements is defined. Specifically, it is a nontrivial ring[3]in which every nonzero elementahas amultiplicative inverse, that is, an element usually denoteda–1, such thataa–1=a–1a= 1. So, (r... | https://en.wikipedia.org/wiki/Division_ring |
Inmathematics, especially inabstract algebra, aquasigroupis analgebraic structurethat resembles agroupin the sense that "division" is always possible. Quasigroups differ from groups mainly in that theassociativeandidentity elementproperties are optional. In fact, a nonempty associative quasigroup is a group.[1][2]
A q... | https://en.wikipedia.org/wiki/Quasigroup#Algebra |
Inmathematics, especially inabstract algebra, aquasigroupis analgebraic structurethat resembles agroupin the sense that "division" is always possible. Quasigroups differ from groups mainly in that theassociativeandidentity elementproperties are optional. In fact, a nonempty associative quasigroup is a group.[1][2]
A q... | https://en.wikipedia.org/wiki/Loop_(algebra) |
Anauthentication protocolis a type of computercommunications protocolorcryptographic protocolspecifically designed for transfer ofauthenticationdata between two entities. It allows the receiving entity to authenticate the connecting entity (e.g. Client connecting to a Server) as well as authenticate itself to the conne... | https://en.wikipedia.org/wiki/Authentication_protocol |
Anelectronic signature, ore-signature, isdatathat is logically associated with other data and which is used by thesignatoryto sign the associated data.[1][2][3]This type of signature has the same legal standing as a handwritten signature as long as it adheres to the requirements of the specific regulation under which i... | https://en.wikipedia.org/wiki/Electronic_signature |
Authorizationorauthorisation(seespelling differences), ininformation security,computer securityandIAM(Identity and Access Management),[1]is the function of specifying rights/privileges for accessing resources, in most cases through an access policy, and then deciding whether a particularsubjecthas privilege to access a... | https://en.wikipedia.org/wiki/Authorization |
OpenIDis anopen standardanddecentralizedauthenticationprotocolpromoted by the non-profitOpenID Foundation. It allows users to be authenticated by co-operating sites (known asrelying parties, or RP) using a third-party identity provider (IDP) service, eliminating the need forwebmastersto provide their ownad hoclogin sys... | https://en.wikipedia.org/wiki/OpenID |
OTPWis aone-time passwordsystem developed forauthenticationinUnix-likeoperating systemsbyMarkus Kuhn.[1]A user's real password is not directly transmitted across thenetwork. Rather, a series of one-time passwords is created from a short set of characters (constant secret) and a set of one-time tokens. As each single-us... | https://en.wikipedia.org/wiki/OTPW |
OPIEis the initialism of "One time Passwords In Everything".
Opie is amature,Unix-likelogin andpasswordpackage
installed on the server and the client which makes untrusted networks safer against password-sniffingpacket-analysissoftware likedSniffand safe againstshoulder surfing.
It works by circumventing the delayed ... | https://en.wikipedia.org/wiki/OPIE_Authentication_System |
ThePGP Word List("Pretty Good Privacyword list", also called abiometric word listfor reasons explained below) is a list ofwordsfor conveying databytesin a clear unambiguous way via a voice channel. They are analogous in purpose to theNATO phonetic alphabet, except that a longer list of words is used, each word correspo... | https://en.wikipedia.org/wiki/Biometric_word_list |
Incryptography, theavalanche effectis the desirable property of cryptographicalgorithms, typically block ciphers[1]andcryptographic hash functions, wherein if an input is changed slightly (for example, flipping a single bit), the output changes significantly (e.g., half the output bits flip). In the case of high-qualit... | https://en.wikipedia.org/wiki/Avalanche_effect |
The following tables compare general and technical information for a number of cryptographic hash functions. See the individual functions' articles for further information. This article is not all-inclusive or necessarily up-to-date. An overview of hash function security/cryptanalysiscan be found athash function securi... | https://en.wikipedia.org/wiki/Comparison_of_cryptographic_hash_functions |
Incryptographic protocoldesign,cryptographic agilityorcrypto-agilityis the ability to switch between multiplecryptographic primitives.
A cryptographically agile system implementing a particular standard can choose which combination of primitives to use. The primary goal of cryptographic agility is to enable rapid adap... | https://en.wikipedia.org/wiki/Cryptographic_agility |
CRYPTRECis theCryptography Research and Evaluation Committeesset up by theJapanese Governmentto evaluate and recommendcryptographictechniques for government and industrial use. It is comparable in many respects to theEuropean Union'sNESSIEproject and to theAdvanced Encryption Standard processrun byNational Institute of... | https://en.wikipedia.org/wiki/CRYPTREC |
File fixityis adigital preservationterm referring to the property of a digital file being fixed, or unchanged.[1]Fixity checking is the process of verifying that a digital object has not been altered or corrupted.[2]During transfer, a repository may run a fixity check to ensure a transmitted file has not been altered e... | https://en.wikipedia.org/wiki/File_fixity |
Ahash chainis the successive application of acryptographic hash functionto a piece of data. Incomputer security, a hash chain is a method used to produce manyone-time keysfrom a singlekeyorpassword. Fornon-repudiation, a hash function can be applied successively to additional pieces of data in order to record the chro... | https://en.wikipedia.org/wiki/Hash_chain |
Incryptographyandcomputer security, alength extension attackis a type ofattackwhere an attacker can useHash(message1) and the length ofmessage1to calculateHash(message1‖message2) for an attacker-controlledmessage2, without needing to know the content ofmessage1. This is problematic when thehashis used as amessage auth... | https://en.wikipedia.org/wiki/Length_extension_attack |
Incryptography,MD5CRKwas avolunteer computingeffort (similar todistributed.net) launched by Jean-Luc Cooke and his company, CertainKey Cryptosystems, to demonstrate that theMD5message digestalgorithmis insecure by finding acollision– two messages that produce the same MD5 hash. The project went live on March 1, 2004. ... | https://en.wikipedia.org/wiki/MD5CRK |
NESSIE(New European Schemes for Signatures, Integrity and Encryption) was aEuropeanresearch project funded from 2000 to 2003 to identify securecryptographicprimitives. The project was comparable to theNISTAES processand the Japanese Government-sponsoredCRYPTRECproject, but with notable differences from both. In particu... | https://en.wikipedia.org/wiki/NESSIE |
Incryptography, arandom oracleis anoracle(a theoreticalblack box) that responds to everyunique querywith a (truly)randomresponse chosenuniformlyfrom its output domain. If a query is repeated, it responds thesame wayevery time that query is submitted.
Stated differently, a random oracle is amathematical functionchosen ... | https://en.wikipedia.org/wiki/Random_oracle |
Incryptography,cryptographic hash functionscan be divided into two main categories. In the first category are those functions whose designs are based on mathematical problems, and whose security thus follows from rigorous mathematical proofs,complexity theoryandformal reduction. These functions are calledprovably secur... | https://en.wikipedia.org/wiki/Security_of_cryptographic_hash_functions |
SHA-3(Secure Hash Algorithm 3) is the latest[4]member of theSecure Hash Algorithmfamily of standards, released byNISTon August 5, 2015.[5][6][7]Although part of the same series of standards, SHA-3 is internally different from theMD5-likestructureofSHA-1andSHA-2.
SHA-3 is a subset of the broader cryptographic primitive... | https://en.wikipedia.org/wiki/SHA-3 |
Incryptographyauniversal one-way hash function(UOWHF, often pronounced "woof") is a type ofuniversal hash functionof particular importance tocryptography. UOWHFs are proposed as an alternative tocollision-resistant hash functions(CRHFs). CRHFs have a strong collision-resistance property: that it is hard, given randomly... | https://en.wikipedia.org/wiki/Universal_one-way_hash_function |
Google Authenticatoris a software-basedauthenticatorbyGoogle. It implementsmulti-factor authenticationservices using thetime-based one-time password(TOTP; specified in RFC 6238) andHMAC-based one-time password(HOTP; specified in RFC 4226), for authenticating users of software applications.[5]
When logging into a site ... | https://en.wikipedia.org/wiki/Google_Authenticator |
FreeOTPis afree and open-sourceauthenticatorbyRedHat. It implementsmulti-factor authenticationusingHOTPandTOTP.Tokenscan be added by scanning aQR codeor by manually entering the token configuration. It is licensed under theApache 2.0 license, and supportsAndroidandiOS.[4][5][6]
This mobile software article is astub. Y... | https://en.wikipedia.org/wiki/FreeOTP |
Initiative for Open Authentication(OATH) is an industry-wide collaboration to develop an openreference architectureusingopen standardsto promote the adoption of strong authentication. It has close to thirty coordinating and contributing members and is proposing standards for a variety of authentication technologies, wi... | https://en.wikipedia.org/wiki/Initiative_For_Open_Authentication |
KYPS(Keep Your Password Secret) is a free web-basedservicethat enables users to log into websites, which usually require a username/password combination, usingone-time passwords. The main difference between KYPS and similarpassword managementtechnologies is that the password is never disclosed to the local computer. Th... | https://en.wikipedia.org/wiki/KYPS |
Incryptology, acodeis a method used toencryptamessagethat operates at the level of meaning; that is, words or phrases are converted into something else. A code might transform "change" into "CVGDK" or "cocktail lounge". The U.S.National Security Agencydefined a code as "A substitution cryptosystem in which the plaintex... | https://en.wikipedia.org/wiki/Code_(cryptography)#One-time_code |
Apersonal identification number(PIN; sometimesredundantlyaPIN codeorPIN number) is a numeric (sometimes alpha-numeric)passcodeused in the process of authenticating a user accessing a system.
The PIN has been the key to facilitating theprivate dataexchange between different data-processing centers in computer networks ... | https://en.wikipedia.org/wiki/Personal_identification_number |
AQR code,quick-response code,[1]is a type oftwo-dimensionalmatrix barcodeinvented in 1994 byMasahiro HaraofJapanesecompanyDenso Wavefor labelling automobile parts.[2][3]It features black squares on a white background withfiducial markers, readable by imaging devices like cameras, and processed usingReed–Solomon error c... | https://en.wikipedia.org/wiki/QR_Code |
S/KEYis aone-time passwordsystem developed forauthenticationtoUnix-likeoperating systems, especially fromdumb terminalsor untrusted public computers on which one does not want to type a long-term password. A user's real password is combined in an offline device with a short set of characters and a decrementing counter ... | https://en.wikipedia.org/wiki/S/KEY |
Asecurity tokenis aperipheral deviceused to gain access to an electronically restricted resource. The token is used in addition to, or in place of, apassword.[1]Examples of security tokens include wirelesskey cardsused to open locked doors, a banking token used as a digital authenticator for signing in toonline banking... | https://en.wikipedia.org/wiki/Security_token |
Time-based one-time password(TOTP) is a computer algorithm that generates a one-time password (OTP) using the current time as a source of uniqueness. As an extension of the HMAC-based one-time password algorithm HOTP, it has been adopted as Internet Engineering Task Force (IETF) standardRFC6238.[1]
TOTP is the corners... | https://en.wikipedia.org/wiki/Time-based_one-time_password_algorithm |
Multi-factor authentication(MFA;two-factor authentication, or2FA) is anelectronic authenticationmethod in which a user is granted access to awebsiteorapplicationonly after successfully presenting two or more distinct types of evidence (orfactors) to anauthenticationmechanism. MFA protectspersonal data—which may include... | https://en.wikipedia.org/wiki/Two-factor_authentication |
Inmathematicsandabstract algebra,group theorystudies thealgebraic structuresknown asgroups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such asrings,fields, andvector spaces, can all be seen as groups endowed with additionaloperationsandaxioms. Groups recur throughout m... | https://en.wikipedia.org/wiki/List_of_group_theory_topics |
Inmathematics, agroupis asetwith abinary operationthat satisfies the following constraints: the operation isassociative, it has anidentity element, and every element of the set has aninverse element.
Manymathematical structuresare groups endowed with other properties. For example, theintegerswith theaddition operation... | https://en.wikipedia.org/wiki/Examples_of_groups |
Bass–Serre theoryis a part of themathematicalsubject ofgroup theorythat deals with analyzing the algebraic structure ofgroupsactingby automorphisms on simplicialtrees. The theory relates group actions on trees with decomposing groups as iterated applications of the operations offree product with amalgamationandHNN exte... | https://en.wikipedia.org/wiki/Bass-Serre_theory |
Inmathematics, specificallyabstract algebra, theisomorphism theorems(also known asNoether's isomorphism theorems) aretheoremsthat describe the relationship amongquotients,homomorphisms, andsubobjects. Versions of the theorems exist forgroups,rings,vector spaces,modules,Lie algebras, and otheralgebraic structures. Inu... | https://en.wikipedia.org/wiki/Noether_isomorphism_theorem |
Inmathematics, theBoolean prime ideal theoremstates thatidealsin aBoolean algebracan be extended toprime ideals. A variation of this statement forfilters on setsis known as theultrafilter lemma. Other theorems are obtained by considering different mathematical structures with appropriate notions of ideals, for example,... | https://en.wikipedia.org/wiki/Boolean_prime_ideal_theorem |
Inmathematics,ideal theoryis the theory ofidealsincommutative rings. While the notion of an ideal exists also fornon-commutative rings, a much more substantial theory exists only for commutative rings (and this article therefore only considers ideals in commutative rings.)
Throughout the articles, rings refer to commu... | https://en.wikipedia.org/wiki/Ideal_theory |
Inmathematicalorder theory, anidealis a special subset of apartially ordered set(poset). Although this term historically was derived from the notion of aring idealofabstract algebra, it has subsequently been generalized to a different notion. Ideals are of great importance for many constructions in order andlattice the... | https://en.wikipedia.org/wiki/Ideal_(order_theory) |
Incommutative algebra, thenorm of an idealis a generalization of anormof an element in thefield extension. It is particularly important innumber theorysince it measures the size of anidealof a complicatednumber ringin terms of anidealin a less complicatedring. When the less complicated number ring is taken to be therin... | https://en.wikipedia.org/wiki/Ideal_norm |
Inmathematics, the interplay between theGalois groupGof aGalois extensionLof anumber fieldK, and the way theprime idealsPof thering of integersOKfactorise as products of prime ideals ofOL, provides one of the richest parts ofalgebraic number theory. Thesplitting of prime ideals in Galois extensionsis sometimes attribut... | https://en.wikipedia.org/wiki/Splitting_of_prime_ideals_in_Galois_extensions |
Inalgebraic geometryand other areas ofmathematics, anideal sheaf(orsheaf of ideals) is the global analogue of anidealin aring. The ideal sheaves on a geometric object are closely connected to its subspaces.
LetXbe atopological spaceandAasheafof rings onX. (In other words,(X,A)is aringed space.) An ideal sheafJinAis as... | https://en.wikipedia.org/wiki/Ideal_sheaf |
Ingroup theory, a subfield ofabstract algebra, acycle graphof agroupis anundirected graphthat illustrates the variouscyclesof that group, given a set ofgeneratorsfor the group. Cycle graphs are particularly useful in visualizing the structure of smallfinite groups.
A cycle is thesetof powers of a given group elementa,... | https://en.wikipedia.org/wiki/Cycle_graph_(group) |
Inmathematics, more specifically inring theory, acyclic moduleormonogenous module[1]is amodule over a ringthat is generated by one element. The concept is a generalization of the notion of acyclic group, that is, anAbelian group(i.e.Z-module) that is generated by one element.
A leftR-moduleMis calledcyclicifMcan be g... | https://en.wikipedia.org/wiki/Cyclic_module |
Incombinatorial mathematics,cyclic sievingis a phenomenon in which an integerpolynomialevaluated at certainroots of unitycounts the rotational symmetries of afinite set.[1]Given a family of cyclic sieving phenomena, the polynomials give aq-analoguefor the enumeration of the sets, and often arise from an underlying alge... | https://en.wikipedia.org/wiki/Cyclic_sieving |
Ring homomorphisms
Algebraic structures
Related structures
Algebraic number theory
Noncommutative algebraic geometry
Free algebra
Clifford algebra
In mathematics, specifically ingroup theory, thePrüferp-groupor thep-quasicyclic grouporp∞-group,Z(p∞), for aprime numberpis the uniquep-groupin which every element h... | https://en.wikipedia.org/wiki/Pr%C3%BCfer_group |
Inmathematics, thecircle group, denoted byT{\displaystyle \mathbb {T} }orS1{\displaystyle \mathbb {S} ^{1}}, is themultiplicative groupof allcomplex numberswithabsolute value1, that is, theunit circlein thecomplex planeor simply theunit complex numbers[1]T={z∈C:|z|=1}.{\displaystyle \mathbb {T} =\{z\in \mathbb {C} :|... | https://en.wikipedia.org/wiki/Circle_group |
Intopology, aclopen set(aportmanteauofclosed-open set) in atopological spaceis a set which is bothopenandclosed. That this is possible may seem counterintuitive, as the common meanings ofopenandclosedare antonyms, but their mathematical definitions are notmutually exclusive. A set is closed if itscomplementis open, w... | https://en.wikipedia.org/wiki/Clopen_set |
Inmathematics, more specifically intopology, anopen mapis afunctionbetween twotopological spacesthat mapsopen setsto open sets.[1][2][3]That is, a functionf:X→Y{\displaystyle f:X\to Y}is open if for any open setU{\displaystyle U}inX,{\displaystyle X,}theimagef(U){\displaystyle f(U)}is open inY.{\displaystyle Y.}Likewis... | https://en.wikipedia.org/wiki/Closed_map |
Inmathematical analysis, adomainorregionis anon-empty,connected, andopen setin atopological space. In particular, it is any non-empty connected opensubsetof thereal coordinate spaceRnor thecomplex coordinate spaceCn. A connected open subset ofcoordinate spaceis frequently used for thedomain of a function.[1]
The basic... | https://en.wikipedia.org/wiki/Closed_region |
Inmathematics, anopen setis ageneralizationof anopen intervalin thereal line.
In ametric space(asetwith adistancedefined between every two points), an open set is a set that, with every pointPin it, contains all points of the metric space that are sufficiently near toP(that is, all points whose distance toPis less tha... | https://en.wikipedia.org/wiki/Open_set |
Intopologyand related areas ofmathematics, aneighbourhood(orneighborhood) is one of the basic concepts in atopological space. It is closely related to the concepts ofopen setandinterior. Intuitively speaking, a neighbourhood of a point is asetof points containing that point where one can move some amount in any directi... | https://en.wikipedia.org/wiki/Neighbourhood_(mathematics) |
Inmathematical analysis, adomainorregionis anon-empty,connected, andopen setin atopological space. In particular, it is any non-empty connected opensubsetof thereal coordinate spaceRnor thecomplex coordinate spaceCn. A connected open subset ofcoordinate spaceis frequently used for thedomain of a function.[1]
The basic... | https://en.wikipedia.org/wiki/Region_(mathematics) |
A subsetS{\displaystyle S}of atopological spaceX{\displaystyle X}is called aregular open setif it is equal to theinteriorof itsclosure; expressed symbolically, ifInt(S¯)=S{\displaystyle \operatorname {Int} ({\overline {S}})=S}or, equivalently, if∂(S¯)=∂S,{\displaystyle \partial ({\overline {S}})=\partial S,}whereIntS... | https://en.wikipedia.org/wiki/Regular_closed_set |
Inmathematics, in the field ofalgebraic number theory, anS-unitgeneralises the idea ofunitof thering of integersof the field. Many of the results which hold for units are also valid forS-units.
LetKbe anumber fieldwith ring of integersR. LetSbe a finite set ofprime idealsofR. An elementxofKis anS-unit if theprincipa... | https://en.wikipedia.org/wiki/S-units |
Incommutative algebraandalgebraic geometry,localizationis a formal way to introduce the "denominators" to a givenringormodule. That is, it introduces a new ring/module out of an existing ring/moduleR, so that it consists offractionsms,{\displaystyle {\frac {m}{s}},}such that thedenominatorsbelongs to a given subsetSofR... | https://en.wikipedia.org/wiki/Localization_of_a_ring_and_a_module |
Incryptography, theTiny Encryption Algorithm(TEA) is ablock ciphernotable for its simplicity of description andimplementation, typically a few lines of code. It was designed byDavid WheelerandRoger Needhamof theCambridge Computer Laboratory; it was first presented at theFast Software Encryptionworkshop inLeuvenin 1994... | https://en.wikipedia.org/wiki/Tiny_Encryption_Algorithm |
Incryptography,XTEA(eXtended TEA) is ablock cipherdesigned to correct weaknesses inTEA. Thecipher's designers wereDavid WheelerandRoger Needhamof theCambridge Computer Laboratory, and the algorithm was presented in an unpublished technical report in 1997 (Needham and Wheeler, 1997). It is not subject to anypatents.[1]
... | https://en.wikipedia.org/wiki/XTEA |
Incryptography,Corrected Block TEA(often referred to asXXTEA) is ablock cipherdesigned to correct weaknesses in the originalBlock TEA.[2][3]
XXTEA is vulnerable to achosen-plaintext attackrequiring 259queries and negligible work. See cryptanalysis below.
Thecipher's designers wereRoger NeedhamandDavid Wheelerof theCa... | https://en.wikipedia.org/wiki/XXTEA |
CipherSaberis a simplesymmetric encryptionprotocolbased on theRC4stream cipher. Its goals are both technical andpolitical: it gives reasonably strong protection of message confidentiality, yet it's designed to be simple enough that even noviceprogrammerscan memorize the algorithm and implement it from scratch. Accord... | https://en.wikipedia.org/wiki/CipherSaber |
This article summarizes publicly knownattacksagainstcryptographic hash functions. Note that not all entries may be up to date. For a summary of other hash function parameters, seecomparison of cryptographic hash functions.
Hashes described here are designed for fast computation and have roughly similar speeds.[31]Beca... | https://en.wikipedia.org/wiki/Hash_function_security_summary |
TheInternational Association for Cryptologic Research(IACR) is a non-profit scientific organization that furthers research incryptologyand related fields. The IACR was organized at the initiative ofDavid Chaumat the CRYPTO '82 conference.[1]
The IACR organizes and sponsors three annual flagshipconferences, four area c... | https://en.wikipedia.org/wiki/International_Association_for_Cryptologic_Research |
TheSecure Hash Algorithmsare a family ofcryptographic hash functionspublished by theNational Institute of Standards and Technology(NIST) as aU.S.Federal Information Processing Standard(FIPS), including:
The corresponding standards areFIPSPUB 180 (original SHA), FIPS PUB 180-1 (SHA-1), FIPS PUB 180-2 (SHA-1, SHA-256, S... | https://en.wikipedia.org/wiki/Secure_Hash_Standard |
HashClashwas avolunteer computingproject running on theBerkeley Open Infrastructure for Network Computing (BOINC)software platform to findcollisionsin theMD5hash algorithm.[1]It was based at Department ofMathematicsandComputer Scienceat theEindhoven University of Technology, andMarc Stevensinitiated the project as part... | https://en.wikipedia.org/wiki/HashClash |
cryptis aPOSIX C libraryfunction. It is typically used to compute thehashof user account passwords. The function outputs a text string which alsoencodesthesalt(usually the first two characters are the salt itself and the rest is the hashed result), and identifies the hash algorithm used (defaulting to the "traditional"... | https://en.wikipedia.org/wiki/Crypt_(C)#MD5-based_scheme |
md5deepis asoftwarepackage used in thecomputer security,system administrationandcomputer forensicscommunities to run large numbers offilesthrough any of several differentcryptographicdigests. It was originally authored by Jesse Kornblum, at the time a special agent of theAir Force Office of Special Investigations. As o... | https://en.wikipedia.org/wiki/Md5deep |
md5sumis acomputer programthat calculates and verifies 128-bitMD5hashes, as described in RFC 1321. The MD5 hash functions as a compact digital fingerprint of a file. As with all such hashing algorithms, there is theoretically an unlimited number of files that will have any given MD5 hash. However, it is very unlikely t... | https://en.wikipedia.org/wiki/Md5sum |
TheMD6 Message-Digest Algorithmis acryptographic hash function. It uses aMerkle tree-like structure to allow for immense parallel computation of hashes for very long inputs. Authors claim a performance of 28cycles per bytefor MD6-256 on anIntel Core 2 Duoand provable resistance againstdifferential cryptanalysis.[3]Thes... | https://en.wikipedia.org/wiki/MD6 |
Pseudo-collision attack against up to 46 rounds of SHA-256.[2]
SHA-2(Secure Hash Algorithm 2) is a set ofcryptographic hash functionsdesigned by the United StatesNational Security Agency(NSA) and first published in 2001.[3][4]They are built using theMerkle–Damgård construction, from a one-way compression function itse... | https://en.wikipedia.org/wiki/SHA-2 |
TheMD2 Message-Digest Algorithmis acryptographic hash functiondeveloped byRonald Rivestin 1989.[2]The algorithm is optimized for8-bitcomputers. MD2 is specified inIETF RFC1319.[3]The "MD" in MD2 stands for "Message Digest".
Even though MD2 is not yet fully compromised, the IETF retired MD2 to "historic" status in 2011... | https://en.wikipedia.org/wiki/MD2_(cryptography) |
TheIntercontinental Dictionary Series(commonly abbreviated asIDS) is a large database of topical vocabulary lists in various world languages. The general editor of the database isBernard Comrieof theMax Planck Institute for Evolutionary Anthropology,Leipzig. Mary Ritchie Key of theUniversity of California, Irvineis the... | https://en.wikipedia.org/wiki/Intercontinental_Dictionary_Series |
Incryptography,key stretchingtechniques are used to make a possibly weak key, typically a password orpassphrase, more secure against abrute-force attackby increasing the resources (time and possibly space) it takes to test each possible key. Passwords or passphrases created by humans are often short or predictable eno... | https://en.wikipedia.org/wiki/Key_stretching |
Password strengthis a measure of the effectiveness of apasswordagainst guessing orbrute-force attacks. In its usual form, it estimates how many trials an attacker who does not have direct access to the password would need, on average, to guess it correctly. The strength of a password is a function of length, complexity... | https://en.wikipedia.org/wiki/Password_strength |
Keystroke logging, often referred to askeyloggingorkeyboard capturing, is the action of recording (logging) the keys struck on akeyboard,[1][2]typically covertly, so that a person using the keyboard is unaware that their actions are being monitored. Data can then be retrieved by the person operating the logging program... | https://en.wikipedia.org/wiki/Keystroke_logging |
Apassphraseis a sequence of words or other text used to control access to acomputersystem, program ordata. It is similar to apasswordin usage, but a passphrase is generally longer for added security. Passphrases are often used to control both access to, and the operation of,cryptographicprograms and systems, especially... | https://en.wikipedia.org/wiki/Passphrase |
Phishingis a form ofsocial engineeringand ascamwhere attackers deceive people into revealingsensitive information[1]or installingmalwaresuch asviruses,worms,adware, orransomware. Phishing attacks have become increasingly sophisticated and often transparently mirror the site being targeted, allowing the attacker to obse... | https://en.wikipedia.org/wiki/Phishing |
Vulnerabilitiesare flaws or weaknesses in a system's design, implementation, or management that can be exploited by a malicious actor to compromise its security.
Despite intentions to achieve complete correctness, virtually all hardware and software contain bugs where the system does not behave as expected. If the bug... | https://en.wikipedia.org/wiki/Vulnerability_(computing) |
AS5678is a requirements specification created bySAE Internationalfor the production and test of passive onlyRadio Frequency Identification(RFID) tags for the Aerospace industry. This specification is also related to the Air Transportation Association SPEC2000 specification.
RFID tags are small devices that are used b... | https://en.wikipedia.org/wiki/AS5678 |
Abalise(/bəˈliːz/bə-LEEZ) is an electronicbeaconortransponderplaced between therailsof a railway as part of anautomatic train protection(ATP) system. TheFrenchwordbaliseis used to distinguish these beacons from other kinds of beacons.[1]
Balises are used in theKVBsignalling system installed on main lines of the French... | https://en.wikipedia.org/wiki/Balise |
The term "bin bug" was coined in August 2006 by theBritish mediato refer to the use ofRadio Frequency Identification(RFID) chips by some local councils to monitor the amount ofdomestic wastecreated by each household. The system works by having a unique RFID chip for each household's non-recyclingwheelie bin(such househ... | https://en.wikipedia.org/wiki/Bin_bug |
Acampus credential, more commonly known as acampus cardor acampus ID cardis anidentification documentcertifying the status of aneducational institution's students, faculty, staff or other constituents as members of the institutional community and eligible for access to services and resources. Campus credentials are typ... | https://en.wikipedia.org/wiki/Campus_card |
Chipless RFIDtags areRFIDtags that do not require amicrochipin the transponder.
RFIDs offer longer range and ability to be automated, unlike barcodes that require a human operator for interrogation. The main challenge to their adoption is the cost of RFIDs. The design and fabrication ofASICsneeded for RFID are the maj... | https://en.wikipedia.org/wiki/Chipless_RFID |
FASTagis anelectronic toll collectionsystem inIndia, operated by theNational Highways Authority of India(NHAI).[3][4]It employsRadio Frequency Identification(RFID) technology for making toll payments directly from the prepaid or savings account linked to it or directly toll owner. It is affixed on the windscreen of the... | https://en.wikipedia.org/wiki/FASTag |
Internet of things(IoT) describes devices withsensors, processing ability,softwareand othertechnologiesthat connect and exchange data with other devices and systems over theInternetor other communication networks.[1][2][3][4][5]The IoT encompasseselectronics,communication, andcomputer scienceengineering. "Internet of t... | https://en.wikipedia.org/wiki/Internet_of_Things |
Mass surveillanceis the intricatesurveillanceof an entire or a substantial fraction of a population in order to monitor that group of citizens.[1]The surveillance is often carried out bylocalandfederal governmentsorgovernmental organizations, but it may also be carried out by corporations (either on behalf of governmen... | https://en.wikipedia.org/wiki/Mass_surveillance |
Ahumanmicrochip implantis any electronic device implanted subcutaneously (subdermally) usually via an injection. Examples include an identifyingintegrated circuitRFID device encased insilicate glasswhich is implanted in the body of a human being. This type ofsubdermal implantusually contains a uniqueID numberthat can b... | https://en.wikipedia.org/wiki/Microchip_implant_(human) |
Mobile RFID(M-RFID) are services that provide information on objects equipped with anRFID tagover a telecommunication network.[1]The reader or interrogator can be installed in a mobile device such as amobile phoneor PDA.[2]
Unlike ordinary fixed RFID, mobile RFID readers are mobile, and the tags fixed, instead of the ... | https://en.wikipedia.org/wiki/Mobile_RFID |
Near-field communication(NFC) is a set ofcommunication protocolsthat enablescommunicationbetween two electronic devices over a distance of4 cm (1+1⁄2in) or less.[1]NFC offers a low-speed connection through a simple setup that can be used for thebootstrappingof capable wireless connections.[2]Like otherproximity cardtec... | https://en.wikipedia.org/wiki/Near_Field_Communication |
Ahumanmicrochip implantis any electronic device implanted subcutaneously (subdermally) usually via an injection. Examples include an identifyingintegrated circuitRFID device encased insilicate glasswhich is implanted in the body of a human being. This type ofsubdermal implantusually contains a uniqueID numberthat can b... | https://en.wikipedia.org/wiki/PositiveID |
Privacy by designis an approach tosystems engineeringinitially developed byAnn Cavoukianand formalized in a joint report onprivacy-enhancing technologiesby a joint team of theInformation and Privacy Commissioner of Ontario(Canada), theDutch Data Protection Authority, and theNetherlands Organisation for Applied Scientif... | https://en.wikipedia.org/wiki/Privacy_by_design |
Aproximity cardorprox card[1]also known as a key card or keycard is a contactlesssmart cardwhich can be read without inserting it into a reader device, as required by earliermagnetic stripe cardssuch ascredit cardsand contact type smart cards.[2]The proximity cards are part of the contactless card technologies. Held ne... | https://en.wikipedia.org/wiki/Proximity_card |
Resonant inductive couplingormagnetic phase synchronous coupling[4][5]is a phenomenon withinductive couplingin which the coupling becomes stronger when the "secondary" (load-bearing) side of the loosely coupled coil resonates.[5]Aresonant transformerof this type is often used in analog circuitry as abandpass filter. R... | https://en.wikipedia.org/wiki/Resonant_inductive_coupling |
RFDumpis a software created by Lukas Grunwald and Christian Bottger for security auditingRFIDtags. It is periodically updated to support emerging RFID standards, such ase-passportandMifareencryption, that are currently found on many pay-as-you-go systems.
RFDump is a back-end GPL tool that interoperates directly with ... | https://en.wikipedia.org/wiki/RFdump |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.