text stringlengths 11 320k | source stringlengths 26 161 |
|---|---|
DNS over TLS(DoT) is a networksecurity protocolfor encrypting and wrappingDomain Name System(DNS) queries and answers via theTransport Layer Security(TLS) protocol. The goal of the method is to increase user privacy and security by preventing eavesdropping and manipulation of DNS data viaman-in-the-middle attacks. Thew... | https://en.wikipedia.org/wiki/DNS_over_TLS |
DNS over HTTPS(DoH) is a protocol for performing remote Domain Name System (DNS) resolution via theHTTPSprotocol. A goal of the method is to increase user privacy and security by preventing eavesdropping and manipulation of DNS data byman-in-the-middle attacks[1]by using the HTTPS protocol toencryptthe data between the... | https://en.wikipedia.org/wiki/DNS_over_HTTPS |
DNSCryptis anetwork protocolthat authenticates and encryptsDomain Name System(DNS) traffic between the user'scomputerandrecursive name servers. DNSCrypt wraps unmodified DNS traffic between a client and a DNS resolver in a cryptographic construction, preventing eavesdropping and forgery by aman-in-the-middle.[1]
It a... | https://en.wikipedia.org/wiki/DNSCrypt |
Incomputer networking,linear network codingis a program in which intermediate nodes transmit data from source nodes to sink nodes by means oflinear combinations.
Linear network coding may be used to improve a network's throughput, efficiency, andscalability, as well as reducing attacks and eavesdropping. Thenodesof a... | https://en.wikipedia.org/wiki/Network_coding |
Inmathematics, theWeil pairingis apairing(bilinear form, though withmultiplicative notation) on the points of order dividingnof anelliptic curveE, taking values innthroots of unity. More generally there is a similar Weil pairing between points of ordernof an abelian variety and its dual. It was introduced byAndré Weil(... | https://en.wikipedia.org/wiki/Weil_pairing |
As Gafgyt
As QBot
As PinkSlip
BASHLITE(also known asGafgyt,Lizkebab,PinkSlip,Qbot,TorlusandLizardStresser) ismalwarewhich infectsLinuxsystems in order to launchdistributed denial-of-service attacks(DDoS).[1]Originally it was also known under the nameBashdoor,[2]but this term now refers to the exploit method used by ... | https://en.wikipedia.org/wiki/BASHLITE |
Incomputer security, abillion laughs attackis a type ofdenial-of-service (DoS) attackwhich is aimed atparsersofXMLdocuments.[1]
It is also referred to as anXML bombor as an exponential entity expansion attack.[2]
The example attack consists of defining 10 entities, each defined as consisting of 10 of the previous ent... | https://en.wikipedia.org/wiki/Billion_laughs_attack |
AsLovsan
AsMSBLAST
Blaster(also known asLovsan,Lovesan, orMSBlast) was acomputer wormthat spread on computers runningoperating systemsWindows XPandWindows 2000during August 2003.[1]
The worm was first noticed and started spreading on August 11, 2003. The rate that it spread increased until the number of infections p... | https://en.wikipedia.org/wiki/Blaster_(computer_worm) |
Aclear channel assessment attackorQueensland attackis aphysical layerDoS attackagainstWi-Finetworks. The attack focuses the need of a wireless network to receive the "clear channel assessment"; which is a function withinCSMA/CAto determine whether the wireless medium is ready and able to receive data, so that the tran... | https://en.wikipedia.org/wiki/Clear_channel_assessment_attack |
Dendroidismalwarethat affects Android OS and targets the mobile platform.[1]
It was first discovered in early of 2014 by Symantec and appeared in the underground for sale for $300.[2]Certain features were noted as being used in Dendroid, such as the ability to hide from emulators at the time.[3]When first discovered i... | https://en.wikipedia.org/wiki/Dendroid_(malware) |
Distributed denial-of-service attacks on root nameserversareInternetevents in which distributeddenial-of-service attackstarget one or more of the thirteenDomain Name Systemroot nameserverclusters. The root nameservers arecritical infrastructure components of the Internet, mappingdomain namestoIP addressesand other reso... | https://en.wikipedia.org/wiki/Distributed_denial-of-service_attacks_on_root_nameservers |
DNS Floodis a type ofdenial-of-service attack. It is the process whereby the traffic on anetworkresource or machine is stopped for some time. The offender sends a great number of requests to the resource or machine so that it might become unavailable to those who might try to reach it. During aDNSflood the host that co... | https://en.wikipedia.org/wiki/DNS_Flood |
Hit-and-run DDoSis a type ofdenial-of-service (DDoS) attackthat uses short bursts of high volume attacks in random intervals, spanning a time frame of days or weeks. The purpose of a hit-and-run DDoS is to prevent a user of a service from using that service by bringing down the hostserver.[1]This type of attack is to b... | https://en.wikipedia.org/wiki/Hit-and-run_DDoS |
Anintrusion detection system(IDS) is a device orsoftwareapplication that monitors a network or systems for malicious activity or policy violations.[1]Any intrusion activity or violation is typically either reported to an administrator or collected centrally using asecurity information and event management (SIEM)system.... | https://en.wikipedia.org/wiki/Intrusion_detection_system |
Incomputer jargon, akiller pokeis a method of inducing physicalhardwaredamage on a machine or itsperipheralsby the insertion of invalid values, via, for example,BASIC'sPOKEcommand, into amemory-mappedcontrolregister. The term is typically used to describe a family of fairly well known tricks that can overload theanalog... | https://en.wikipedia.org/wiki/Killer_poke |
Alace card(also called awhoopee card,ventilator card,flyswatter card, orIBM doily[citation needed]) is apunched cardwith all holes punched. They were mainly used as practical jokes to cause disruption incard readers. Card readers tended to jam when a lace card was inserted, as the resulting card had insufficient struct... | https://en.wikipedia.org/wiki/Lace_card |
Regardingcomputer security, amixed threat attackis an attack that uses several different tactics to infiltrate acomputeruser's environment. A mixedthreatattack might include an infected file that comes in by way ofspamor can be received by anInternetdownload. Mixed threat attacks try to exploit multiple vulnerabilitie... | https://en.wikipedia.org/wiki/Mixed_threat_attack |
Anintrusion detection system(IDS) is a device orsoftwareapplication that monitors a network or systems for malicious activity or policy violations.[1]Any intrusion activity or violation is typically either reported to an administrator or collected centrally using asecurity information and event management (SIEM)system.... | https://en.wikipedia.org/wiki/Network_intrusion_detection_system |
On October 21, 2016, three consecutivedistributed denial-of-service attackswere launched against theDomain Name System(DNS) providerDyn. The attack caused major Internet platforms and services to be unavailable to large swathes of users in Europe and North America.[3][4]The groupsAnonymousand New World Hackers claimed ... | https://en.wikipedia.org/wiki/2016_Dyn_cyberattack |
"Paper terrorism" is aneologismreferring to the use offalse liens,frivolous lawsuits, bogusletters of credit, and other legal orpseudolegaldocuments lacking sound factual basis as a method of harassment against an opponent on a scale described as evocative of conventionalarmed terrorism.[1]These methods are popular amo... | https://en.wikipedia.org/wiki/Paper_terrorism |
Project Shieldis an anti-distributed-denial-of-service(anti-DDoS) that is offered byJigsaw, a subsidiary ofGoogle, to websites that have "media, elections, and human rights related content."[1]The main goal of the project is to serve "small, under-resourced news sites that are vulnerable to the web's growing epidemic o... | https://en.wikipedia.org/wiki/Project_Shield |
Aregular expression denial of service(ReDoS)[1]is analgorithmic complexity attackthat produces adenial-of-serviceby providing aregular expressionand/or an input that takes a long time to evaluate. The attack exploits the fact that many[2]regular expression implementationshave super-linearworst-case complexity; on certa... | https://en.wikipedia.org/wiki/ReDoS |
Resource exhaustion attacksare computer securityexploitsthatcrash,hang, or otherwise interfere with the targeted program or system. They are a form ofdenial-of-service attackbut are different fromdistributeddenial-of-service attacks, which involve overwhelming a network host such as a web server with requests from many... | https://en.wikipedia.org/wiki/Resource_exhaustion_attack |
Avirtual sit-inis a form ofelectronic civil disobediencederiving its name from thesit-inspopular during thecivil rights movementof the 1960s. The virtual sit-in attempts to recreate that same action digitally using adistributed denial-of-service attack(DDOS). During a virtual sit-in, hundreds ofactivistsattempt to acce... | https://en.wikipedia.org/wiki/Virtual_sit-in |
Aweb shellis ashell-like interfacethat enables aweb serverto be remotely accessed, often for the purposes ofcyberattacks.[1]A web shell is unique in that aweb browseris used to interact with it.[2][3]
A web shell could be programmed in anyprogramming languagethat is supported on a server. Web shells are most commonly ... | https://en.wikipedia.org/wiki/Web_shell |
Radio jammingis the deliberate blocking of or interference withwireless communications.[1][2]In some cases, jammers work by the transmission ofradio signalsthat disrupttelecommunicationsby decreasing thesignal-to-noise ratio.[3]
The concept can be used inwireless data networksto disrupt information flow.[4]It is a com... | https://en.wikipedia.org/wiki/Radio_jamming |
XOR DDoSis a Linux Trojan malware with rootkit capabilities that was used to launch large-scale DDoS attacks. Its name stems from the heavy usage of XOR encryption in both malware and network communication to the C&Cs. It is built for multiple Linux architectures like ARM, x86 and x64. Noteworthy about XOR DDoS is the ... | https://en.wikipedia.org/wiki/Xor_DDoS |
Zemrais a DDoS Bot which was first discovered in underground forums in May 2012.[1][2]
Zemra is capable of HTTP and SYN Flood flooding and also has a simpleCommand & Control panelthat is protected with 256-bit DES encryption for communicating with its command and control (C&C) server.[3]Zemra also sends information su... | https://en.wikipedia.org/wiki/Zemra |
In computing, azip bomb, also known as adecompression bomborzip of death(ZOD), is a maliciousarchive filedesigned to crash or render useless the program or system reading it. The older the system or program, the less likely it is that the zip bomb will be detected. It is often employed to disableantivirus software, in... | https://en.wikipedia.org/wiki/Zip_bomb |
Shor's algorithmis aquantum algorithmfor finding theprime factorsof an integer. It was developed in 1994 by the American mathematicianPeter Shor.[1][2]It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical (non... | https://en.wikipedia.org/wiki/Shor%27s_algorithm |
TheSignal Protocol(formerly known as theTextSecure Protocol) is a non-federatedcryptographic protocolthat providesend-to-end encryptionfor voice andinstant messagingconversations.[2]The protocol was developed byOpen Whisper Systemsin 2013[2]and was introduced in theopen-sourceTextSecureapp, which later becameSignal. Se... | https://en.wikipedia.org/wiki/Signal_Protocol |
Signalis an Americanopen-source,encryptedmessaging service forinstant messaging,voice calls, andvideo calls.[14][15]The instant messaging function includes sending text, voice notes, images, videos, and other files.[16]Communication may be one-to-one between users or may involve group messaging.
The application uses a... | https://en.wikipedia.org/wiki/Signal_(software) |
End-to-end encryption(E2EE) is a method of implementing a secure communication system where only communicating users can participate. No one else, including the system provider,telecom providers,Internet providersormalicious actors, can access thecryptographic keysneeded to read or send messages.[1]
End-to-endencrypti... | https://en.wikipedia.org/wiki/End-to-end_encryption |
Computer science(also called computing science) is the study of the theoretical foundations ofinformationandcomputationand their implementation and application incomputersystems. One well known subject classification system for computer science is theACM Computing Classification Systemdevised by theAssociation for Comp... | https://en.wikipedia.org/wiki/Outline_of_computer_science |
Arc routingproblems(ARP)are a category of general routing problems (GRP), which also includes node routing problems (NRP). The objective in ARPs and NRPs is to traverse the edges and nodes of a graph, respectively.[1]The objective of arc routing problems involves minimizing the total distance and time, which often invo... | https://en.wikipedia.org/wiki/Chinese_Postman_Problem_Complexity_List |
The game ofGois one of the most popular games in the world. As a result of its elegant and simple rules, the game has long been an inspiration formathematicalresearch.Shen Kuo, an 11th century Chinese scholar, estimated in hisDream Pool Essaysthat the number of possible board positions is around 10172. In more recent y... | https://en.wikipedia.org/wiki/Go_and_mathematics |
Asolved gameis agamewhose outcome (win, lose ordraw) can be correctly predicted from any position, assuming that both players play perfectly. This concept is usually applied toabstract strategy games, and especially to games with full information and no element of chance; solving such a game may usecombinatorial game t... | https://en.wikipedia.org/wiki/Solved_game |
Solving chessconsists of finding an optimal strategy for the game ofchess; that is, one by which one of the players (White or Black) can always force either a victory or a draw (seesolved game). It is also related to more generally solvingchess-likegames (i.e.combinatorial gamesofperfect information) such asCapablanca ... | https://en.wikipedia.org/wiki/Solving_chess |
TheShannon number, named after the American mathematicianClaude Shannon, is a conservative lower bound of thegame-tree complexityofchessof 10120, based on an average of about 103possibilities for a pair of moves consisting of a move for White followed by a move for Black, and a typical game lasting about 40 such pairs ... | https://en.wikipedia.org/wiki/Shannon_number |
This is a list of some of the more commonly known problems that areNP-completewhen expressed asdecision problems. As there are thousands of such problems known, this list is in no way comprehensive. Many problems of this type can be found inGarey & Johnson (1979).
Graphsoccur frequently in everyday applications. Examp... | https://en.wikipedia.org/wiki/List_of_NP-complete_problems#Games_and_puzzles |
Here are some of the more commonly known problems that arePSPACE-completewhen expressed asdecision problems. This list is in no way comprehensive.
Generalizedversions of:
Type inhabitation problemfor simply typed lambda calculus
Integer circuitevaluation[24] | https://en.wikipedia.org/wiki/List_of_PSPACE-complete_problems#Games_and_puzzles |
Digital physicsis a speculative idea suggesting that theuniversecan be conceived of as a vast, digital computation device, or as the output of adeterministicorprobabilisticcomputer program.[1]The hypothesis that the universe is adigital computerwas proposed byKonrad Zusein his 1969 bookRechnender Raum[2](Calculating-sp... | https://en.wikipedia.org/wiki/Digital_physics |
Hypercomputationorsuper-Turing computationis a set of hypotheticalmodels of computationthat can provide outputs that are notTuring-computable. For example, a machine that could solve thehalting problemwould be a hypercomputer; so too would one that couldcorrectly evaluate every statementinPeano arithmetic.
TheChurch–T... | https://en.wikipedia.org/wiki/Hypercomputation |
Amatrioshka brain[1][2]is a hypotheticalmegastructureof immense computational capacity powered by aDyson sphere. It was proposed in 1997 byRobert J. Bradbury(1956–2011[3]). It is an example of a class-Bstellar engine, employing the entire energy output of a star to drivecomputersystems.[4]This concept derives its name ... | https://en.wikipedia.org/wiki/Matrioshka_brain |
The study of thephysics ofcomputationrelates to understanding the fundamentalphysical limits of computers. This field has led to the investigation of howthermodynamicslimits information processing, the understanding ofchaosanddynamical systems, and a rapidly growing effort to invent newquantum computers.
Thiscomputati... | https://en.wikipedia.org/wiki/Physics_of_computation |
Programmable matterismatterwhich has the ability to change its physical properties (shape, density,moduli, conductivity, optical properties, etc.) in a programmable fashion, based upon user input or autonomous sensing. Programmable matter is thus linked to the concept of a material which inherently has the ability to ... | https://en.wikipedia.org/wiki/Programmable_matter |
Inphilosophy, asupertaskis acountably infinitesequence of operations that occur sequentially within a finite interval of time.[1]Supertasks are calledhypertaskswhen the number of operations becomesuncountably infinite. A hypertask that includes one task for eachordinal numberis called anultratask.[2]The term "supertask... | https://en.wikipedia.org/wiki/Supertask |
Aparameterized approximation algorithmis a type ofalgorithmthat aims to find approximate solutions toNP-hardoptimization problemsinpolynomial timein the input size and a function of a specific parameter. These algorithms are designed to combine the best aspects of both traditionalapproximation algorithmsandfixed-parame... | https://en.wikipedia.org/wiki/Parameterized_approximation_algorithm |
Incomputer scienceandoperations research,approximation algorithmsareefficientalgorithmsthat findapproximatesolutions tooptimization problems(in particularNP-hardproblems) with provable guarantees on the distance of the returned solution to the optimal one.[1]Approximation algorithms naturally arise in the field oftheor... | https://en.wikipedia.org/wiki/Approximation_algorithm |
Intheoretical computer science,circuit complexityis a branch ofcomputational complexity theoryin whichBoolean functionsare classified according to the size or depth of theBoolean circuitsthat compute them. A related notion is the circuit complexity of arecursive languagethat isdecidedby auniformfamily of circuitsC1,C2,... | https://en.wikipedia.org/wiki/Circuit_complexity |
Mathematical logicis the study offormal logicwithinmathematics. Major subareas includemodel theory,proof theory,set theory, andrecursion theory(also known as computability theory). Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deduct... | https://en.wikipedia.org/wiki/Mathematical_logic |
Proof theoryis a major branch[1]ofmathematical logicandtheoretical computer sciencewithin whichproofsare treated as formalmathematical objects, facilitating their analysis by mathematical techniques. Proofs are typically presented asinductively defineddata structuressuch aslists, boxed lists, ortrees, which are constru... | https://en.wikipedia.org/wiki/Proof_theory |
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_classes |
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/NP_(complexity) |
Incomputational complexity theory,co-NPis acomplexity class. Adecision problemX is a member of co-NP if and only if itscomplementXis in the complexity classNP. The class can be defined as follows: a decision problem is in co-NP if and only if for everyno-instance we have a polynomial-length "certificate" and there is a... | https://en.wikipedia.org/wiki/CoNP |
Aquantum Turing machine(QTM) oruniversal quantum computeris anabstract machineused tomodelthe effects of aquantum computer. It provides a simple model that captures all of the power of quantum computation—that is, anyquantum algorithmcan be expressed formally as a particular quantum Turing machine. However, the comput... | https://en.wikipedia.org/wiki/Quantum_Turing_machine |
Incomputational complexity theory, thepolynomial hierarchy(sometimes called thepolynomial-time hierarchy) is ahierarchyofcomplexity classesthat generalize the classesNPandco-NP.[1]Each class in the hierarchy is contained withinPSPACE. The hierarchy can be defined usingoracle machinesoralternating Turing machines. It is... | https://en.wikipedia.org/wiki/Polynomial_hierarchy |
Inphilosophy, asupertaskis acountably infinitesequence of operations that occur sequentially within a finite interval of time.[1]Supertasks are calledhypertaskswhen the number of operations becomesuncountably infinite. A hypertask that includes one task for eachordinal numberis called anultratask.[2]The term "supertask... | https://en.wikipedia.org/wiki/Hypertask |
Finitismis aphilosophy of mathematicsthat accepts the existence only offinitemathematical objects. It is best understood in comparison to the mainstream philosophy of mathematics where infinite mathematical objects (e.g.,infinite sets) are accepted as existing.
The main idea of finitistic mathematics is not accepting ... | https://en.wikipedia.org/wiki/Strict_finitism |
Private biometricsis a form of encryptedbiometrics, also calledprivacy-preserving biometric authentication methods, in which the biometricpayloadis a one-way,homomorphically encrypted feature vectorthat is 0.05% the size of the originalbiometrictemplate and can be searched with full accuracy, speed and privacy. The fea... | https://en.wikipedia.org/wiki/Private_biometrics |
Verifiable computing(orverified computationorverified computing) enables acomputertooffloadthecomputationof some function, to other perhaps untrustedclients, while maintaining verifiable results. The other clients evaluate the function and return the result with a proof that thecomputationof the function was carried ou... | https://en.wikipedia.org/wiki/Verifiable_computing |
Client-side encryptionis thecryptographictechnique ofencryptingdata on the sender's side, before it is transmitted to aserversuch as acloud storage service.[1]Client-side encryption features an encryption key that is not available to the service provider, making it difficult or impossible for service providers to decry... | https://en.wikipedia.org/wiki/Client-side_encryption |
Confidential computingis a security andprivacy-enhancing computational techniquefocused on protectingdata in use. Confidential computing can be used in conjunction with storage and network encryption, which protectdata at restanddata in transitrespectively.[1][2]It is designed to address software, protocol, cryptograph... | https://en.wikipedia.org/wiki/Confidential_computing |
Searchable symmetric encryption(SSE) is a form ofencryptionthat allows one to efficiently search over a collection of encrypted documents or files without the ability to decrypt them.[1][2][3]SSE can be used to outsource files to an untrusted cloud storage server without ever revealing the files in the clear but while ... | https://en.wikipedia.org/wiki/Searchable_symmetric_encryption |
In computing,polymorphic codeis code that uses apolymorphic engineto mutate while keeping the originalalgorithmintact - that is, thecodechanges itself every time it runs, but thefunctionof the code (itssemantics) stays the same. For example, the simple math expressions 3+1 and 6-2 both achieve the same result, yet run ... | https://en.wikipedia.org/wiki/Polymorphic_code |
Private set intersectionis asecure multiparty computationcryptographic technique[1]that allows two parties holding sets to compare encrypted versions of these sets in order to compute the intersection. In this scenario, neither party reveals anything to the counterparty except for the elements in the intersection.
Oth... | https://en.wikipedia.org/wiki/Private_set_intersection |
Atime/memory/data tradeoff attackis a type ofcryptographic attackwhere an attacker tries to achieve a situation similar to thespace–time tradeoffbut with the additional parameter ofdata, representing the amount of data available to the attacker. An attacker balances or reduces one or two of those parameters in favor of... | https://en.wikipedia.org/wiki/Time/memory/data_tradeoff_attack |
Transport Layer Security(TLS) is acryptographic protocoldesigned to provide communications security over a computer network, such as theInternet. Theprotocolis widely used inapplicationssuch asemail,instant messaging, andvoice over IP, but its use in securingHTTPSremains the most publicly visible.
The TLS protocol aim... | https://en.wikipedia.org/wiki/Transport_Layer_Security#Cipher |
TheAdvanced Encryption Standard(AES), the symmetricblock cipherratified as a standard byNational Institute of Standards and Technologyof the United States (NIST), was chosen using a process lasting from 1997 to 2000 that was markedly more open and transparent than its predecessor, theData Encryption Standard(DES). This... | https://en.wikipedia.org/wiki/AES_process |
TheCompetition for Authenticated Encryption: Security, Applicability, and Robustness(CAESAR) is a competition organized by a group of international cryptologic researchers to encourage the design ofauthenticated encryptionschemes.[1]The competition was announced at the Early Symmetric Crypto workshop in January 2013 an... | https://en.wikipedia.org/wiki/CAESAR_Competition |
Incryptography, apinwheelwas a device for producing a shortpseudorandomsequence ofbits(determined by the machine's initial settings), as a component in a cipher machine. A pinwheel consisted of a rotating wheel with a certain number of positions on its periphery. Each position had a "pin", "cam" or "lug" which could be... | https://en.wikipedia.org/wiki/Pinwheel_(cryptography) |
TheMersenne Twisteris a general-purposepseudorandom number generator(PRNG) developed in 1997 byMakoto Matsumoto(松本 眞)andTakuji Nishimura(西村 拓士).[1][2]Its name derives from the choice of aMersenne primeas its period length.
The Mersenne Twister was created specifically to address most of the flaws found in earlier PRNG... | https://en.wikipedia.org/wiki/Mersenne_twister |
Amaximum length sequence(MLS) is a type ofpseudorandom binary sequence.
They are bit sequences generated using maximallinear-feedback shift registersand are so called because they areperiodicand reproduce everybinary sequence(except the zero vector) that can be represented by the shift registers (i.e., for length-mreg... | https://en.wikipedia.org/wiki/Maximum_length_sequence |
Ananalog feedback shift register(AFSR) is a generalization of the (binary, digital)linear-feedback shift register(LFSR).
While binary LFSRs require less power to generatespread spectrumsignals than AFSRs, AFSR receivers require less power (in theory) to synchronize to those signals than binary LFSR receivers.
As of 2... | https://en.wikipedia.org/wiki/Analog_feedback_shift_register |
Anonlinear-feedback shift register(NLFSR) is ashift registerwhose input bit is a non-linear function of its previous state.
For an n-bit shift registerrits next state is defined as:
ri+1(b0,b1,b2,…,bn−1)=ri(b1,b2,…,f(b0,b1,b2,…,bn−1)){\displaystyle r_{i+1}(b_{0},b_{1},b_{2},\ldots ,b_{n-1})=r_{i}(b_{1},b_{2},\ldots ,... | https://en.wikipedia.org/wiki/NLFSR |
Aring counteris a type of counter composed offlip-flopsconnected into ashift register, with the output of the last flip-flop fed to the input of the first, making a "circular" or "ring" structure.
There are two types of ring counters:
Ring counters are often used in hardware design (e.g.ASICandFPGAdesign) to createfi... | https://en.wikipedia.org/wiki/Ring_counter |
Apseudorandom binary sequence(PRBS),pseudorandom binary codeorpseudorandom bitstreamis abinary sequencethat, while generated with a deterministicalgorithm, is difficult to predict[1]and exhibits statistical behavior similar to a truly random sequence. PRBS generators are used intelecommunication, such as in analog-to-i... | https://en.wikipedia.org/wiki/Pseudo-random_binary_sequence |
AGold code, also known asGold sequence, is a type of binarysequence, used intelecommunications(CDMA)[1]and satellite navigation (GPS).[2]Gold codes are named after Robert Gold.[3][4]Gold codes have bounded smallcross-correlationswithin a set, which is useful when multiple devices are broadcasting in the same frequency ... | https://en.wikipedia.org/wiki/Gold_sequence |
JPL sequencesorJPL codesconsist of twolinear feedback shift registers(LFSRs) whose code sequence lengthsLaandLbmust be prime (relatively prime).[1]In this case the code sequence length of the generated overall sequenceLcis equal to:
It is also possible for more than two LFSRs to be interconnected through multipleXORsa... | https://en.wikipedia.org/wiki/JPL_sequence |
Kasami sequencesare binarysequencesof length2N−1whereNis an even integer. Kasami sequences have goodcross-correlationvalues approaching theWelch lower bound. There are two classes of Kasami sequences—the small set and the large set.
The process of generating a Kasami sequence is initiated by generating amaximum length... | https://en.wikipedia.org/wiki/Kasami_sequence |
TheIrish logarithmwas a system of number manipulation invented byPercy Ludgatefor machine multiplication. The system used a combination of mechanical cams aslookup tablesand mechanical addition to sum pseudo-logarithmic indices to produce partial products, which were then added to produce results.[1]
The technique is ... | https://en.wikipedia.org/wiki/Irish_logarithms |
TheCanon arithmeticusis a set ofmathematical tablesof indices and powers with respect toprimitive rootsfor prime powers less than 1000, originally published byCarl Gustav Jacob Jacobi(1839), with introductory text inLatin. The tables were at one time used for arithmetical calculations modulo prime powers, though like m... | https://en.wikipedia.org/wiki/Canon_arithmeticus |
Carl Gustav Jacob Jacobi[a](/dʒəˈkoʊbi/;[3]German:[jaˈkoːbi]; 10 December 1804 – 18 February 1851) was a Germanmathematicianwho made fundamental contributions toelliptic functions,dynamics,differential equations,determinantsandnumber theory.
Jacobi was born ofAshkenazi Jewishparentage inPotsdamon 10 December 1804. He ... | https://en.wikipedia.org/wiki/Carl_Gustav_Jacob_Jacobi |
TheA. W. Faber Model 366was an unusual model ofslide rule, manufactured in Germany by theA. W. Faber Companyaround 1909, with scales that followed a system invented by Johannes Schumacher (1858-1930) that useddiscrete logarithmsto calculate products of integers without approximation.[1][2][3]
The Model 366 is notable ... | https://en.wikipedia.org/wiki/Faber-Castell_Model_366 |
Gorō Shimura(志村 五郎,Shimura Gorō, 23 February 1930 – 3 May 2019)was a Japanesemathematicianand Michael Henry StraterProfessor EmeritusofMathematicsatPrinceton Universitywho worked innumber theory,automorphic forms, andarithmetic geometry.[1]He was known for developing the theory ofcomplex multiplication of abelian varie... | https://en.wikipedia.org/wiki/Goro_Shimura |
arXiv(pronounced as "archive"—the X represents theGreek letter chi⟨χ⟩)[1]is anopen-access repositoryof electronicpreprintsandpostprints(known ase-prints) approved for posting after moderation, but notpeer reviewed. It consists ofscientific papersin the fields ofmathematics,physics,astronomy,electrical engineering,compu... | https://en.wikipedia.org/wiki/ArXiv_(identifier) |
TheOn-Line Encyclopedia of Integer Sequences(OEIS) is an online database ofinteger sequences. It was created and maintained byNeil Sloanewhile researching atAT&T Labs. He transferred theintellectual propertyand hosting of the OEIS to theOEIS Foundationin 2009,[4]and is its chairman.
OEIS records information on integer... | https://en.wikipedia.org/wiki/On-Line_Encyclopedia_of_Integer_Sequences |
Innumber theory, anarithmetic,arithmetical, ornumber-theoretic function[1][2]is generally anyfunctionwhosedomainis the set ofpositive integersand whose range is asubsetof thecomplex numbers.[3][4][5]Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical pro... | https://en.wikipedia.org/wiki/Arithmetic_function#Divisor_sum_convolutions |
Arefactorable numberortau numberis an integernthat is divisible by the count of itsdivisors, or to put it algebraically,nis such thatτ(n)∣n{\displaystyle \tau (n)\mid n}withτ(n)=σ0(n)=∏i=1n(ei+1){\displaystyle \tau (n)=\sigma _{0}(n)=\prod _{i=1}^{n}(e_{i}+1)}forn=∏i=1npiei{\displaystyle n=\prod _{i=1}^{n}p_{i}^{e_{i}}... | https://en.wikipedia.org/wiki/Refactorable_number |
The tables below list all of thedivisorsof the numbers 1 to 1000.
A divisor of anintegernis an integerm, for whichn/mis again an integer (which is necessarily also a divisor ofn). For example, 3 is a divisor of 21, since 21/7 = 3 (and therefore 7 is also a divisor of 21).
Ifmis a divisor ofn, then so is −m. The table... | https://en.wikipedia.org/wiki/Table_of_divisors |
Accelerandois a 2005 science fiction novel consisting of a series of interconnected short stories written by British authorCharles Stross. As well as normal hardback and paperback editions, it was released as a freee-bookunder theCC BY-NC-ND license.Accelerandowon theLocus Awardin 2006,[1]and was nominated for several ... | https://en.wikipedia.org/wiki/Accelerando |
Accelerationismis a range ofrevolutionaryandreactionaryideologies that call for the drastic intensification ofcapitalistgrowth,technological change, and other processes of social change to destabilize existing systems and create radical social transformations, referred to as "acceleration".[1][2][3][4][5]It has been re... | https://en.wikipedia.org/wiki/Accelerationism |
Empiricalmethods
Prescriptiveand policy
Ineconomics,diminishing returnsmeans the decrease inmarginal(incremental) output of aproductionprocess as the amount of a singlefactor of productionis incrementally increased, holding all other factors of production equal (ceteris paribus).[1]The law of diminishing returns (als... | https://en.wikipedia.org/wiki/Diminishing_returns |
Future Shockis a 1970 book by AmericanfuturistAlvin Toffler,[1]written together with his wife Adelaide Farrell,[2][3]in which the authors define the term "future shock" as a certain psychological state of individuals and entire societies, and a personalperceptionof "too much change in too short a period of time". The b... | https://en.wikipedia.org/wiki/Future_Shock |
Terence Kemp McKenna(November 16, 1946–April 3, 2000) was an Americanethnobotanistandmysticwho advocated for the responsible use of naturally occurringpsychedelic plants. He spoke and wrote about a variety of subjects, includingpsychedelic drugs, plant-basedentheogens,shamanism,metaphysics,alchemy,language,philosophy,c... | https://en.wikipedia.org/wiki/Novelty_theory |
Asimulated realityis an approximation ofrealitycreated in asimulation, usually in a set of circumstances in which something is engineered to appear real when it is not.
Most concepts invoking a simulated reality relate to some form ofcomputer simulation, whether through the creation of avirtual realitythat creates app... | https://en.wikipedia.org/wiki/Simulated_reality |
Philip R. Zimmermann[2](born 1954)[1]is an Americancomputer scientistandcryptographer. He is the creator ofPretty Good Privacy(PGP), the most widely usedemail encryptionsoftware in the world.[2]He is also known for his work inVoIPencryption protocols, notablyZRTPandZfone. Zimmermann is co-founder and Chief Scientist of... | https://en.wikipedia.org/wiki/Zimmerman%27s_law |
TheInternational Technology Roadmap for Semiconductors(ITRS) is a set of documents that was coordinated and organized bySemiconductor Research Corporation[1]and produced by a group of experts in thesemiconductor industry. These experts were representative of the sponsoring organisations, including theSemiconductor Indu... | https://en.wikipedia.org/wiki/International_Technology_Roadmap_for_Semiconductors |
TheInternational Roadmap for Devices and Systems, orIRDS, is a set of predictions about likely developments in electronic devices and systems. The IRDS was established in 2016 and is the successor to theInternational Technology Roadmap for Semiconductors.
These predictions are intended to allow coordination of efforts ... | https://en.wikipedia.org/wiki/International_Roadmap_for_Devices_and_Systems |
Inelectronics, themetal–oxide–semiconductor field-effect transistor(MOSFET,MOS-FET,MOS FET, orMOS transistor) is a type offield-effect transistor(FET), most commonly fabricated by thecontrolled oxidationofsilicon. It has an insulated gate, thevoltageof which determines the conductivity of the device. This ability to ch... | https://en.wikipedia.org/wiki/MOSFET#Scaling |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.