unreferenced date September 2009 Image SZ42 6 wheels lightened.jpg thumbnail 320px The German Lorenz cipher machine contained 12 pinwheels, with a total of 501 pins In cryptography , a pinwheel was a device for producing a short Pseudo random number pseudorandom sequence of bit s 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 or lug which could be either set or unset . As the wheel rotated, each of these pins would in turn affect other parts of the machine, producing a series of on or off pulses which would repeat after one full rotation of the wheel. If the machine contained more than one wheel, usually their periods would be relatively prime to maximize the combined period. Pinwheels might be turned through a purely mechanical action as in the M 209 or electromechanical ly as in the Lorenz SZ 40 42 . Other cipher machines which used pinwheels include the C 52 cipher machine C 52 , the CD 57 and the Siemens and Halske T52 . Pinwheels can be viewed as a predecessor to the electronic linear feedback shift register LFSR , used in later cryptosystems. See also Rotor machine Cryptography navbox machines Category Encryption devices Category Cryptographic hardware crypto stub fr Pinwheel cryptographie ... more details
Unreferenced date June 2009 In cryptography , a boolean function is said to be complete if the value of each output bit depends on all input bits. This is a desirable property to have in an encryption cipher, so that if one bit of the input plaintext is changed, every bit of the output ciphertext has an average of 50 probability of changing. The easiest way to show why this is good is the following consider that if we changed our 8 byte plaintext s last byte, it would only have any effect on the 8th byte of the ciphertext. This would mean that if the attacker guessed 256 different plaintext ciphertext pairs, he would always know the last byte of every 8byte sequence we send effectively 12.5 of all our data . Finding out 256 plaintext ciphertext pairs is not hard at all in the internet world, given that standard protocols are used, and standard protocols have standard headers and commands e.g. get , put , mail from , etc. which the attacker can safely guess. On the other hand, if our cipher has this property and is generally secure in other ways, too , the attacker would need to collect 2 sup 64 sup 10 sup 20 sup plaintext ciphertext pairs to crack the cipher in this way. See also Correlation immunity Category Cryptography crypto stub ... more details
Citations missing date December 2007 Strong cryptography or cryptographically strong are general terms applied cryptography cryptographic systems or components that are considered highly resistant to cryptanalysis . Demonstrating the resistance of any cryptographic scheme to attack is a complex matter, requiring extensive testing and reviews, preferably in a public forum. Good algorithms and protocols are required, and good system design and implementation is needed as well. For instance, the operating system on which the crypto software runs should be as carefully secured as possible. Users may handle passwords insecurely, or trust service personnel overtly much, or simply misuse the software. See social engineering security social engineering . Strong thus is an imprecise term and may not apply in particular situations. Cryptographically strong algorithms This term cryptographically strong is often used to describe an encryption algorithm , and implies, in comparison to some other algorithm which is thus cryptographically weak , greater resistance to attack. But it can also be used to describe hashing and unique identifier and filename creation algorithms. See for example the description of the Microsoft .NET runtime library function Path.GetRandomFileName. ref citation url http ... standard. The term is commonly used to convey that some algorithm is suitable for some task in cryptography ... cryptography makes the job of intelligence agencies more difficult, many countries have enacted law ... export of cryptography beyond a certain strength measured in part by key size , and Russia banned ... people 199504 msg00018.html title nowiki A ban on cryptography in Russia fwd Next .. djf nowiki ... an example of strong cryptography, with versions running under most popular operating systems ... bp 051es.html Strong Cryptography The Global Tide of Change, Cato Institute Briefing Paper no. 51 See also Export of cryptography Category Cryptography ru ... more details
Malleability is a property of some cryptography cryptographic algorithm s. ref cite journal first1 Danny last1 Dolev author2 link Cynthia Dwork first2 Cynthia last2 Dwork author3 link Moni Naor first3 Moni last3 Naor title Nonmalleable Cryptography journal SIAM Journal on Computing volume 20 issue 2 pages 391 437 date 2000 doi 10.1137 S0097539795291562 ref An encryption algorithm is malleable if it is possible for an adversary to transform a ciphertext into another ciphertext which decrypts to a related plaintext . That is, given an encryption of a plaintext math m math , it is possible to generate another ciphertext which decrypts to math f m math , for a known function math f math , without necessarily knowing or learning math m math . Malleability is often an undesirable property in a general purpose cryptosystem, since it allows an attacker to modify the contents of a message. For example, suppose that a bank uses a stream cipher to hide its financial information, and a user sends an encrypted message containing, say, tt TRANSFER 0000100.00 TO ACCOUNT 199 tt . If an attacker can modify the message on the wire, and can guess the format of the unencrypted message, the attacker could be able to change the amount of the transaction, or the recipient of the funds, e.g. tt TRANSFER 0100000.00 TO ACCOUNT 227 tt . On the other hand, some cryptosystems are malleable by design. In other words, in some circumstances it may be viewed as a feature that anyone can transform an encryption of math m math into a valid encryption of math f m math for some restricted class of functions math f math without necessarily learning math m math . Such schemes are known as homomorphic encryption schemes. A cryptosystem may be Semantic security semantically secure against chosen plaintext attack ... cryptography padding methods such as Optimal Asymmetric Encryption Padding OAEP or PKCS1. In the ElGamal ... Portal Cryptography references Category Cryptography ... more details
Cleanup date March 2008 In cryptography , an adversary s advantage is a measure of how successfully it can attack a cryptographic algorithm , by distinguishing it from an idealized version of that type of algorithm. Note that in this context, the Adversary cryptography adversary is itself an algorithm and not a person . A cryptographic algorithm is considered secure if no adversary has a non negligible advantage, subject to specified bounds on the adversary s computational resources see concrete security . Negligible usually means within Big O notation O 2 sup p sup where p is a security parameter associated with the algorithm. For example, p might be the number of bits in a block cipher s key cryptography key . Description of concept Let F be an oracle machine oracle for the function being studied, and let G be an oracle for an idealized function of that type. The adversary A is a probabilistic algorithm given F or G as input and which outputs 1 or 0. A s job is to distinguish F from G based on making queries to the oracle that it s given. We say math Adv A Pr A F 1 Pr A G 1 math Examples Let F be a random instance of the Data Encryption Standard DES block cipher . This cipher has 64 bit blocks and a 56 bit key. The key therefore selects one of a family of 2 sup 56 sup permutation s on the 2 sup 64 sup possible 64 bit blocks. A random DES instance means our oracle F computes DES using some key K which is unknown to the adversary where K is selected from the 2 sup 56 sup possible keys with equal probability. We want to compare the DES instance with an Platonic ideal ideal ized 64 bit block cipher, meaning a permutation selected at random from the 2 sup 64 sup factorial possible permutations on 64 bit blocks. Call this randomly selected permutation G. Note from Stirling s approximation ... cse207 classnotes.html Introduction to Modern Cryptography Oded Goldreich, http theory.lcs.mit.edu oded frag.html Foundations of Cryptography Fragments of a Book Category Theory of cryptography ... more details
Wikify date June 2011 Orphan date June 2011 The ideas of Practical Mysticsim were embodied in the eponymous 1915 work of Evelyn Underhill . In that work Underhill sets out her belief spiritual life is part of our human nature and as such is available to every human being. ref name xcather Cather, Willa. The Professor s House, New York Knopf, 1925 ref Underhill s practical mysticism is secular rather than religious since it is a natural human activity. ref name underhill Underhill, Evelyn. Mysticism, New York Meridian Books, 1911 ref Underhil defines her meaning of Practical Mysticism in the following paragraph cquote Therefore it is to a practical mysticism that the practical man is here invited to a training of his latent faculties, a bracing and brightening of his languid consciousness, an emancipation from the fetters of appearance, a turning of his attention to new levels of the world. Thus he may become aware of the universe that the spiritual artist is always trying to disclose to the race. This amount of mystical perception this ordinary contemplation , as the specialist call it, is possible to all men without it, they are not wholly alive. It is a natural human activity Underhill s book was written at the outbreak of World War I, at a time of struggle and endurance, practical sacrifices, difficult and long continuous effort ref name underhill when practical mysticism was the activity needed most. External links wikisource Practical Mysticism s Practical Mysticism Full text of Practical Mysticism at Wikisource References Reflist Category Mysticism Category 1915 books ... more details
other uses2 Adversary Unreferenced date December 2009 In cryptography , an adversary rarely opponent , enemy is a malicious entity whose aim is to prevent the users of the cryptosystem from achieving their goal primarily privacy, integrity, and availability of data . An adversary s efforts might take the form of attempting to discover secret data, corrupting some of the data in the system, Spoofing attack spoof ing the identity of a message sender or receiver, or forcing system downtime. Actual adversaries, as opposed to idealized ones, are referred to as attackers . Not surprisingly, the former term predominates in the cryptographic and the latter in the computer security literature. Alice and Bob Eve, Mallory, Oscar and Trudy are all adversarial characters widely used in both types of texts. This notion of an adversary helps both intuitive and formal reasoning about cryptosystems by casting security analysis of cryptosystems as a game between the users and a centrally co ordinated enemy. The notion of security of a cryptosystem is meaningful only with respect to particular attacks usually presumed to be carried out by particular sorts of adversaries . There are several types of adversaries depending on what capabilities or intentions they are presumed to have. Adversaries may be computational boundedness computationally bounded or unbounded i.e. in terms of time and storage resources , eavesdropping or Byzantine i.e. passively listening on or actively corrupting data in the channel , static or adaptive i.e. having fixed or changing behavior , mobile or non mobile e.g. in the context of network security and so on. In actual security practice, the attacks assigned to such adversaries are often seen, so such notional analysis is not merely theoretical. How successful an adversary is at breaking a system is measured by its advantage . An adversary s advantage is the difference ... . DEFAULTSORT Adversary Cryptography Category Cryptographic attacks Category Article Feedback 5 crypto ... more details
Cipher Bureau EnigmaSeries In cryptography , the clock was a method devised by Poland Polish mathematician cryptologist Jerzy R ycki , at the Polish General Staff s Biuro Szyfr w Cipher Bureau , to facilitate decryption decrypting German Enigma machine Enigma cipher s. Method This method sometimes made it possible to determine which of the Enigma machine s rotors was at the far right, that is, in the position where the rotor always revolved at every depression of a key. ref Harvnb Rejewski 1984 p 290 ref R ycki s clock method was later elaborated by the British cryptologist Alan Turing at Bletchley Park in the development of a cryptological technique called Banburismus . ref Harvnb Good 1993 p 155 ref See also Biuro Szyfr w Notes reflist 2 References Citation last Kozaczuk first W adys aw author link W adys aw Kozaczuk year 1984 title Enigma How the German Machine Cipher Was Broken, and How It Was Read by the Allies in World War Two, edited and translated by Christopher Kasparek place Frederick, Maryland publisher University Publications of America isbn 978 0890935477 A revised and augmented translation of W kr gu enigmy , Warsaw , Ksi ka i Wiedza, 1979, supplemented with appendices by Marian Rejewski Citation last Rejewski first Marian author link Marian Rejewski year 1984 contribution The Mathematical Solution of the Enigma Cipher Appendix E of Harvnb Kozaczuk 1984 pp 272 91 Citation last Good first Jack author link I. J. Good year 1993 contribution Enigma and Fish editor last Hinsley editor first F.H. editor link Harry Hinsley editor2 last Stripp editor2 first Alan title Codebreakers The inside story of Bletchley Park publication place Oxford publisher Oxford University Press pages 149 66 isbn 978 0 19 280132 6 Cryptography navbox Category Cryptanalytic devices Category Science and technology in Poland Category Biuro Szyfr w crypto stub ar nl Clock cryptografie ... more details
In cryptography , blinding is a technique by which an agent can provide a service to i.e., compute a function mathematics function for a client in an encoded form without knowing either the real input or the real output. Blinding techniques also have applications to preventing side channel attack s on encryption devices. More precisely, Alice and Bob Alice has an input x and Oscar has a function f . Alice would like Oscar to compute y f x for her without revealing either x or y to him. The reason for her wanting this might be that she doesn t know the function f or that she does not have the resources to compute it. Alice blinds the message by encoding it into some other input E x the encoding E must be a bijection on the input space of f , ideally a random permutation. Oscar gives her f E x , to which she applies a decoding D to obtain D f E x y . Of course, not all functions admit of blind computation. The most common application of blinding is the blind signature . In a blind signature protocol, the signer digitally signs a message without being able to learn its content. The one time pad OTP is an application of blinding to the secure communication problem, by its very nature. Alice would like to send a message to Bob secretly, however all of their communication can be read by Oscar. Therefore Alice sends the message after blinding it with a secret key or OTP that she shares with Bob. Bob reverses the blinding after receiving the message. In this example, the function f is the identity function identity and E and D are both typically the exclusive disjunction XOR operation. Blinding can also be used to prevent certain side channel attack s on asymmetric key encryption algorithm asymmetric encryption schemes . Side channel attacks allow an adversary to recover information about the input to a cryptographic operation, by measuring something other than the algorithm s result ... Blinding Cryptography Category Cryptography ... more details
A practical engineer he is a professional degree awarded by technological colleges in Israel and validated ... qualification that combines theoretical study with practical training, and is currently available only in Israel. Practical Engineers are legally registered and are certified to perform engineering duties up to a certain level. It normally takes up to 3 academic years to obtain a Practical Engineer s degree, depending on the taught discipline. Professional regulation Practical Engineers are used ... by engineers and most of the practical work is done by technicians, practical engineers are taught to be able to follow instructions and re adapt concepts designed by engineers. In Israel, practical engineers are an integral part of the hi tech industry and form an important work force. Practical .... For example, in Israel, architectural practical engineers are permitted to design constructions ..., training & skills Practical engineers receive formal education that meets with criteria published ... engineers from practical engineers are the level and magnitude of foundation subjects, such as mathematics and physics. Practical Engineers are taught foundations but only to the extent ... process, practical engineers are also required to undertake national certification tests ... program. Equivalent qualifications There are no direct international qualifications equivalent to the Practical Engineer s degree. However, practical engineers are often thought of as Associate Engineers or Jr. Engineers. Although not an academic degree in its traditional sense, practical engineers ... 641ca59ab11b&code f154f7c4 c8d8 4a17 8357 641ca59ab11b Definition of Practical Engineer at ORT College s website . http www.hadassah.ac.il Site TechEn Departments Chemistry about.asp School of Practical Engineering, Hadassah College Jerusalem. he Practical Engineer at Wikipedia Hebrew http www.pet.ac.il School of Practical Engineering at the Technion IIT Israel Institute of Technology City ... more details
it. In general, SPEKE can use any prime order group that is suitable for public key cryptography, including elliptic curve cryptography . History SPEKE is one of the older and well known protocols ... links http www.jablon.org passwordlinks.html Jab97 Links for password based cryptographyCryptography navbox public key DEFAULTSORT Speke Cryptography Category Key agreement protocols ... more details
Refimprove date April 2009 In cryptography , padding refers to a number of distinct practices. Classical cryptography Official messages often start and end in predictable ways My dear ambassador, Weather report, Sincerely yours , etc. The primary use of padding with classical cipher s is to prevent the cryptanalyst from using that predictability to find crib cryptanalysis crib s ref Gordon Welchman , The Hut Six Story Breaking the Enigma Codes , p. 78. ref that aid in breaking the encryption. Random length padding also prevents an attacker from knowing the exact length of the plaintext message. Many classical ciphers arrange the plaintext into particular patterns e.g., squares, rectangles, etc. and if the plaintext doesn t exactly fit, it is often necessary to supply additional letters to fill out the pattern. Using nonsense letters for this purpose has a side benefit of making some kinds of cryptanalysis more difficult. A famous example of classical padding which caused a great misunderstanding is the world wonders . Such padding is not used in modern cryptography, because modern ciphers are designed to be secure even when the cryptanalyst chooses the message to encrypt. Symmetric cryptography Hash functions Most modern cryptographic hash function s process messages in fixed length blocks all but the earliest and most broken of these hash functions include some sort of padding scheme. It is critical for cryptographic hash functions to employ termination schemes that prevent a hash from being extended without such a scheme, many collision attacks become significantly easier ... bytes and padding bytes. Public key cryptography In public key cryptography , padding is the process ... technique to prevent cribs Initialisation vector , salt cryptography , which are sometimes confused ... xcbc.pdf Cryptography navbox block DEFAULTSORT Padding Cryptography Category Cryptography de Padding es Esquema de relleno fr Remplissage cryptographie simple Padding cryptography ... more details
One source date January 2008 In philosophy , practical reason is the use of reason to decide how to philosophy of action act . This contrasts with theoretical reason often called speculative reason , which is the use of reason to decide what to believe. For example agents use practical reason to decide whether to build a telescope, but speculative reason theoretical reason to decide which of two theories of light and optics is the best. Practical reason is understood by most philosophers as determining a plan of action. Thomism Thomistic ethics defines the first principle of practical reason as the good is to be done and pursued, and evil is to be avoided. ref http www.newadvent.org summa 2094.htm article2 Summa Theologi , I II q. 94 a. 2 co. ref For Kant , practical reason has a law abiding quality because the Categorical imperative is understood to be binding one to one s duty rather than subjective preferences. Utilitarianism Utilitarians tend to see reason as an instrument for the satisfactions ... events as well as necessary truths practical reason which determines whether a prospective course of action ... pride of place to metaphysics or wisdom. Since Descartes, practical judgment and reasoning have ... to justify beliefs. In cognitive research, practical reason is the process of ignoring unproductive ... of practical reason associated with pluralist moral and political philosophy in favour of a hermeneutical alternative. Elijah Millgram, ed., Varieties of Practical Reasoning , Cambridge, Mass. MIT Press, 2001. ISBN 0 262 63220 9. Joseph Raz, ed., Practical Reasoning , Oxford Oxford University Press, 1978. ISBN 0 19 875041 2. Charles Taylor, Explanation and Practical Reason, in Philosophical ... Stanford Encyclopedia of Philosophy http plato.stanford.edu entries practical reason Practical Reason http plato.stanford.edu entries practical reason med Medieval Theories of Practical Reason http plato.stanford.edu entries practical reason action Practical Reason and the Structure of Actions Philosophy ... more details
more footnotes date November 2010 In cryptography , a salt consists of Random Number Generator random bit s, creating one of the inputs to a one way function . The other input is usually a password or passphrase . The output of the one way function can be stored rather than the password, and still be used for authenticating users. The one way function typically uses a cryptographic hash function . A salt can also be combined with a password by a key derivation function such as PBKDF2 to generate a key cryptography key for use with a cipher or other cryptography cryptographic algorithm . In a typical usage for password authentication, the salt is stored along with the output of the one way function, sometimes along with the number of iteration s to be used in generating the output for key stretching . Early Unix systems used a 12 bit salt, but modern implementations use larger lengths from 48 to 128 bits. Salt is closely related to the concept of Cryptographic nonce nonce . The benefit provided by using a salted password is making a lookup table assisted dictionary attack against the stored values impractical, provided the salt is large enough. That is, an attacker would not be able to create a precomputed lookup table i.e. a rainbow table of hashed values password salt , because it would take too much space. A simple dictionary attack is still very possible, although much slower since it cannot be precomputed. Unix implementations Earlier versions of Unix used a Passwd file password file code etc passwd code to store the hashes of salted passwords passwords prepended with two character random salts . Note that in these older versions of Unix, the salt was also stored in the passwd file as cleartext together with the hash of the salted password. The password file was publicly ... password files. See also Password cracking Cryptographic nonce Initialization vector Padding cryptography ... Cryptographic Cheat Sheet Cryptography navbox hash DEFAULTSORT Salt Category Cryptography ca Sal criptografia ... more details
Multivariate cryptography is the generic term for asymmetric Cryptography cryptographic primitives based on Polynomial multivariate polynomials over finite field s. In certain cases those polynomials could be defined over both a ground and an extension Field mathematics field . If the polynomials have the Degree of a polynomial degree two, we talk about multivariate Quadratic polynomial quadratics . Solving systems of multivariate Polynomial Polynomial equations polynomial equations is proven to be NP Hard or NP Complete . That s why those schemes are often considered to be good candidates for post quantum cryptography , once quantum computers can break the current schemes. Today multivariate quadratics could be used only to build Digital signature signatures . All attempts to build a secure encryption scheme have so far failed. History In 1988 T. Matsumoto and H. Imai presented their scheme Matsumoto Imai Scheme on the Eurocrypt conference. On later work the Hidden Monomial Cryptosystems was developed by fr fr Jacques Patarin Jacques Patarin . It is based on a ground and an extension field. On this Hidden Field Equations was designed and presented in 1996. In the following years J. Patarin developed other schemes. In 1997 he presented Balanced Oil & Vinegar and 1999 Unbalanced Oil and Vinegar in cooperation with Aviad Kipnis and Louis Goubin. Construction Multivariate Quadratics involves a public and a private key. The private key consists of three affine transformations S,P ,T . In this triple P is the private transformation which is specially designed for each scheme. P maps elements from math GF n math math GF m math . S transforms from math GF n math math GF n math and T from math GF m math math GF m math . Each transformation must be invertible. Note that the elements are map in a field not in a group. Sometimes the triple is called a trapdoor. The public key results ... public key encryption and signature Category Multivariate cryptography ... more details
Unreferenced date June 2009 merge In camera effect date November 2010 Image Black Dahlia Film Shoot 3.jpg thumb right 250 px A Filming location location shot for The Black Dahlia film The Black Dahlia with a rainmaking rig, a sprinkler system used to create the appearance of rain a common practical effect A practical effect is a special effect in which a Theatrical property prop appears to work in a situation where it obviously could not in real life such as a ringing telephone on stage . They do not use trick photography or post production artifice. This type of effect is normally found in live theatre . In film , practical effect denotes an effect produced on set, without computer generated imagery . Special effect is often synonym ous with practical effect . In contrast, visual effects are created in post production through photographic manipulation or computer generation. Many of the staples of action movies are practical effects. Gunfire, bullet wounds, rain, wind, fire, and explosions can all be produced on a movie set by someone skilled in practical effects. DEFAULTSORT Practical Effect Category Special effects Filmmaking stub ... more details
free, Selected Areas in Cryptography SAC 95 Ottawa , Canada, May 18 19, 1995 workshop record . N. Rogier, Pascal Chauvaud, MD2 is not Secure without the Checksum Byte, Designs, Codes and Cryptography ... Online MD2 calculation and other hashes Cryptography navbox hash Category Broken hash functions da MD2 ... more details
Refimprove date February 2008 The vast majority of the National Security Agency s work on cryptography encryption is classified information classified , but from time to time NSA participates in standardization standards processes or otherwise publishes information about its cryptographic algorithms. The NSA has categorized encryption items into four product types, and algorithms into two suites. The following is a brief and incomplete summary of public knowledge about NSA algorithms and protocols. Type 1 Product Main Type 1 encryption A Type 1 Product refers to an NSA endorsed classified or controlled cryptographic item for classified or sensitive U.S. government information, including cryptographic equipment, assembly or component classified or certified by NSA for encrypting and decrypting classified and sensitive national security information when appropriately keyed. ref National Information Assurance Glossary CNSS Instruction No. 4009 National Information Assurance Glossary ref class wikitable Name Type Specification Use Equipment incomplete list ACCORDIAN or ACCORDION R21 TECH 13 00, ACCORDIAN 3.0 Specification August 2000 Advanced INFOSEC Machine AIM 1999 and 2004 brochures , SafeXcel 3340 , PSIAM ref name PSIAM http www.viasat.com government communications information assurance PSIAM ref Advanced Encryption Standard AES 256 bit keys only Block cipher FIPS 197 Numerous Numerous BATON Block cipher Various PKCS11 PKCS 11 , CDSA CSSM , Advanced INFOSEC Machine AIM 1999 and 2004 brochures , Cypris microchip Cypris , APCO Project 25 , MYK 85 , KOV 14 Fortezza Plus , SecNet ... FIREFLY EKMS public key cryptography public key cooperative key generation AIM 2004 , SafeXcel 3340 ... Government usage. Algorithm Suites Suite A Main NSA Suite A Cryptography A set of NSA unpublished .... Suite B Main NSA Suite B Cryptography A set of NSA endorsed cryptographic algorithms for use as an interoperable ... B Suite B NSA encryption algorithms NSA encryption systems References reflist Cryptography navbox Category ... more details
Infobox Magazine title Practical Mechanics image file Practical Mechanics 20 pound car.jpg image size 250px image caption Cover to Practical Mechanics , The Car Any Amateur Can Make publisher category Science and technology magazines total circulation circulation year frequency Monthly language English language English editor Frederick J. Camm editor title Editor in chief headquarters founded 1933 firstdate October 1933 country UK website issn Practical Mechanics was a monthly British magazine devoted mostly to home mechanics and technology. It was first published by George Newnes , Ltd., in October 1933, and ran for 352 issues until the magazine s termination in August 1963. Practical Mechanics was edited by Frederick J. Camm until his death in 1959. With an emphasis on things its readers could reasonably construct themselves, the magazine featured numerous articles on how to build things around one s house, such as a sink or bathtub. It also regularly featured more fanciful articles on how to build things with less obvious applications around the home, for example a Geiger counter , or an aeroplane for 25 not including the cost of an engine . The early issues were in black and white. The magazine began printing in color at an unknown date. Practical Mechanics was one of a number of DIY British publications, including Practical Householder , Practical Motorist , and Practical Wireless , also founded by Frederick J. Camm. Category British science and technology magazines Category Monthly magazines Category Publications established in 1933 Category Defunct magazines of the United Kingdom UK sci mag stub ... more details
Practical theology is the practical application of theology to everyday life. Richard Osmer explains that the four key questions and tasks in practical theology are What is going on? descriptive empirical task Why is this going on? interpretative task What ought to be going on? normative task How might we respond? pragmatic task ref cite book title Practical Theology An Introduction last Osmer first Richard Robert authorlink coauthors year 2008 publisher William B Eerdmans location isbn page 4 pages url http books.google.co.uk books?id dOXW ua4ZEgC&lpg PP1&ots 1BX FdBzVw&dq practical 20theology&pg PA4 v onepage&q&f false accessdate quote The Core Tasks of Practical Theological Interpretation ref Practical theology consists of several related sub fields applied theology such as missions, evangelism, pastoral psychology or the psychology of religion , church growth, administration, homiletics , spiritual formation, pastoral theology , spiritual direction, spiritual theology, political theology , theology of justice and peace and similar areas. ref Gerben Heitink, Practical theology history, theory, action domains manual for practical theology Wm. B. Eerdmans Publishing, 1999 http books.google.com books?id X O2d 61pkQC&source gbs navlinks s ref It also includes advocacy theology, such as the various liberation theology theologies of liberation of the oppressed in general, of the disenfranchised, of women, of immigrants, of children, and black theology . Practical theology may also include branches such as the theology of relational care , which describes Christians caring for others as Christ cared for the poor. ref John Frame, Homeless at Harvard Street Culture Relationships and a Theology of Relational Care , Harvard University Divinity School, Master s Thesis, April 13, 2009 ... Christian Boyd also writes about a new perspective of practical theology called convergent practical ... References reflist Christian theology Theology DEFAULTSORT Practical Theology Category Practical ... more details
refimprove date August 2011 Infobox Magazine title Practical Classics image file image size image caption editor Danny Hopkins editor title staff writer frequency monthly circulation UK category Classic automobiles company publisher Bauer Consumer Media firstdate 1980 country UK language English language English website http www.practicalclassics.co.uk issn Practical Classics is a magazine written in Peterborough , England about classic cars . It was started in 1980. It focuses on affordable classic cars for the man in the street, as well as more expensive and exotic classic cars that have now become affordable. It has always had a strong emphasis on DIY and showing the skills and tools that are needed for restoration, maintenance and repairs. The editorial staff all have old cars that they work to keep running, often to comic effect. They feature a price guide and buyer s guides to specific models. They also report on numbers of cars on UK roads. Bauer Consumer Media, publishers of Practical Classics , claim an ABC Audit Bureau of Circulations UK ABC audited circulation of 57,758 July December 2008 . ref http www.bauermedia.co.uk Brands Practical Classics http www.bauermedia.co.uk Brands Practical Classics Bauer Media s Practical Classics spec page ref References reflist Category Monthly magazines Category Publications established in 1980 Category English magazines Category 1980 in England Category British automobile magazines transport mag stub ... more details
publication place Oxford publisher Oxford University Press isbn 978 0 19 284055 4 Cryptography navbox machines DEFAULTSORT Fish Cryptography Category Encryption devices Category World War II military equipment of Germany Category Cryptographic hardware Category History of cryptography Category ... more details
Encyclopedia
top
