Change search
Link to record
Permanent link

Direct link
BETA
Moss, Andrew
Publications (4 of 4) Show all publications
Betz, S., Šmite, D., Fricker, S., Moss, A., Afzal, W., Svahnberg, M., . . . Gorschek, T. (2013). An Evolutionary Perspective on Socio-Technical Congruence:The Rubber Band Effect. In: : . Paper presented at 3rd International Workshop on Replication in Empirical Software Engineering Research. Baltimore: IEEE Xplore
Open this publication in new window or tab >>An Evolutionary Perspective on Socio-Technical Congruence:The Rubber Band Effect
Show others...
2013 (English)Conference paper, Published paper (Refereed)
Abstract [en]

Conway’s law assumes a strong association between the system’s architecture and the organization’s communication structure that designs it. In the light of contemporary software development, when many companies rely on geographically distributed teams, which often turn out to be temporarily composed and thus having an often changing communication structure, the importance of Conway’s law and its inspired work grows. In this paper, we examine empirical research related to Conway’s law and its application for cross-site coordination. Based on the results obtained we conjecture that changes in the communication structure alone sooner or later trigger changes in the design structure of the software products to return the sociotechnical system into the state of congruence. This is further used to formulate a concept of a rubber band effect and propose a replication study that goes beyond the original idea of Conway’s law by investigating the evolution of socio-technical congruence over time.

Place, publisher, year, edition, pages
Baltimore: IEEE Xplore, 2013
Keywords
Conway’s Law, Socio-Technical Congruence, Evolution
National Category
Software Engineering
Identifiers
urn:nbn:se:bth-6918 (URN)oai:bth.se:forskinfo1D1DC706A1BEDFDEC1257BC50032BF07 (Local ID)oai:bth.se:forskinfo1D1DC706A1BEDFDEC1257BC50032BF07 (Archive number)oai:bth.se:forskinfo1D1DC706A1BEDFDEC1257BC50032BF07 (OAI)
Conference
3rd International Workshop on Replication in Empirical Software Engineering Research
Note

...at Empirical Software Engineering International Week

Available from: 2013-08-29 Created: 2013-08-12 Last updated: 2018-01-11Bibliographically approved
Granger, R. & Moss, A. (2013). Generalised mersenne numbers revisited. Mathematics of Computation, 82(284), 2389-2420
Open this publication in new window or tab >>Generalised mersenne numbers revisited
2013 (English)In: Mathematics of Computation, ISSN 0025-5718, E-ISSN 1088-6842, Vol. 82, no 284, p. 2389-2420Article in journal (Refereed) Published
Abstract [en]

Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attractive choice for modular multiplication implementation. However, the issue of residue multiplication efficiency seems to have been overlooked. Asymptotically, using a cyclic rather than a linear convolution, residue multiplication modulo a Mersenne number is twice as fast as integer multiplication; this property does not hold for prime GMNs, unless they are of Mersenne's form. In this work we exploit an alternative generalisation of Mersenne numbers for which an analogue of the above property - and hence the same efficiency ratio - holds, even at bitlengths for which schoolbook multiplication is optimal, while also maintaining very efficient reduction. Moreover, our proposed primes are abundant at any bitlength, whereas GMNs are extremely rare. Our multiplication and reduction algorithms can also be easily parallelised, making our arithmetic particularly suitable for hardware implementation. Furthermore, the field representation we propose also naturally protects against side-channel attacks, including timing attacks, simple power analysis and differential power analysis, which is essential in many cryptographic scenarios, in constrast to GMNs.

