text stringlengths 559 401k | source stringlengths 13 121 |
|---|---|
LSH is a cryptographic hash function designed in 2014 by South Korea to provide integrity in general-purpose software environments such as PCs and smart devices. LSH is one of the cryptographic algorithms approved by the Korean Cryptographic Module Validation Program (KCMVP).
And it is the national standard of South Ko... | Wikipedia/LSH_(hash_function) |
The Digital Signature Algorithm (DSA) is a public-key cryptosystem and Federal Information Processing Standard for digital signatures, based on the mathematical concept of modular exponentiation and the discrete logarithm problem. In a digital signature system, there is a keypair involved, consisting of a private and a... | Wikipedia/Digital_Signature_Algorithm |
In cryptography, a nonce is an arbitrary number that can be used just once in a cryptographic communication. It is often a random or pseudo-random number issued in an authentication protocol to ensure that each communication session is unique, and therefore that old communications cannot be reused in replay attacks. No... | Wikipedia/Cryptographic_nonce |
In cryptography, GMR is a digital signature algorithm named after its inventors Shafi Goldwasser, Silvio Micali and Ron Rivest.
As with RSA the security of the system is related to the difficulty of factoring very large numbers. But, in contrast to RSA, GMR is secure against adaptive chosen-message attacks, which is th... | Wikipedia/GMR_(cryptography) |
The Password Hashing Competition was an open competition announced in 2013 to select one or more password hash functions that can be recognized as a recommended standard. It was modeled after the successful Advanced Encryption Standard process and NIST hash function competition, but directly organized by cryptographers... | Wikipedia/Makwa_(cryptography) |
In cryptography, a brute-force attack or exhaustive key search is a cryptanalytic attack that consists of an attacker submitting many possible keys or passwords with the hope of eventually guessing correctly. This strategy can theoretically be used to break any form of encryption that is not information-theoretically s... | Wikipedia/Brute-force_attack |
Algebraic Eraser (AE) is an anonymous key agreement protocol that allows two parties, each having an AE public–private key pair, to establish a shared secret over an insecure channel. This shared secret may be directly used as a key, or to derive another key that can then be used to encrypt subsequent communications us... | Wikipedia/Algebraic_Eraser |
In computer science and cryptography, Whirlpool (sometimes styled WHIRLPOOL) is a cryptographic hash function. It was designed by Vincent Rijmen (co-creator of the Advanced Encryption Standard) and Paulo S. L. M. Barreto, who first described it in 2000.
The hash has been recommended by the NESSIE project. It has also... | Wikipedia/Whirlpool_(hash_function) |
The GOST hash function, defined in the standards GOST R 34.11-94 and GOST 34.311-95 is a 256-bit cryptographic hash function. It was initially defined in the Russian national standard GOST R 34.11-94 Information Technology – Cryptographic Information Security – Hash Function. The equivalent standard used by other membe... | Wikipedia/GOST_(hash_function) |
Post-Quantum Cryptography Standardization is a program and competition by NIST to update their standards to include post-quantum cryptography. It was announced at PQCrypto 2016. 23 signature schemes and 59 encryption/KEM schemes were submitted by the initial submission deadline at the end of 2017 of which 69 total were... | Wikipedia/NIST_Post-Quantum_Cryptography_Standardization |
In cryptography, truncated differential cryptanalysis is a generalization of differential cryptanalysis, an attack against block ciphers. Lars Knudsen developed the technique in 1994. Whereas ordinary differential cryptanalysis analyzes the full difference between two texts, the truncated variant considers differences ... | Wikipedia/Truncated_differential_cryptanalysis |
In cryptography, the Tiny Encryption Algorithm (TEA) is a block cipher notable for its simplicity of description and implementation, typically a few lines of code. It was designed by David Wheeler and Roger Needham of the Cambridge Computer Laboratory; it was first presented at the Fast Software Encryption workshop in... | Wikipedia/Tiny_Encryption_Algorithm |
Identity-based cryptography is a type of public-key cryptography in which a publicly known string representing an individual or organization is used as a public key. The public string could include an email address, domain name, or a physical IP address.
The first implementation of identity-based signatures and an emai... | Wikipedia/Identity-based_cryptography |
Integrated Encryption Scheme (IES) is a hybrid encryption scheme which provides semantic security against an adversary who is able to use chosen-plaintext or chosen-ciphertext attacks. The security of the scheme is based on the computational Diffie–Hellman problem.
Two variants of IES are specified: Discrete Logarithm ... | Wikipedia/Integrated_Encryption_Scheme |
Fugue is a cryptographic hash function submitted by IBM to the NIST hash function competition. It was designed by Shai Halevi, William E. Hall, and Charanjit S. Jutla. Fugue takes an arbitrary-length message and compresses it down to a fixed bit-length (either 224, 256, 384 or 512 bits). The hash functions for the diff... | Wikipedia/Fugue_(hash_function) |
In theoretical computer science and cryptography, a trapdoor function is a function that is easy to compute in one direction, yet difficult to compute in the opposite direction (finding its inverse) without special information, called the "trapdoor". Trapdoor functions are a special case of one-way functions and are wi... | Wikipedia/Trapdoor_function |
In cryptography, the Elliptic Curve Digital Signature Algorithm (ECDSA) offers a variant of the Digital Signature Algorithm (DSA) which uses elliptic-curve cryptography.
== Key and signature sizes ==
As with elliptic-curve cryptography in general, the bit size of the private key believed to be needed for ECDSA is abo... | Wikipedia/Elliptic_Curve_Digital_Signature_Algorithm |
The Password Hashing Competition was an open competition announced in 2013 to select one or more password hash functions that can be recognized as a recommended standard. It was modeled after the successful Advanced Encryption Standard process and NIST hash function competition, but directly organized by cryptographers... | Wikipedia/Catena_(cryptography) |
In cryptanalysis, the piling-up lemma is a principle used in linear cryptanalysis to construct linear approximations to the action of block ciphers. It was introduced by Mitsuru Matsui (1993) as an analytical tool for linear cryptanalysis. The lemma states that the bias (deviation of the expected value from 1/2) of a l... | Wikipedia/Piling-up_lemma |
BLAKE is a cryptographic hash function based on Daniel J. Bernstein's ChaCha stream cipher, but a permuted copy of the input block, XORed with round constants, is added before each ChaCha round. Like SHA-2, there are two variants differing in the word size. ChaCha operates on a 4×4 array of words. BLAKE repeatedly comb... | Wikipedia/BLAKE_(hash_function) |
In cryptography, a pepper is a secret added to an input such as a password during hashing with a cryptographic hash function. This value differs from a salt in that it is not stored alongside a password hash, but rather the pepper is kept separate in some other medium, such as a Hardware Security Module. Note that the... | Wikipedia/Pepper_(cryptography) |
ShangMi 3 (SM3) is a cryptographic hash function, standardised for use in commercial cryptography in China. It was published by the National Cryptography Administration (Chinese: 国家密码管理局) on 2010-12-17 as "GM/T 0004-2012: SM3 cryptographic hash algorithm".
SM3 is used for implementing digital signatures, message authen... | Wikipedia/SM3_(hash_function) |
Post-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms (usually public-key algorithms) that are currently thought to be secure against a cryptanalytic attack by a quantum computer. Most widely-used public-key algorithms... | Wikipedia/Post-quantum_cryptography |
Differential fault analysis (DFA) is a type of active side-channel attack in the field of cryptography, specifically cryptanalysis. The principle is to induce faults—unexpected environmental conditions—into cryptographic operations to reveal their internal states.
== Principles ==
Taking a smartcard containing an emb... | Wikipedia/Differential_fault_analysis |
Mix networks are routing protocols that create hard-to-trace communications by using a chain of proxy servers known as mixes which take in messages from multiple senders, shuffle them, and send them back out in random order to the next destination (possibly another mix node). This breaks the link between the source of ... | Wikipedia/Mix_network |
The Web Cryptography API is the World Wide Web Consortium’s (W3C) recommendation for a low-level interface that would increase the security of web applications by allowing them to perform cryptographic functions without having to access raw keying material. This agnostic API would perform basic cryptographic operations... | Wikipedia/Web_Cryptography_API |
In cryptography, impossible differential cryptanalysis is a form of differential cryptanalysis for block ciphers. While ordinary differential cryptanalysis tracks differences that propagate through the cipher with greater than expected probability, impossible differential cryptanalysis exploits differences that are imp... | Wikipedia/Impossible_differential_cryptanalysis |
PMAC, which stands for parallelizable MAC, is a message authentication code algorithm. It was created by Phillip Rogaway.
PMAC is a method of taking a block cipher and creating an efficient message authentication code that is reducible in security to the underlying block cipher.
PMAC is similar in functionality to the... | Wikipedia/PMAC_(cryptography) |
The Data Authentication Algorithm (DAA) is a former U.S. government standard for producing cryptographic message authentication codes. DAA is defined in FIPS PUB 113, which was withdrawn on September 1, 2008. The algorithm is not considered secure by today's standards.
According to the standard, a code produced by the ... | Wikipedia/Data_Authentication_Algorithm |
In cryptography, an SP-network, or substitution–permutation network (SPN), is a series of linked mathematical operations used in block cipher algorithms such as AES (Rijndael), 3-Way, Kalyna, Kuznyechik, PRESENT, SAFER, SHARK, and Square.
Such a network takes a block of the plaintext and the key as inputs, and applies... | Wikipedia/Substitution–permutation_network |
In cryptography, a pseudorandom function family, abbreviated PRF, is a collection of efficiently-computable functions which emulate a random oracle in the following way: no efficient algorithm can distinguish (with significant advantage) between a function chosen randomly from the PRF family and a random oracle (a func... | Wikipedia/Pseudorandom_function |
The NIST hash function competition was an open competition held by the US National Institute of Standards and Technology (NIST) to develop a new hash function called SHA-3 to complement the older SHA-1 and SHA-2. The competition was formally announced in the Federal Register on November 2, 2007. "NIST is initiating an ... | Wikipedia/NIST_hash_function_competition |
Cryptographic primitives are well-established, low-level cryptographic algorithms that are frequently used to build cryptographic protocols for computer security systems. These routines include, but are not limited to, one-way hash functions and encryption functions.
== Rationale ==
When creating cryptographic system... | Wikipedia/Cryptographic_primitive |
This article summarizes publicly known attacks against cryptographic hash functions. Note that not all entries may be up to date. For a summary of other hash function parameters, see comparison of cryptographic hash functions.
== Table color key ==
== Common hash functions ==
=== Collision resistance ===
=== Ch... | Wikipedia/Hash_function_security_summary |
Lexicographic codes or lexicodes are greedily generated error-correcting codes with remarkably good properties. They were produced independently by
Vladimir Levenshtein and by John Horton Conway and Neil Sloane. The binary lexicographic codes are linear codes, and include the Hamming codes and the binary Golay codes.
... | Wikipedia/Lexicographic_code |
In computer science, a one-way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here, "easy" and "hard" are to be understood in the sense of computational complexity theory, specifically the theory of polynomial time problems. This has nothing to do w... | Wikipedia/One-way_function |
JH is a cryptographic hash function submitted to the NIST hash function competition by Hongjun Wu. Though chosen as one of the five finalists of the competition, in 2012 JH ultimately lost to NIST hash candidate Keccak. JH has a 1024-bit state, and works on 512-bit input blocks. Processing an input block consists of ... | Wikipedia/JH_(hash_function) |
NSA Suite B Cryptography was a set of cryptographic algorithms promulgated by the National Security Agency as part of its Cryptographic Modernization Program. It was to serve as an interoperable cryptographic base for both unclassified information and most classified information.
Suite B was announced on 16 February 2... | Wikipedia/NSA_Suite_B_Cryptography |
The tables below compare cryptography libraries that deal with cryptography algorithms and have application programming interface (API) function calls to each of the supported features.
== Cryptography libraries ==
== FIPS 140 ==
This table denotes, if a cryptography library provides the technical requisites for FI... | Wikipedia/Comparison_of_cryptography_libraries |
The Encyclopedia of Cryptography and Security is a comprehensive work on Cryptography for both information security professionals and experts in the fields of Computer Science, Applied Mathematics, Engineering, Information Theory, Data Encryption, etc. It consists of 460 articles in alphabetical order and is availabl... | Wikipedia/Encyclopedia_of_Cryptography_and_Security |
A key in cryptography is a piece of information, usually a string of numbers or letters that are stored in a file, which, when processed through a cryptographic algorithm, can encode or decode cryptographic data. Based on the used method, the key can be different sizes and varieties, but in all cases, the strength of t... | Wikipedia/Cryptographic_keys |
Strong cryptography or cryptographically strong are general terms used to designate the cryptographic algorithms that, when used correctly, provide a very high (usually insurmountable) level of protection against any eavesdropper, including the government agencies. There is no precise definition of the boundary line b... | Wikipedia/Strong_cryptography |
Visual cryptography is a cryptographic technique 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 to Moni Naor and Adi Shamir, who developed it in 1994. They demonstrated a v... | Wikipedia/Visual_cryptography |
A whitening transformation or sphering transformation is a linear transformation that transforms a vector of random variables with a known covariance matrix into a set of new variables whose covariance is the identity matrix, meaning that they are uncorrelated and each have variance 1. The transformation is called "whi... | Wikipedia/Whitening_transformation |
In cryptography, higher-order differential cryptanalysis is a generalization of differential cryptanalysis, an attack used against block ciphers. While in standard differential cryptanalysis the difference between only two texts is used, higher-order differential cryptanalysis studies the propagation of a set of differ... | Wikipedia/Higher-order_differential_cryptanalysis |
The MD2 Message-Digest Algorithm is a cryptographic hash function developed by Ronald Rivest in 1989. The algorithm is optimized for 8-bit computers. MD2 is specified in IETF RFC 1319. The "MD" in MD2 stands for "Message Digest".
Even though MD2 is not yet fully compromised, the IETF retired MD2 to "historic" status i... | Wikipedia/MD2_(hash_function) |
In modern cryptography, symmetric key ciphers are generally divided into stream ciphers and block ciphers. Block ciphers operate on a fixed length string of bits. The length of this bit string is the block size. Both the input (plaintext) and output (ciphertext) are the same length; the output cannot be shorter than th... | Wikipedia/Block_size_(cryptography) |
The Cayley–Purser algorithm was a public-key cryptography algorithm published in early 1999 by 16-year-old Irishwoman Sarah Flannery, based on an unpublished work by Michael Purser, founder of Baltimore Technologies, a Dublin data security company. Flannery named it for mathematician Arthur Cayley. It has since been fo... | Wikipedia/Cayley–Purser_algorithm |
In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory, design of robust computer networks, and the the... | Wikipedia/Expander_graph |
In group theory, a subfield of abstract algebra, a cycle graph of a group is an undirected graph that illustrates the various cycles of that group, given a set of generators for the group. Cycle graphs are particularly useful in visualizing the structure of small finite groups.
A cycle is the set of powers of a given g... | Wikipedia/Cycle_graph_(algebra) |
In graph theory, a lattice graph, mesh graph, or grid graph is a graph whose drawing, embedded in some Euclidean space
R
n
{\displaystyle \mathbb {R} ^{n}}
, forms a regular tiling. This implies th... | Wikipedia/Grid_graph |
In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory, design of robust computer networks, and the the... | Wikipedia/Expander_graphs |
In the mathematical field of graph theory, a zero-symmetric graph is a connected graph in which each vertex has exactly three incident edges and, for each two vertices, there is a unique symmetry taking one vertex to the other. Such a graph is a vertex-transitive graph but cannot be an edge-transitive graph: the number... | Wikipedia/Zero-symmetric_graph |
In the mathematical field of graph theory, a graph G is symmetric or arc-transitive if, given any two ordered pairs of adjacent vertices
(
u
1
,
v
1
)
... | Wikipedia/Symmetric_graph |
In graph theory, the Lovász conjecture (1969) is a classical problem on Hamiltonian paths in graphs. It says:
Every finite connected vertex-transitive graph contains a Hamiltonian path.
Originally László Lovász stated the problem in the opposite way, but
this version became standard. In 1996, László Babai published a... | Wikipedia/Lovász_conjecture |
In the mathematical field of graph theory, a semi-symmetric graph is an undirected graph that is edge-transitive and regular, but not vertex-transitive. In other words, a graph is semi-symmetric if each vertex has the same number of incident edges, and there is a symmetry taking any of the graph's edges to any other of... | Wikipedia/Semi-symmetric_graph |
In graph theory, a branch of mathematics, an undirected graph is called an asymmetric graph if it has no nontrivial symmetries.
Formally, an automorphism of a graph is a permutation p of its vertices with the property that any two vertices u and v are adjacent if and only if p(u) and p(v) are adjacent.
The identity map... | Wikipedia/Asymmetric_graph |
In graph-theoretic mathematics, a biregular graph or semiregular bipartite graph is a bipartite graph
G
=
(
U
,
V
,
E
)
{\displaystyle G=(U,V,E)}
for which every two vertices on the same side of the given biparti... | Wikipedia/Biregular_graph |
In mathematics, especially group theory, two elements
a
{\displaystyle a}
and
b
{\displaystyle b}
of a group are conjugate if there is an element
g
{\displaystyle g}
in the group such that... | Wikipedia/Conjugation_(group_theory) |
In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes called a cyclic graph, but this term has other meanings.
== Equivalent definitions ==
Circulant graphs can be described in several equivalent ways:
The automo... | Wikipedia/Circulant_graph |
In the mathematical field of graph theory, a half-transitive graph is a graph that is both vertex-transitive and edge-transitive, but not symmetric. In other words, a graph is half-transitive if its automorphism group acts transitively upon both its vertices and its edges, but not on ordered pairs of linked vertices.
... | Wikipedia/Half-transitive_graph |
In the mathematical field of graph theory, an edge-transitive graph is a graph G such that, given any two edges e1 and e2 of G, there is an automorphism of G that maps e1 to e2.
In other words, a graph is edge-transitive if its automorphism group acts transitively on its edges.
== Examples and properties ==
The num... | Wikipedia/Edge-transitive_graph |
In physics, relativistic mechanics refers to mechanics compatible with special relativity (SR) and general relativity (GR). It provides a non-quantum mechanical description of a system of particles, or of a fluid, in cases where the velocities of moving objects are comparable to the speed of light c. As a result, class... | Wikipedia/Relativistic_physics |
The Applied Mechanics Division (AMD) is a division in the American Society of Mechanical Engineers (ASME). The AMD was founded in 1927, with Stephen Timoshenko being the first chair. The current AMD membership is over 5000, out of about 90,000 members of the ASME. AMD is the largest of the six divisions in the ASME ... | Wikipedia/Applied_Mechanics_Division |
Non-autonomous mechanics describe non-relativistic mechanical systems subject to time-dependent transformations. In particular, this is the case of mechanical systems whose Lagrangians and Hamiltonians depend on the time. The configuration space of non-autonomous mechanics is a fiber bundle
Q
... | Wikipedia/Non-autonomous_mechanics |
In physics, statistical mechanics is a mathematical framework that applies statistical methods and probability theory to large assemblies of microscopic entities. Sometimes called statistical physics or statistical thermodynamics, its applications include many problems in a wide variety of fields such as biology, neuro... | Wikipedia/Classical_statistical_mechanics |
Aristotelian physics is the form of natural philosophy described in the works of the Greek philosopher Aristotle (384–322 BC). In his work Physics, Aristotle intended to establish general principles of change that govern all natural bodies, both living and inanimate, celestial and terrestrial – including all motion (ch... | Wikipedia/Aristotelian_mechanics |
Biomechanics is the study of the structure, function and motion of the mechanical aspects of biological systems, at any level from whole organisms to organs, cells and cell organelles, using the methods of mechanics. Biomechanics is a branch of biophysics.
== Etymology ==
The word "biomechanics" (1899) and the relat... | Wikipedia/Biomechanics |
Orbital mechanics or astrodynamics is the application of ballistics and celestial mechanics to rockets, satellites, and other spacecraft. The motion of these objects is usually calculated from Newton's laws of motion and the law of universal gravitation. Astrodynamics is a core discipline within space-mission design an... | Wikipedia/Astrodynamics |
Computational mechanics is the discipline concerned with the use of computational methods to study phenomena governed by the principles of mechanics. Before the emergence of computational science (also called scientific computing) as a "third way" besides theoretical and experimental sciences, computational mechanics w... | Wikipedia/Computational_mechanics |
Soil mechanics is a branch of soil physics and applied mechanics that describes the behavior of soils. It differs from fluid mechanics and solid mechanics in the sense that soils consist of a heterogeneous mixture of fluids (usually air and water) and particles (usually clay, silt, sand, and gravel) but soil may also c... | Wikipedia/Soil_mechanics |
The Discourses and Mathematical Demonstrations Relating to Two New Sciences (Italian: Discorsi e dimostrazioni matematiche intorno a due nuove scienze pronounced [diˈskorsi e ddimostratˈtsjoːni mateˈmaːtike inˈtorno a dˈduːe ˈnwɔːve ʃˈʃɛntse]) published in 1638 was Galileo Galilei's final book and a scientific testamen... | Wikipedia/Two_New_Sciences |
Mechanics (Greek: Μηχανικά; Latin: Mechanica), also called Mechanical Problems or Questions of Mechanics, is a text traditionally attributed to Aristotle, but generally regarded as spurious (cf. Pseudo-Aristotle). Thomas Winter has suggested that the author was Archytas, while Michael Coxhead says that it is only poss... | Wikipedia/Mechanics_(Aristotle) |
Keyline design is a landscaping technique of maximizing the beneficial use of the water resources of a tract of land. The "keyline" is a specific topographic feature related to the natural flow of water on the tract. Keyline design is a system of principles and techniques of developing rural and urban landscapes to opt... | Wikipedia/Keyline_design |
Altium Designer (AD) is a printed circuit board (PCB) and electronic design automation software package for printed circuit boards. It is developed by American software company Altium Limited. Altium Designer was formerly named under the brand Protel.
== History ==
Altium Designer was originally launched in 2005 by A... | Wikipedia/Altium_Designer |
Procedural modeling is an umbrella term for a number of techniques in computer graphics to create 3D models and textures from sets of rules that may be easily changed over time. L-Systems, fractals, and generative modeling are procedural modeling techniques since they apply algorithms for producing scenes. The set of r... | Wikipedia/Parametric_modeling |
Building design, also called architectural design, refers to the broadly based architectural, engineering and technical applications to the design of buildings. All building projects require the services of a building designer, typically a licensed architect. Smaller, less complicated projects often do not require a li... | Wikipedia/Building_design |
Design by committee is a pejorative term for a project that has many designers involved but no unifying plan or vision.
== Usage of the term ==
The term is used to refer to suboptimal traits that such a process may produce as a result of having to compromise between the requirements and viewpoints of the participant... | Wikipedia/Design_by_committee |
Design Closure is a part of the digital electronic design automation workflow by which an integrated circuit (i.e. VLSI) design is modified from its initial description to meet a growing list of design constraints and objectives.
Every step in the IC design (such as static timing analysis, placement, routing, and so on... | Wikipedia/Design_closure |
Building information modeling (BIM) is an approach involving the generation and management of digital representations of the physical and functional characteristics of buildings or other physical assets and facilities. BIM is supported by various tools, processes, technologies and contracts. Building information model... | Wikipedia/Building_information_modeling |
Design flows are the explicit combination of electronic design automation tools to accomplish the design of an integrated circuit. Moore's law has driven the entire IC implementation RTL to GDSII design flows from one which uses primarily stand-alone synthesis, placement, and routing algorithms to an integrated constr... | Wikipedia/Design_flow_(EDA) |
A design pattern is the re-usable form of a solution to a design problem. The idea was introduced by the architect Christopher Alexander and has been adapted for various other disciplines, particularly software engineering.
== Details ==
An organized collection of design patterns that relate to a particular field is... | Wikipedia/Design_pattern |
The research-based design process is a research process proposed by Teemu Leinonen, inspired by several design theories. It is strongly oriented towards the building of prototypes and it emphasizes creative solutions, exploration of various ideas and design concepts, continuous testing and redesign of the design soluti... | Wikipedia/Research-based_design |
Functional Design is a paradigm used to simplify the design of hardware and software devices such as computer software and, increasingly, 3D models. A functional design assures that each modular part of a device has only one responsibility and performs that responsibility with the minimum of side effects on other parts... | Wikipedia/Functional_design |
A student design competition is a specific form of a student competition relating to design. Design competitions can be technical or purely aesthetic. The objective of technical competitions is to introduce students to real-world engineering situations and to teach students project-management and fabrication techniques... | Wikipedia/Student_design_competition |
A graphics card (also called a video card, display card, graphics accelerator, graphics adapter, VGA card/VGA, video adapter, display adapter, or colloquially GPU) is a computer expansion card that generates a feed of graphics output to a display device such as a monitor. Graphics cards are sometimes called discrete or... | Wikipedia/Graphics_card |
Sustainable furniture design and sustainable interior design is the design of a habitable interior using furniture, finishes, and equipment while addressing the environmental impact of products and building materials used. By considering the life-cycle impact of each step, from raw material through the manufacturing pr... | Wikipedia/Sustainable_furniture_design |
Inclusive design is a design process in which a product, service, or environment is designed to be usable for as many people as possible, particularly groups who are traditionally excluded from being able to use an interface or navigate an environment. Its focus is on fulfilling as many user needs as possible, not just... | Wikipedia/Design_justice |
In design, New Wave or Swiss Punk Typography refers to an approach to typography that defies strict grid-based arrangement conventions. Characteristics include inconsistent letterspacing, varying typeweights within single words and type set at non-right angles.
== Description ==
New Wave design was influenced by Punk... | Wikipedia/New_Wave_(design) |
Ecological design or ecodesign is an approach to designing products and services that gives special consideration to the environmental impacts of a product over its entire lifecycle. Sim Van der Ryn and Stuart Cowan define it as "any form of design that minimizes environmentally destructive impacts by integrating itsel... | Wikipedia/Ecological_design |
Ergonomics, also known as human factors or human factors engineering (HFE), is the application of psychological and physiological principles to the engineering and design of products, processes, and systems. Primary goals of human factors engineering are to reduce human error, increase productivity and system availabil... | Wikipedia/Ergonomic_design |
Postage stamp design is the activity of graphic design as applied to postage stamps. Many thousands of designs have been created since a profile bust of Queen Victoria was adopted for the Penny Black in 1840; some designs have been considered very successful, others
less so.
A stamp design includes several elements req... | Wikipedia/Postage_stamp_design |
Value-driven design (VDD) is a systems engineering strategy based on microeconomics which enables multidisciplinary design optimization. Value-driven design is being developed by the American Institute of Aeronautics and Astronautics, through a program committee of government, industry and academic representatives. I... | Wikipedia/Value-driven_design |
Architectural lighting design is a field of work or study that is concerned with the design of lighting systems within the built environment, both interior and exterior. It can include manipulation and design of both daylight and electric light or both, to serve human needs.
Lighting design is based in both science an... | Wikipedia/Architectural_lighting_design |
Algorithmic art or algorithm art is art, mostly visual art, in which the design is generated by an algorithm. Algorithmic artists are sometimes called algorists. Algorithmic art is created in the form of digital paintings and sculptures, interactive installations and music compositions.
Algorithmic art is not a new co... | Wikipedia/Algorithmic_art |
Computer-aided architectural design (CAAD) software programs are the repository of accurate and comprehensive records of buildings and are used by architects and architectural companies for architectural design and architectural engineering. As the latter often involve floor plan designs CAAD software greatly simplifi... | Wikipedia/Computer-aided_architectural_design |
An error-tolerant design (or human-error-tolerant design) is one that does not unduly penalize user or human errors. It is the human equivalent of fault tolerant design that allows equipment to continue functioning in the presence of hardware faults, such as a "limp-in" mode for an automobile electronics unit that wou... | Wikipedia/Error-tolerant_design |
Design optimization is an engineering design methodology using a mathematical formulation of a design problem to support selection of the optimal design among many alternatives. Design optimization involves the following stages:
Variables: Describe the design alternatives
Objective: Elected functional combination of v... | Wikipedia/Design_optimization |
Solid Modeling Solutions (SMS) was a software company that specialized in 3D computer graphics geometry software. SMS was acquired by Nvidia Corporation of Santa Clara, CA in May 2022 and was dissolved as a separate corporate entity.
== History ==
The development of non-uniform rational B-spline (NURBS) originated w... | Wikipedia/Solid_Modeling_Solutions |
A graphical user interface, or GUI, is a form of user interface that allows users to interact with electronic devices through graphical icons and visual indicators such as secondary notation. In many applications, GUIs are used instead of text-based UIs, which are based on typed command labels or text navigation. GUIs ... | Wikipedia/Graphical_user_interface |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.