Algebraic Informatics [[electronic resource] ] : 6th International Conference, CAI 2015, Stuttgart, Germany, September 1-4, 2015. Proceedings / / edited by Andreas Maletti |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (VIII, 223 p. 21 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Cryptography Data encryption (Computer science) Computer science—Mathematics Discrete mathematics Software engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Cryptology Discrete Mathematics in Computer Science Software Engineering |
ISBN | 3-319-23021-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Learning Weighted Automata -- More Than 1700 Years of Word Equations -- An Algebraic Geometric Approach to Multidimensional Words -- Why We Need Semirings in Automata Theory -- Unbordered Pictures: Properties and Construction -- Effective Invariant Theory of Permutation Groups using Representation Theory -- On differential uniformity of maps that may hide an algebraic trapdoor -- On the Lower Block Triangular Nature of the Incidence Matrices to Compute the Algebraic Immunity of Boolean Functions -- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics -- A New Partial Key Exposure Attack on Multi-power RSA -- A Chomsky-Schutzenberger Theorem for Weighted Automata with Storage -- EF+EX Forest Algebras -- On near prime-order elliptic curves with small embedding degrees -- Key-Policy Multi-Authority Attribute-Based Encryption -- Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree -- Complexity of Uniform Membership of Context-Free Tree Grammars -- Attacking BEAR and LION schemes in a realistic scenario -- Weighted Restarting Automata and Pushdown Relations -- Equivalence checking problem for finite state transducers over semigroups. |
Record Nr. | UNISA-996466466203316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algebraic Informatics : 6th International Conference, CAI 2015, Stuttgart, Germany, September 1-4, 2015. Proceedings / / edited by Andreas Maletti |
Edizione | [1st ed. 2015.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
Descrizione fisica | 1 online resource (VIII, 223 p. 21 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Machine theory Cryptography Data encryption (Computer science) Computer science—Mathematics Discrete mathematics Software engineering Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Cryptology Discrete Mathematics in Computer Science Software Engineering |
ISBN | 3-319-23021-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Learning Weighted Automata -- More Than 1700 Years of Word Equations -- An Algebraic Geometric Approach to Multidimensional Words -- Why We Need Semirings in Automata Theory -- Unbordered Pictures: Properties and Construction -- Effective Invariant Theory of Permutation Groups using Representation Theory -- On differential uniformity of maps that may hide an algebraic trapdoor -- On the Lower Block Triangular Nature of the Incidence Matrices to Compute the Algebraic Immunity of Boolean Functions -- Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics -- A New Partial Key Exposure Attack on Multi-power RSA -- A Chomsky-Schutzenberger Theorem for Weighted Automata with Storage -- EF+EX Forest Algebras -- On near prime-order elliptic curves with small embedding degrees -- Key-Policy Multi-Authority Attribute-Based Encryption -- Extended Explicit Relations Between Trace, Definition Field, and Embedding Degree -- Complexity of Uniform Membership of Context-Free Tree Grammars -- Attacking BEAR and LION schemes in a realistic scenario -- Weighted Restarting Automata and Pushdown Relations -- Equivalence checking problem for finite state transducers over semigroups. |
Record Nr. | UNINA-9910483981003321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|