Place, publisher, year, edition, pages
American Mathematical Society, 2013
National Category
Mathematics Computer Sciences
Identifiers
urn:nbn:se:bth-6813 (URN)10.1090/S0025-5718-2013-02704-4 (DOI)000326291500024 ()oai:bth.se:forskinfoE1314925BC5F6DB1C1257BE50045E272 (Local ID)oai:bth.se:forskinfoE1314925BC5F6DB1C1257BE50045E272 (Archive number)oai:bth.se:forskinfoE1314925BC5F6DB1C1257BE50045E272 (OAI)
Available from: 2013-12-17 Created: 2013-09-13 Last updated: 2018-01-11Bibliographically approved
Moss, A., Oswald, E., Page, d. & Tunstall, M. (2012). Compiler Assisted Masking. In: (Ed.), Lecture Notes in Computer Science: . Paper presented at 14th International Workshop on Cryptographic Hardware and Embedded Systems, CHES (pp. 58-75). Springer, 7428
Open this publication in new window or tab >>Compiler Assisted Masking
2012 (English)In: Lecture Notes in Computer Science, Springer , 2012, Vol. 7428, p. 58-75Conference paper, Published paper (Refereed) Published
Abstract [en]

Differential Power Analysis (DPA) attacks find a statistical correlation between the power consumption of a cryptographic device and intermediate values within the computation. Randomization via (Boolean) masking of intermediate values breaks this statistical dependence and thus prevents such attacks (at least up to a certain order). Especially for software implementations, (first-order) masking schemes are popular in academia and industry, albeit typically not as the sole countermeasure. The current practice then is to manually 'insert' Boolean masks: essentially software developers need to manipulate low-level assembly language to implement masking. In this paper we make a first step to automate this process, at least for first-order Boolean masking, allowing the development of compilers capable of protecting programs against DPA.

Place, publisher, year, edition, pages
Springer, 2012
Keywords
Compiler assisted cryptography, DPA, masking
National Category
Software Engineering Computer Sciences
Identifiers
urn:nbn:se:bth-7057 (URN)10.1007/978-3-642-33027-8_4 (DOI)oai:bth.se:forskinfo8AE1BA8441C1E260C1257AC60049E93B (Local ID)oai:bth.se:forskinfo8AE1BA8441C1E260C1257AC60049E93B (Archive number)oai:bth.se:forskinfo8AE1BA8441C1E260C1257AC60049E93B (OAI)
Conference
14th International Workshop on Cryptographic Hardware and Embedded Systems, CHES
Note
Conference in Leuven 2012Available from: 2012-12-21 Created: 2012-11-30 Last updated: 2018-01-11Bibliographically approved
Barbosa, M., Moss, A., Page, D., Rodrigues, N. & Silva, P. (2012). Type checking cryptography implementations. In: (Ed.), Lecture Notes in Computer Science: . Paper presented at 4th IPM International Conference on Fundamentals of Software Engineering, FSEN 2011 (pp. 316-334). Springer, 7141
Open this publication in new window or tab >>Type checking cryptography implementations
Show others...
2012 (English)In: Lecture Notes in Computer Science, Springer , 2012, Vol. 7141, p. 316-334Conference paper, Published paper (Refereed) Published
Abstract [en]

Cryptographic software development is a challenging field: high performance must be achieved, while ensuring correctness and compliance with low-level security policies. CAO is a domain specific language designed to assist development of cryptographic software. An important feature of this language is the design of a novel type system introducing native types such as predefined sized vectors, matrices and bit strings, residue classes modulo an integer, finite fields and finite field extensions, allowing for extensive static validation of source code. We present the formalisation, validation and implementation of this type system.

Place, publisher, year, edition, pages
Springer, 2012
Keywords
Bit-strings, Cryptographic software, Domain specific languages, Finite fields, Formalisation, Residue class, Security policy, Source codes, Type systems, Typechecking
National Category
Software Engineering
Identifiers
urn:nbn:se:bth-7058 (URN)10.1007/978-3-642-29320-7_21 (DOI)oai:bth.se:forskinfo2474A8502D95F042C1257AC900499A0E (Local ID)oai:bth.se:forskinfo2474A8502D95F042C1257AC900499A0E (Archive number)oai:bth.se:forskinfo2474A8502D95F042C1257AC900499A0E (OAI)
Conference
4th IPM International Conference on Fundamentals of Software Engineering, FSEN 2011
Note
Conference site: TehranAvailable from: 2012-12-21 Created: 2012-12-03 Last updated: 2018-01-11Bibliographically approved
Organisations

Search in DiVA

Show all publications