Now showing items 1-19 of 19

    • Analysis of Trivium Using Compressed Right Hand Side Equations 

      Schilling, Thorsten Ernst; Raddum, Håvard (Springer Berlin Heidelberg, 2012)
      We study a new representation of non-linear multivariate equations for algebraic cryptanalysis. Using a combination of multiple right hand side equations and binary decision diagrams, our new representation allows a ...
      Peer reviewedChapter
    • Classifying and Measuring Student Problems and Misconceptions 

      Rosbach, Alexander Hoem; Bagge, Anya Helene (Akademika forlag, 2013)
      In this paper we report on an attempt to classify student problems and mistakes, and measuring the frequency of particular problems in a firstsemester programming course. We also propose a scheme for annotating student ...
      Chapter
    • Comparison of Discrete and Continuous Models for the Pooling Problem 

      Alfaki, Mohammed; Haugland, Dag (Dagstuhl Publishing, 2011)
      The pooling problem is an important global optimization problem which is encountered in many industrial settings. It is traditionally modeled as a bilinear, nonconvex optimization problem, and solved by branch-and-bound ...
      ChapterPeer reviewed
    • Differential Fault Analysis of Trivium 

      Hojsík, Michal; Rudolf, Bohuslav (Springer Berlin Heidelberg, 2008)
      Trivium is a hardware-oriented stream cipher designed in 2005 by de Canni`ere and Preneel for the European project eStream, and it has successfully passed the first and the second phase of this project. Its design has ...
      ChapterPeer reviewed
    • Floating Fault Analysis of Trivium 

      Hojsík, Michal; Rudolf, Bohuslav (Springer Berlin Heidelberg, 2008)
      One of the eSTREAM final portfolio ciphers is the hardwareoriented stream cipher Trivium. It is based on 3 nonlinear feedback shift registers with a linear output function. Although Trivium has attached a lot of interest, ...
      ChapterPeer reviewed
    • The Inclusion Problem for Regular Expressions 

      Hovland, Dag (Springer, 2010)
      This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automata, and can therefore be faster than the ...
      Peer reviewedChapter
    • Inferring Required Permissions for Statically Composed Programs 

      Hasu, Tero; Bagge, Anya Helene; Haveraaen, Magne (Springer, 2013)
      Permission-based security models are common in smartphone operating systems. Such models implement access control for sensitive APIs, introducing an additional concern for application developers. It is important for the ...
      Chapter
    • Integrated Multi-aspect Visualization of 3D Fluid Flows 

      Brambilla, Andrea; Andreassen, Øyvind; Hauser, Helwig (The Eurographics Association, 2013)
      The motion of a fluid is affected by several intertwined flow aspects. Analyzing one aspect at a time can only yield partial information about the flow behavior. More details can be revealed by studying their interactions. ...
      Chapter
    • Parsing in a Broad Sense 

      Zaytsev, Vadim; Bagge, Anya Helene (Springer, 2014)
      Having multiple representations of the same instance is common in software language engineering: models can be visualised as graphs, edited as text, serialised as XML. When mappings between such representations are considered, ...
      Chapter
    • Phase Transition in a System of Random Sparse Boolean Equations 

      Schilling, Thorsten Ernst; Zajac, Pavol (Versita Open, 2012)
      Many problems, including algebraic cryptanalysis, can be transformed to a problem of solving a (large) system of sparse Boolean equations. In this article we study 2 algorithms that can be used to remove some redundancy ...
      Peer reviewedChapter
    • A Pretty Good Formatting Pipeline 

      Bagge, Anya Helene; Hasu, Tero (Springer, 2013)
      Proper formatting makes the structure of a program apparent and aids program comprehension. The need to format code arises in code generation and transformation, as well as in normal reading and editing situations. ...
      Chapter
    • Regular Expressions with Numerical Constraints and Automata with Counters 

      Hovland, Dag (Springer, 2009)
      Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be matched. Expressions in this extension describe the ...
      ChapterPeer reviewed
    • Separating Exceptional Concerns 

      Bagge, Anya Helene (IEEE, 2012)
      Traditional error handling mechanisms, including exceptions, have several weaknesses that interfere with maintainability, flexibility and genericity in software: Error code is tangled with normal code; reporting is ...
      Chapter
    • Similarity-based Exploded Views 

      Ruiz, Marc; Viola, Ivan; Boada, Imma; Bruckner, Stefan; Feixas, Miquel; Sbert, Mateu (Springer, 2008)
      Exploded views are often used in illustration to overcome the problem of occlusion when depicting complex structures. In this paper, we propose a volume visualization technique inspired by exploded views that partitions ...
      ChapterPeer reviewed
    • Solving Compressed Right Hand Side Equation Systems with Linear Absorption 

      Schilling, Thorsten Ernst; Raddum, Håvard (Springer Berlin Heidelberg, 2012)
      In this paper we describe an approach for solving complex multivariate equation systems related to algebraic cryptanalysis. The work uses the newly introduced Compressed Right Hand Sides (CRHS) representation, where ...
      Peer reviewedChapter
    • Solving Equation Systems by Agreeing and Learning 

      Schilling, Thorsten Ernst; Raddum, Håvard (Springer Berlin Heidelberg, 2010)
      We study sparse non-linear equation systems defined over a finite field. Representing the equations as symbols and using the Agreeing algorithm we show how to learn and store new knowledge about the system when a ...
      Peer reviewedChapter
    • Solving the pooling problem with LMI relaxations 

      Frimannslund, Lennart; El Ghami, Mohamed; Alfaki, Mohammed; Haugland, Dag (The authors, 2012)
      We consider the standard pooling problem with a single quality parameter, which is a polynomial global optimization problem occurring among other places in the oil industry. In this paper, we show that if the feasible ...
      Peer reviewedChapter
    • A Type System for Usage of Software Components 

      Hovland, Dag (Springer, 2009)
      The aim of this article is to support component-based software engineering by modelling exclusive and inclusive usage of software components. Truong and Bezem describe in several papers abstract languages for component ...
      ChapterPeer reviewed
    • Walk Your Tree Any Way You Want 

      Bagge, Anya Helene; Lämmel, Ralf (Springer, 2013)
      Software transformations in the Nuthatch style are described as walks over trees (possibly graphs) that proceed in programmerdefined steps which may observe join points of the walk, may observe and affect state associated ...
      Chapter