text stringlengths 16 172k | source stringlengths 32 122 |
|---|---|
Cryptography, orcryptology(fromAncient Greek:κρυπτός,romanized:kryptós"hidden, secret"; andγράφεινgraphein, "to write", or-λογία-logia, "study", respectively[1]), is the practice and study of techniques forsecure communicationin the presence ofadversarialbehavior.[2]More generally, cryptography is about constructing an... | https://en.wikipedia.org/wiki/Cryptography#Symmetric-key_cryptography |
Visual cryptographyis acryptographictechnique which allows visual information (pictures, text, etc.) to be encrypted in such a way that the decrypted information appears as a visual image.
One of the best-known techniques has been credited toMoni NaorandAdi Shamir, who developed it in 1994.[1]They demonstrated a visu... | https://en.wikipedia.org/wiki/Visual_cryptography |
Coding theoryis the study of the properties ofcodesand their respective fitness for specific applications. Codes are used fordata compression,cryptography,error detection and correction,data transmissionanddata storage. Codes are studied by various scientific disciplines—such asinformation theory,electrical engineering... | https://en.wikipedia.org/wiki/Coding_theory |
BigOnotationis a mathematical notation that describes thelimiting behaviorof afunctionwhen theargumenttends towards a particular value or infinity. Big O is a member of afamily of notationsinvented by German mathematiciansPaul Bachmann,[1]Edmund Landau,[2]and others, collectively calledBachmann–Landau notationorasympto... | https://en.wikipedia.org/wiki/Big_O_notation |
BigOnotationis a mathematical notation that describes thelimiting behaviorof afunctionwhen theargumenttends towards a particular value or infinity. Big O is a member of afamily of notationsinvented by German mathematiciansPaul Bachmann,[1]Edmund Landau,[2]and others, collectively calledBachmann–Landau notationorasympto... | https://en.wikipedia.org/wiki/Big_Theta_notation |
Ingroup theory, thePohlig–Hellman algorithm, sometimes credited as theSilver–Pohlig–Hellman algorithm,[1]is a special-purposealgorithmfor computingdiscrete logarithmsin afinite abelian groupwhose order is asmooth integer.
The algorithm was introduced by Roland Silver, but first published byStephen PohligandMartin Hell... | https://en.wikipedia.org/wiki/Pohlig–Hellman_algorithm |
Incryptography, azero-knowledge proof(also known as aZK prooforZKP) is a protocol in which one party (the prover) can convince another party (the verifier) that some given statement is true, without conveying to the verifier any informationbeyondthe mere fact of that statement's truth.[1]The intuition underlying zero-k... | https://en.wikipedia.org/wiki/Zero-knowledge_proof |
Independenceis a fundamental notion inprobability theory, as instatisticsand the theory ofstochastic processes. Twoeventsareindependent,statistically independent, orstochastically independent[1]if, informally speaking, the occurrence of one does not affect the probability of occurrence of the other or, equivalently, do... | https://en.wikipedia.org/wiki/Independence_(probability_theory) |
Inprobability theory, theexpected value(also calledexpectation,expectancy,expectation operator,mathematical expectation,mean,expectation value, orfirstmoment) is a generalization of theweighted average. Informally, the expected value is themeanof the possible values arandom variablecan take, weighted by the probability... | https://en.wikipedia.org/wiki/Expected_value |
Givenrandom variablesX,Y,…{\displaystyle X,Y,\ldots }, that are defined on the same[1]probability space, themultivariateorjoint probability distributionforX,Y,…{\displaystyle X,Y,\ldots }is aprobability distributionthat gives the probability that each ofX,Y,…{\displaystyle X,Y,\ldots }falls in any particular range or d... | https://en.wikipedia.org/wiki/Joint_probability_distribution |
Incomputational complexity theory, acomplexity classis asetofcomputational problems"of related resource-basedcomplexity".[1]The two most commonly analyzed resources aretimeandmemory.
In general, a complexity class is defined in terms of a type of computational problem, amodel of computation, and a bounded resource lik... | https://en.wikipedia.org/wiki/Complexity_class#NP |
Ingraph theory, anisomorphism ofgraphsGandHis abijectionbetween the vertex sets ofGandH
such that any two verticesuandvofGareadjacentinGif and only iff(u){\displaystyle f(u)}andf(v){\displaystyle f(v)}are adjacent inH. This kind of bijection is commonly described as "edge-preserving bijection", in accordance with the ... | https://en.wikipedia.org/wiki/Graph_isomorphism |
Ingraph theory,graph coloringis a methodic assignment of labels traditionally called "colors" to elements of agraph. The assignment is subject to certain constraints, such as that no two adjacent elements have the same color. Graph coloring is a special case ofgraph labeling. In its simplest form, it is a way of colori... | https://en.wikipedia.org/wiki/Graph_coloring |
Incryptography,linear cryptanalysisis a general form ofcryptanalysisbased on findingaffineapproximations to the action of acipher. Attacks have been developed forblock ciphersandstream ciphers. Linear cryptanalysis is one of the two most widely used attacks on block ciphers; the other beingdifferential cryptanalysis.
... | https://en.wikipedia.org/wiki/Linear_cryptanalysis |
Mitsuru Matsui(松井 充,Matsui Mitsuru, born September 16, 1961)is a Japanesecryptographerand senior researcher forMitsubishi ElectricCompany.
While researching error-correcting codes in 1990, Matsui was inspired byEli BihamandAdi Shamir'sdifferential cryptanalysis, and discovered the technique oflinear cryptanalysis, pub... | https://en.wikipedia.org/wiki/Mitsuru_Matsui |
Eli Biham(Hebrew:אלי ביהם) is an Israelicryptographerandcryptanalystwho is a professor at theTechnion - Israel Institute of TechnologyComputer Science department. From 2008 to 2013, Biham was thedeanof the Technion Computer Science department, after serving for two years as chief of CS graduate school.
Biham invented (... | https://en.wikipedia.org/wiki/Eli_Biham |
Incomputational complexity theory, acomplexity classis asetofcomputational problems"of related resource-basedcomplexity".[1]The two most commonly analyzed resources aretimeandmemory.
In general, a complexity class is defined in terms of a type of computational problem, amodel of computation, and a bounded resource lik... | https://en.wikipedia.org/wiki/Complexity_class#Complexity_classes |
Incomputational complexity theory, aninteractive proof systemis anabstract machinethat modelscomputationas the exchange of messages between two parties: aproverand averifier. The parties interact by exchanging messages in order to ascertain whether a givenstringbelongs to alanguageor not. The prover is assumed to posse... | https://en.wikipedia.org/wiki/Interactive_proof_system |
Incomputational complexity theory,PSPACEis the set of alldecision problemsthat can be solved by aTuring machineusing apolynomialamount of space.
If we denote by SPACE(f(n)), the set of all problems that can be solved byTuring machinesusingO(f(n)) space for some functionfof the input sizen, then we can define PSPACE fo... | https://en.wikipedia.org/wiki/PSPACE |
Inmathematics, the concept of aninverse elementgeneralises the concepts ofopposite(−x) andreciprocal(1/x) of numbers.
Given anoperationdenoted here∗, and anidentity elementdenotede, ifx∗y=e, one says thatxis aleft inverseofy, and thatyis aright inverseofx. (An identity element is an element such thatx*e=xande*y=yfor a... | https://en.wikipedia.org/wiki/Invertible_element#In_the_integers_mod_n |
Incomputer security, aside-channel attackis any attack based on extra information that can be gathered because of the fundamental way acomputer protocoloralgorithmisimplemented, rather than flaws in the design of the protocol or algorithm itself (e.g. flaws found in acryptanalysisof acryptographic algorithm) or minor, ... | https://en.wikipedia.org/wiki/Side-channel_attack |
Acryptosystemis considered to haveinformation-theoretic security(also calledunconditional security[1]) if the system is secure againstadversarieswith unlimited computing resources and time. In contrast, a system which depends on the computational cost ofcryptanalysisto be secure (and thus can be broken by an attack wit... | https://en.wikipedia.org/wiki/Perfect_secrecy |
Ininformation theory, theentropyof arandom variablequantifies the average level of uncertainty or information associated with the variable's potential states or possible outcomes. This measures the expected amount of information needed to describe the state of the variable, considering the distribution of probabilities... | https://en.wikipedia.org/wiki/Shannon_entropy |
Inmathematicsandmathematical logic,Boolean algebrais a branch ofalgebra. It differs fromelementary algebrain two ways. First, the values of thevariablesare thetruth valuestrueandfalse, usually denoted by 1 and 0, whereas in elementary algebra the values of the variables are numbers. Second, Boolean algebra useslogical ... | https://en.wikipedia.org/wiki/Boolean_algebra |
Achosen-ciphertext attack(CCA) is anattack modelforcryptanalysiswhere the cryptanalyst can gather information by obtaining the decryptions of chosen ciphertexts. From these pieces of information the adversary can attempt to recover the secret key used for decryption.
For formal definitions of security against chosen-c... | https://en.wikipedia.org/wiki/Chosen_ciphertext_attack |
Key escrow(also known as a"fair" cryptosystem)[1]is an arrangement in which thekeysneeded to decryptencrypteddata are held inescrowso that, under certain circumstances, an authorizedthird partymay gain access to those keys. These third parties may include businesses, who may want access to employees' secure business-re... | https://en.wikipedia.org/wiki/Key_recovery |
Uniform distributionmay refer to: | https://en.wikipedia.org/wiki/Uniform_distribution |
Differentialcryptanalysisis a general form ofcryptanalysisapplicable primarily toblock ciphers, but also to stream ciphers and cryptographic hash functions. In the broadest sense, it is the study of how differences in information input can affect the resultant difference at the output. In the case of ablock cipher, it ... | https://en.wikipedia.org/wiki/Differential_cryptanalysis |
XOR gate(sometimesEOR, orEXORand pronounced asExclusive OR) is a digitallogic gatethat gives a true (1 or HIGH) output when the number of true inputs is odd. An XOR gate implements anexclusive or(↮{\displaystyle \nleftrightarrow }) frommathematical logic; that is, a true output results if one, and only one, of the inpu... | https://en.wikipedia.org/wiki/XOR_gate |
InElectrical Engineering, the process ofcircuit designcan cover systems ranging from complexelectronicsystems down to the individualtransistorswithin anintegrated circuit. One person can often do thedesign processwithout needing a planned or structured design process for simple circuits. Still, teams of designers foll... | https://en.wikipedia.org/wiki/Circuit_design |
Innumber theory, anintegerqis aquadratic residuemodulonif it iscongruentto aperfect squaremodulon; that is, if there exists an integerxsuch that
Otherwise,qis aquadratic nonresiduemodulon.
Quadratic residues are used in applications ranging fromacoustical engineeringtocryptographyand thefactoring of large numbers.
F... | https://en.wikipedia.org/wiki/Quadratic_residue |
TheP versus NP problemis a majorunsolved problemintheoretical computer science. Informally, it asks whether every problem whose solution can be quickly verified can also be quickly solved.
Here, "quickly" means an algorithm exists that solves the task and runs inpolynomial time(as opposed to, say,exponential time), me... | https://en.wikipedia.org/wiki/P_vs_NP_problem |
Inmathematical logic, aformulaissatisfiableif it is true under some assignment of values to itsvariables. For example, the formulax+3=y{\displaystyle x+3=y}is satisfiable because it is true whenx=3{\displaystyle x=3}andy=6{\displaystyle y=6}, while the formulax+1=x{\displaystyle x+1=x}is not satisfiable over the intege... | https://en.wikipedia.org/wiki/Satisfiability |
Incomputational complexity theory, a problem isNP-completewhen:
The name "NP-complete" is short for "nondeterministic polynomial-time complete". In this name, "nondeterministic" refers tonondeterministic Turing machines, a way of mathematically formalizing the idea of a brute-force search algorithm.Polynomial timerefe... | https://en.wikipedia.org/wiki/NP-completeness |
Astatistical hypothesis testis a method of statistical inference used to decide whether the data provide sufficient evidence to reject a particular hypothesis. A statistical hypothesis test typically involves a calculation of atest statistic. Then a decision is made, either by comparing the test statistic to acritical ... | https://en.wikipedia.org/wiki/Hypothesis_testing |
Instatistics,probability theory, andinformation theory, astatistical distancequantifies thedistancebetween two statistical objects, which can be tworandom variables, or twoprobability distributionsorsamples, or the distance can be between an individual sample point and a population or a wider sample of points.
A dista... | https://en.wikipedia.org/wiki/Statistical_distance |
Incryptography, thesimple XOR cipheris a type ofadditivecipher,[1]anencryption algorithmthat operates according to the principles:
For example where⊕{\displaystyle \oplus }denotes theexclusive disjunction(XOR) operation.[2]This operation is sometimes called modulus 2 addition (or subtraction, which is identical).[3]Wi... | https://en.wikipedia.org/wiki/XOR_cipher |
Inmathematics, for givenreal numbersa{\displaystyle a}andb{\displaystyle b}, thelogarithmlogb(a){\displaystyle \log _{b}(a)}is a numberx{\displaystyle x}such thatbx=a{\displaystyle b^{x}=a}. Analogously, in anygroupG{\displaystyle G}, powersbk{\displaystyle b^{k}}can be defined for allintegersk{\displaystyle k}, and t... | https://en.wikipedia.org/wiki/Discrete_logarithm_problem |
Aprimality testis analgorithmfor determining whether an input number isprime. Among other fields ofmathematics, it is used forcryptography. Unlikeinteger factorization, primality tests do not generally giveprime factors, only stating whether the input number is prime or not. Factorization is thought to be a computation... | https://en.wikipedia.org/wiki/Primality_test |
Adigital signatureis a mathematical scheme for verifying the authenticity of digital messages or documents. A valid digital signature on a message gives a recipient confidence that the message came from a sender known to the recipient.[1][2]
Digital signatures are a standard element of mostcryptographic protocolsuites... | https://en.wikipedia.org/wiki/Digital_signature#Security_properties |
I(μ,σ)=(1/σ2002/σ2){\displaystyle {\mathcal {I}}(\mu ,\sigma )={\begin{pmatrix}1/\sigma ^{2}&0\\0&2/\sigma ^{2}\end{pmatrix}}}
Inprobability theoryandstatistics, anormal distributionorGaussian distributionis a type ofcontinuous probability distributionfor areal-valuedrandom variable. The general form of itsprobability... | https://en.wikipedia.org/wiki/Normal_distribution |
Robert Maskell Patterson(March 23, 1787 – September 5, 1854) was an American professor of mathematics, chemistry and natural philosophy at theUniversity of Pennsylvaniafrom 1812 to 1828 and professor ofnatural philosophyat theUniversity of Virginiafrom 1828 to 1835. He served as the 6th director of theUnited States Min... | https://en.wikipedia.org/wiki/Perfect_cipher |
Inalgebra, aunitorinvertible element[a]of aringis aninvertible elementfor the multiplication of the ring. That is, an elementuof a ringRis a unit if there existsvinRsuch thatvu=uv=1,{\displaystyle vu=uv=1,}where1is themultiplicative identity; the elementvis unique for this property and is called themultiplicative inver... | https://en.wikipedia.org/wiki/Group_of_units#Example:_The_group_of_units_of_Z_n |
Incomputational complexity theory,NP(nondeterministic polynomial time) is acomplexity classused to classifydecision problems. NP is thesetof decision problems for which theproblem instances, where the answer is "yes", haveproofsverifiable inpolynomial timeby adeterministic Turing machine, or alternatively the set of p... | https://en.wikipedia.org/wiki/Nondeterministic_polynomial_time |
Incomputational complexity theory, a computational problemHis calledNP-hardif, for every problemLwhich can be solved innon-deterministic polynomial-time, there is apolynomial-time reductionfromLtoH. That is, assuming a solution forHtakes 1 unit time,H's solution can be used to solveLin polynomial time.[1][2]As a conse... | https://en.wikipedia.org/wiki/NP-hardness |
Incomputational complexity theory, acomplexity classis asetofcomputational problems"of related resource-basedcomplexity".[1]The two most commonly analyzed resources aretimeandmemory.
In general, a complexity class is defined in terms of a type of computational problem, amodel of computation, and a bounded resource lik... | https://en.wikipedia.org/wiki/Complexity_class |
Incryptography, akey derivation function(KDF) is a cryptographic algorithm that derives one or moresecret keysfrom a secret value such as a master key, apassword, or apassphraseusing apseudorandom function(which typically uses acryptographic hash functionorblock cipher).[1][2][3]KDFs can be used to stretch keys into lo... | https://en.wikipedia.org/wiki/Key_derivation_function |
Incomputational complexity theory, acomplexity classis asetofcomputational problems"of related resource-basedcomplexity".[1]The two most commonly analyzed resources aretimeandmemory.
In general, a complexity class is defined in terms of a type of computational problem, amodel of computation, and a bounded resource lik... | https://en.wikipedia.org/wiki/Complexity_class#NP_and_co-NP |
Ininformation theory, theconditional entropyquantifies the amount of information needed to describe the outcome of arandom variableY{\displaystyle Y}given that the value of another random variableX{\displaystyle X}is known. Here, information is measured inshannons,nats, orhartleys. Theentropy ofY{\displaystyle Y}condit... | https://en.wikipedia.org/wiki/Conditional_entropy |
Ininformation theory, theentropyof arandom variablequantifies the average level of uncertainty or information associated with the variable's potential states or possible outcomes. This measures the expected amount of information needed to describe the state of the variable, considering the distribution of probabilities... | https://en.wikipedia.org/wiki/Entropy_(information_theory) |
Incryptography, adistinguishing attackis any form ofcryptanalysison data encrypted by a cipher that allows an attacker to distinguish the encrypted data from random data.[1]Modernsymmetric-key ciphersare specifically designed to be immune to such an attack.[2]In other words, modern encryption schemes arepseudorandom pe... | https://en.wikipedia.org/wiki/Distinguishing_attack |
Incryptography, aFeistel cipher(also known asLuby–Rackoff block cipher) is asymmetric structureused in the construction ofblock ciphers, named after theGerman-bornphysicistand cryptographerHorst Feistel, who did pioneering research while working forIBM; it is also commonly known as aFeistel network. A large number ofbl... | https://en.wikipedia.org/wiki/Feistel_network |
Incomputer science, anonline algorithmmeasures itscompetitivenessagainst differentadversary models. For deterministic algorithms, the adversary is the same as the adaptive offline adversary. For randomized online algorithms competitiveness can depend upon theadversary modelused.
The three common adversaries are the ob... | https://en.wikipedia.org/wiki/Adversarial_model#Existential_forgery |
Achosen-plaintext attack(CPA) is anattack modelforcryptanalysiswhich presumes that the attacker can obtain theciphertextsfor arbitraryplaintexts.[1]The goal of the attack is to gain information that reduces the security of theencryptionscheme.[2]
Modern ciphers aim to provide semantic security, also known asciphertext... | https://en.wikipedia.org/wiki/Chosen-plaintext_attack |
Akey-recovery attackis an adversary's attempt to recover thecryptographic keyof an encryption scheme. Normally this means that the attacker has a pair, or more than one pair, ofplaintextmessage and the correspondingciphertext.[1]: 52Historically, cryptanalysis of block ciphers has focused on key-recovery, but security ... | https://en.wikipedia.org/wiki/Key_recovery_attack |
Ingroup theory, thePohlig–Hellman algorithm, sometimes credited as theSilver–Pohlig–Hellman algorithm,[1]is a special-purposealgorithmfor computingdiscrete logarithmsin afinite abelian groupwhose order is asmooth integer.
The algorithm was introduced by Roland Silver, but first published byStephen PohligandMartin Hell... | https://en.wikipedia.org/wiki/Pohlig%E2%80%93Hellman_algorithm |
Incomputer security,executable-space protectionmarksmemoryregions as non-executable, such that an attempt to executemachine codein these regions will cause anexception. It relies on hardware features such as theNX bit(no-execute bit), or on software emulation when hardware support is unavailable. Software emulation oft... | https://en.wikipedia.org/wiki/Data_Execution_Prevention |
Control-flow integrity(CFI) is a general term forcomputer securitytechniques that prevent a wide variety ofmalwareattacks from redirecting the flow of execution (thecontrol flow) of a program.
A computer program commonly changes its control flow to make decisions and use different parts of the code. Such transfers may... | https://en.wikipedia.org/wiki/Control_flow_integrity |
Acode sanitizeris a programming tool that detectsbugsin the form of undefined or suspicious behavior by acompilerinsertinginstrumentationcode at runtime. The class of tools was first introduced by Google'sAddressSanitizer(orASan) of 2012, which uses directly mappedshadow memoryto detectmemory corruptionsuch asbuffer ov... | https://en.wikipedia.org/wiki/AddressSanitizer |
Apatchisdatathat is intended to be used to modify an existing software resource such as aprogramor afile, often to fixbugsandsecurity vulnerabilities.[1][2]A patch may be created to improve functionality,usability, orperformance. A patch is typically provided by a vendor for updating the software that they provide. A p... | https://en.wikipedia.org/wiki/Software_update |
Insoftware engineering,couplingis the degree of interdependence between softwaremodules, a measure of how closely connected two routines or modules are,[1]and the strength of the relationships between modules.[2]Coupling is not binary but multi-dimensional.[3]
Coupling is usually contrasted withcohesion.Low couplingof... | https://en.wikipedia.org/wiki/Software_dependency |
Computer security(alsocybersecurity,digital security, orinformation technology (IT) security) is a subdiscipline within the field ofinformation security. It consists of the protection ofcomputer software,systemsandnetworksfromthreatsthat can lead to unauthorized information disclosure, theft or damage tohardware,softwa... | https://en.wikipedia.org/wiki/Software_security |
Code injectionis acomputer security exploitwhere aprogramfails to correctly process external data, such as user input, causing it to interpret the data as executable commands. Anattackerusing this method "injects"codeinto the program while it is running. Successful exploitation of a code injection vulnerability can res... | https://en.wikipedia.org/wiki/Command_injection |
Inmultitaskingcomputeroperating systems, adaemon(/ˈdiːmən/or/ˈdeɪmən/)[1]is acomputer programthat runs as abackground process, rather than being under the direct control of an interactive user. Traditionally, the process names of a daemon end with the letterd, for clarification that the process is in fact a daemon, and... | https://en.wikipedia.org/wiki/Daemon_(computing) |
Address space layout randomization(ASLR) is acomputer securitytechnique involved in preventingexploitationofmemory corruptionvulnerabilities.[1]In order to prevent an attacker from reliably redirecting code execution to, for example, a particular exploited function in memory, ASLR randomly arranges theaddress spaceposi... | https://en.wikipedia.org/wiki/Address_space_layout_randomization |
In software, astack buffer overfloworstack buffer overrunoccurs when a program writes to amemoryaddress on the program'scall stackoutside of the intended data structure, which is usually a fixed-lengthbuffer.[1][2]Stack buffer overflow bugs are caused when a program writes more data to a buffer located on the stack tha... | https://en.wikipedia.org/wiki/Stack_canary |
Incomputer security,executable-space protectionmarksmemoryregions as non-executable, such that an attempt to executemachine codein these regions will cause anexception. It relies on hardware features such as theNX bit(no-execute bit), or on software emulation when hardware support is unavailable. Software emulation oft... | https://en.wikipedia.org/wiki/Data_execution_prevention |
Androidis anoperating systembased on a modified version of theLinux kerneland otheropen-sourcesoftware, designed primarily fortouchscreen-based mobile devices such assmartphonesandtablets. Android has historically been developed by a consortium of developers known as theOpen Handset Alliance, but its most widely used v... | https://en.wikipedia.org/wiki/Android_(operating_system) |
Linux(/ˈlɪnʊks/,LIN-uuks)[15]is a family ofopen sourceUnix-likeoperating systemsbased on theLinux kernel,[16]anoperating system kernelfirst released on September 17, 1991, byLinus Torvalds.[17][18][19]Linux is typicallypackagedas aLinux distribution(distro), which includes the kernel and supportingsystem softwareandlib... | https://en.wikipedia.org/wiki/Linux |
Containerizationis a system ofintermodal freight transportusingintermodal containers(also calledshipping containers, orISOcontainers).[1]Containerization, also referred ascontainer stuffingorcontainer loading, is the process of unitization of cargoes in exports. Containerization is the predominant form of unitization o... | https://en.wikipedia.org/wiki/Containerization |
Mobile security, ormobile device security, is the protection ofsmartphones, tablets, andlaptopsfrom threats associated withwireless computing.[1]It has become increasingly important inmobile computing. Thesecurityof personal and business information now stored onsmartphonesis of particular concern.[2]
Increasingly, us... | https://en.wikipedia.org/wiki/Mobile_security |
Malware(aportmanteauofmalicious software)[1]is anysoftwareintentionally designed to cause disruption to acomputer,server,client, orcomputer network, leak private information, gain unauthorized access to information or systems, deprive access to information, or which unknowingly interferes with the user'scomputer securi... | https://en.wikipedia.org/wiki/Malware |
Ininformation security, aconfused deputyis acomputer programthat is tricked by another program (with fewer privileges or less rights) into misusing its authority on the system. It is a specific type ofprivilege escalation.[1]Theconfused deputy problemis often cited as an example of whycapability-based securityis import... | https://en.wikipedia.org/wiki/Confused_deputy_problem |
AnIntentin theAndroid operating systemis asoftwaremechanism that allowsusersto coordinate the functions of different activities to achieve a task. An Intent is a messaging object[1]which provides a facility for performinglate runtime bindingbetween the code in different applications in the Androiddevelopment environmen... | https://en.wikipedia.org/wiki/Intent_(Android) |
Dangling pointersandwild pointersincomputer programmingarepointersthat do not point to a valid object of the appropriate type. These are special cases ofmemory safetyviolations. More generally,dangling referencesandwild referencesarereferencesthat do not resolve to a valid destination.
Dangling pointers arise duringob... | https://en.wikipedia.org/wiki/Use-after-free |
Compartmentalizationorcompartmentalisationmay refer to: | https://en.wikipedia.org/wiki/Compartmentalization |
Incomputer programming,instrumentationis the act of modifying software so thatanalysiscan be performed on it.[1]
Generally, instrumentation either modifiessource codeorbinary code. Execution environments like the JVM provide separate interfaces to add instrumentation to program executions, such as theJVMTI, which enab... | https://en.wikipedia.org/wiki/Code_instrumentation |
Software testingis the act of checking whethersoftwaresatisfies expectations.
Software testing can provide objective, independent information about thequalityof software and theriskof its failure to auseror sponsor.[1]
Software testing can determine thecorrectnessof software for specificscenariosbut cannot determine ... | https://en.wikipedia.org/wiki/Software_testing#Code_coverage |
Incomputer science,symbolic execution(alsosymbolic evaluationorsymbex) is a means ofanalyzing a programto determine whatinputscause each part of a program toexecute. Aninterpreterfollows the program, assuming symbolic values for inputs rather than obtaining actual inputs as normal execution of the program would. It t... | https://en.wikipedia.org/wiki/Symbolic_execution |
Inprogrammingandsoftware development,fuzzingorfuzz testingis an automatedsoftware testingtechnique that involves providing invalid, unexpected, orrandom dataas inputs to acomputer program. The program is then monitored for exceptions such ascrashes, failing built-in codeassertions, or potentialmemory leaks. Typically, ... | https://en.wikipedia.org/wiki/Fuzz_testing |
Inprogrammingandsoftware development,fuzzingorfuzz testingis an automatedsoftware testingtechnique that involves providing invalid, unexpected, orrandom dataas inputs to acomputer program. The program is then monitored for exceptions such ascrashes, failing built-in codeassertions, or potentialmemory leaks. Typically, ... | https://en.wikipedia.org/wiki/Fuzzing |
Black-box testing,sometimes referred to asspecification-based testing,[1]is a method ofsoftware testingthat examines the functionality of an application without peering into its internal structures or workings. This method of test can be applied virtually to every level of software testing:unit,integration,systemandacc... | https://en.wikipedia.org/wiki/Black_box_testing |
Gray-box testing(International English spelling:grey-box testing) is a combination ofwhite-box testingandblack-box testing. The aim of this testing is to search for the defects, if any, due to improper structure or improper usage of applications.[1][2]
A black-box tester is unaware of the internal structure of the app... | https://en.wikipedia.org/wiki/Gray_box_testing |
Concolic testing(aportmanteauofconcreteandsymbolic, also known asdynamic symbolic execution) is a hybridsoftware verificationtechnique that performssymbolic execution, a classical technique that treats program variables as symbolic variables, along aconcrete execution(testingon particular inputs) path. Symbolic executi... | https://en.wikipedia.org/wiki/Concolic_testing |
Static analysis,static projection, orstatic scoringis a simplified analysis wherein the effect of an immediate change to a system is calculated without regard to the longer-term response of the system to that change. If the short-term effect is then extrapolated to the long term, such extrapolation is inappropriate.
I... | https://en.wikipedia.org/wiki/Static_analysis |
Dynamic scoringis a forecasting technique forgovernment revenues, expenditures, andbudget deficitsthat incorporates predictions about the behavior of people and organizations based on changes infiscal policy, usuallytax rates. Dynamic scoring depends on models of the behavior ofeconomic agentswhich predict how they wou... | https://en.wikipedia.org/wiki/Dynamic_analysis |
Software testingis the act of checking whethersoftwaresatisfies expectations.
Software testing can provide objective, independent information about thequalityof software and theriskof its failure to auseror sponsor.[1]
Software testing can determine thecorrectnessof software for specificscenariosbut cannot determine ... | https://en.wikipedia.org/wiki/Software_testing#Limitations_of_testing |
Control-flow integrity(CFI) is a general term forcomputer securitytechniques that prevent a wide variety ofmalwareattacks from redirecting the flow of execution (thecontrol flow) of a program.
A computer program commonly changes its control flow to make decisions and use different parts of the code. Such transfers may... | https://en.wikipedia.org/wiki/Control-flow_integrity |
Inprogrammingandinformation security, abuffer overfloworbuffer overrunis ananomalywhereby aprogramwritesdatato abufferbeyond the buffer'sallocated memory, overwriting adjacentmemorylocations.
Buffers are areas of memory set aside to hold data, often while moving it from one section of a program to another, or between ... | https://en.wikipedia.org/wiki/Buffer_overflow |
Incomputer science, athreadofexecutionis the smallest sequence of programmed instructions that can be managed independently by ascheduler, which is typically a part of theoperating system.[1]In many cases, a thread is a component of aprocess.
The multiple threads of a given process may be executedconcurrently(via mult... | https://en.wikipedia.org/wiki/Thread_(computing) |
Incomputing, theExecutable and Linkable Format[2](ELF, formerly namedExtensible Linking Format) is a common standardfile formatforexecutablefiles,object code,shared libraries, andcore dumps. First published in the specification for theapplication binary interface(ABI) of theUnixoperating system version namedSystem V Re... | https://en.wikipedia.org/wiki/Executable_and_linkable_format |
Incomputing,position-independent code[1](PIC[1]) orposition-independent executable(PIE)[2]is a body ofmachine codethat executes properly regardless of itsmemory address.[a]PIC is commonly used forshared libraries, so that the same library code can be loaded at a location in each program's address space where it does no... | https://en.wikipedia.org/wiki/Position-independent_code |
Return-oriented programming(ROP) is acomputer security exploittechnique that allows an attacker to execute code in the presence of security defenses[1][2]such asexecutable-space protectionandcode signing.[3]
In this technique, an attacker gains control of thecall stackto hijack programcontrol flowand then executes car... | https://en.wikipedia.org/wiki/Return-oriented_programming |
Return-oriented programming(ROP) is acomputer security exploittechnique that allows an attacker to execute code in the presence of security defenses[1][2]such asexecutable-space protectionandcode signing.[3]
In this technique, an attacker gains control of thecall stackto hijack programcontrol flowand then executes car... | https://en.wikipedia.org/wiki/Jump-oriented_programming |
Uncontrolled format stringis a type ofcode injectionvulnerabilitydiscovered around 1989 that can be used insecurity exploits.[1]Originally thought harmless, format string exploits can be used tocrasha program or to execute harmful code. The problem stems from the use ofunchecked user inputas theformat stringparameter i... | https://en.wikipedia.org/wiki/Format_string_attack |
Memory safetyis the state of being protected from varioussoftware bugsandsecurity vulnerabilitieswhen dealing withmemoryaccess, such asbuffer overflowsanddangling pointers.[1]For example,Javais said to be memory-safe because itsruntime error detectionchecks array bounds and pointer dereferences.[1]In contrast,CandC++al... | https://en.wikipedia.org/wiki/Memory_safety |
Incomputer science,garbage collection(GC) is a form of automaticmemory management.[2]Thegarbage collectorattempts to reclaim memory that was allocated by the program, but is no longer referenced; such memory is calledgarbage. Garbage collection was invented by American computer scientistJohn McCarthyaround 1959 to simp... | https://en.wikipedia.org/wiki/Garbage_collection_(computer_science) |
In theC++programming language,static_castis anoperatorthat performs an explicittype conversion.[1]
Thetypeparameter must be a data type to whichobjectcan be converted via a known method, whether it be a builtin or a cast. The type can be a reference or an enumerator.
All types of conversions that are well-defined and ... | https://en.wikipedia.org/wiki/Static_cast |
In computer programming,run-time type informationorrun-time type identification(RTTI)[1]is a feature of some programming languages (such asC++,[2]Object Pascal, andAda[3]) that exposes information about an object'sdata typeatruntime. Run-time type information may be available for all types or only to types that explici... | https://en.wikipedia.org/wiki/Dynamic_cast |
Insoftware engineering, asoftware development processorsoftware development life cycle(SDLC) is a process of planning and managingsoftware development. It typically involves dividing software development work into smaller, parallel, or sequential steps or sub-processes to improvedesignand/orproduct management. The meth... | https://en.wikipedia.org/wiki/Software_development_process |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.