Listing 1 - 4 of 4 |
Sort by
|
Choose an application
Cryptography lies at the heart of most technologies deployed today for secure communications. At the same time, mathematics lies at the heart of cryptography, as cryptographic constructions are based on algebraic scenarios ruled by group or number theoretical laws. Understanding the involved algebraic structures is, thus, essential to design robust cryptographic schemes. This Special Issue is concerned with the interplay between group theory, symmetry and cryptography. The book highlights four exciting areas of research in which these fields intertwine: post-quantum cryptography, coding theory, computational group theory and symmetric cryptography. The articles presented demonstrate the relevance of rigorously analyzing the computational hardness of the mathematical problems used as a base for cryptographic constructions. For instance, decoding problems related to algebraic codes and rewriting problems in non-abelian groups are explored with cryptographic applications in mind. New results on the algebraic properties or symmetric cryptographic tools are also presented, moving ahead in the understanding of their security properties. In addition, post-quantum constructions for digital signatures and key exchange are explored in this Special Issue, exemplifying how (and how not) group theory may be used for developing robust cryptographic tools to withstand quantum attacks.
NP-Completeness --- protocol compiler --- post-quantum cryptography --- Reed–Solomon codes --- key equation --- euclidean algorithm --- permutation group --- t-modified self-shrinking generator --- ideal cipher model --- algorithms in groups --- lightweight cryptography --- generalized self-shrinking generator --- numerical semigroup --- pseudo-random number generator --- symmetry --- pseudorandom permutation --- Berlekamp–Massey algorithm --- semigroup ideal --- algebraic-geometry code --- non-commutative cryptography --- provable security --- Engel words --- block cipher --- cryptography --- beyond birthday bound --- Weierstrass semigroup --- group theory --- braid groups --- statistical randomness tests --- group-based cryptography --- alternating group --- WalnutDSA --- Sugiyama et al. algorithm --- cryptanalysis --- digital signatures --- one-way functions --- key agreement protocol --- error-correcting code --- group key establishment
Choose an application
The book provides a contemporary view on different aspects of the deductive systems in various types of logics including term logics, propositional logics, logics of refutation, non-Fregean logics, higher order logics and arithmetic.
Research & information: general --- Mathematics & science --- quine --- logic --- ontology --- multiple conclusion rule --- disjunction property --- metadisjunction --- axiomatizations of arithmetic of natural and integers numbers --- second-order theories --- Peano's axioms --- Wilkosz's axioms --- axioms of integer arithmetic modeled on Peano and Wilkosz axioms --- equivalent axiomatizations --- metalogic --- categoricity --- independence --- consistency --- logic of typical and atypical instances (LTA) --- logic of determination of objects (LDO) --- quasi topology structure (QTS) --- concept --- object --- typical object --- atypical object --- lattice --- filter --- ideal --- discussive logics --- the smallest discussive logic --- discussive operators --- seriality --- accessibility relation --- Kotas' method --- modal logic --- deontic logic --- ontology of situations --- semantics of law --- formal theory of law --- Wittgenstein --- Wolniewicz --- non-Fregean logic --- identity connective --- sentential calculus with identity --- situational semantics --- deduction --- (dual) tableau --- Gentzen system --- deductive refutability --- refutation systems --- hybrid deduction-refutation rules --- derivative hybrid rules --- soundness --- completeness --- natural deduction --- meta-proof theory --- synthetic tableaux --- principle of bivalence --- cut --- first-order theory --- universal axiom --- Peano's axiomatics of natural numbers --- Leśniewski's elementary ontology --- Frege's predication scheme --- Frege's Zahl-Anzahl distinction --- term logic --- Franz Brentano --- Lewis Carroll --- logic trees --- logic diagrams --- paraconsistent logic --- paraconsistency --- Sette's calculus --- the law of explosion --- the principle of ex contradictione sequitur quodlibet --- semantic tree --- distribution --- Aristotle's logic --- syllogistic --- Jan Łukasiewicz --- axiomatic system --- axiomatic refutation --- temporal logic --- intuitionistic logic --- minimal system --- knowledge --- sequent-type calculi --- nonmonotonic logics --- default logic --- rejection systems --- Kripke models --- logics of evidence and truth
Choose an application
The book provides a contemporary view on different aspects of the deductive systems in various types of logics including term logics, propositional logics, logics of refutation, non-Fregean logics, higher order logics and arithmetic.
Research & information: general --- Mathematics & science --- quine --- logic --- ontology --- multiple conclusion rule --- disjunction property --- metadisjunction --- axiomatizations of arithmetic of natural and integers numbers --- second-order theories --- Peano’s axioms --- Wilkosz’s axioms --- axioms of integer arithmetic modeled on Peano and Wilkosz axioms --- equivalent axiomatizations --- metalogic --- categoricity --- independence --- consistency --- logic of typical and atypical instances (LTA) --- logic of determination of objects (LDO) --- quasi topology structure (QTS) --- concept --- object --- typical object --- atypical object --- lattice --- filter --- ideal --- discussive logics --- the smallest discussive logic --- discussive operators --- seriality --- accessibility relation --- Kotas’ method --- modal logic --- deontic logic --- ontology of situations --- semantics of law --- formal theory of law --- Wittgenstein --- Wolniewicz --- non-Fregean logic --- identity connective --- sentential calculus with identity --- situational semantics --- deduction --- (dual) tableau --- Gentzen system --- deductive refutability --- refutation systems --- hybrid deduction–refutation rules --- derivative hybrid rules --- soundness --- completeness --- natural deduction --- meta-proof theory --- synthetic tableaux --- principle of bivalence --- cut --- first-order theory --- universal axiom --- Peano’s axiomatics of natural numbers --- Leśniewski’s elementary ontology --- Frege’s predication scheme --- Frege’s Zahl-Anzahl distinction --- term logic --- Franz Brentano --- Lewis Carroll --- logic trees --- logic diagrams --- paraconsistent logic --- paraconsistency --- Sette’s calculus --- the law of explosion --- the principle of ex contradictione sequitur quodlibet --- semantic tree --- distribution --- Aristotle’s logic --- syllogistic --- Jan Łukasiewicz --- axiomatic system --- axiomatic refutation --- temporal logic --- intuitionistic logic --- minimal system --- knowledge --- sequent-type calculi --- nonmonotonic logics --- default logic --- rejection systems --- Kripke models --- logics of evidence and truth --- n/a --- Peano's axioms --- Wilkosz's axioms --- Kotas' method --- hybrid deduction-refutation rules --- Peano's axiomatics of natural numbers --- Leśniewski's elementary ontology --- Frege's predication scheme --- Frege's Zahl-Anzahl distinction --- Sette's calculus --- Aristotle's logic
Choose an application
The book provides a contemporary view on different aspects of the deductive systems in various types of logics including term logics, propositional logics, logics of refutation, non-Fregean logics, higher order logics and arithmetic.
quine --- logic --- ontology --- multiple conclusion rule --- disjunction property --- metadisjunction --- axiomatizations of arithmetic of natural and integers numbers --- second-order theories --- Peano’s axioms --- Wilkosz’s axioms --- axioms of integer arithmetic modeled on Peano and Wilkosz axioms --- equivalent axiomatizations --- metalogic --- categoricity --- independence --- consistency --- logic of typical and atypical instances (LTA) --- logic of determination of objects (LDO) --- quasi topology structure (QTS) --- concept --- object --- typical object --- atypical object --- lattice --- filter --- ideal --- discussive logics --- the smallest discussive logic --- discussive operators --- seriality --- accessibility relation --- Kotas’ method --- modal logic --- deontic logic --- ontology of situations --- semantics of law --- formal theory of law --- Wittgenstein --- Wolniewicz --- non-Fregean logic --- identity connective --- sentential calculus with identity --- situational semantics --- deduction --- (dual) tableau --- Gentzen system --- deductive refutability --- refutation systems --- hybrid deduction–refutation rules --- derivative hybrid rules --- soundness --- completeness --- natural deduction --- meta-proof theory --- synthetic tableaux --- principle of bivalence --- cut --- first-order theory --- universal axiom --- Peano’s axiomatics of natural numbers --- Leśniewski’s elementary ontology --- Frege’s predication scheme --- Frege’s Zahl-Anzahl distinction --- term logic --- Franz Brentano --- Lewis Carroll --- logic trees --- logic diagrams --- paraconsistent logic --- paraconsistency --- Sette’s calculus --- the law of explosion --- the principle of ex contradictione sequitur quodlibet --- semantic tree --- distribution --- Aristotle’s logic --- syllogistic --- Jan Łukasiewicz --- axiomatic system --- axiomatic refutation --- temporal logic --- intuitionistic logic --- minimal system --- knowledge --- sequent-type calculi --- nonmonotonic logics --- default logic --- rejection systems --- Kripke models --- logics of evidence and truth --- n/a --- Peano's axioms --- Wilkosz's axioms --- Kotas' method --- hybrid deduction-refutation rules --- Peano's axiomatics of natural numbers --- Leśniewski's elementary ontology --- Frege's predication scheme --- Frege's Zahl-Anzahl distinction --- Sette's calculus --- Aristotle's logic
Listing 1 - 4 of 4 |
Sort by
|